Row 4330

Row ID: 4330 | Dataset Entry | Axioma AXP Content Repository

Content Data

This page contains data entry 4330 from the Axioma AXP content repository. The structured data below represents the complete record for this entry.

Is it possible to demonstrate quantum advantage for a combinatorial graph routing shortest path problem using QAOA. What should be my approach on reporting quantum advantage? I haven't found solid resources on time complexity for QAOA. So I'm just confused on whether there is any scope for quantum advantage in solving a classically feasible routing problem (using Djikstra algorithm), or any approach I must take to determine such an advantage.

FieldValue
text Is it possible to demonstrate quantum advantage for a combinatorial graph routing shortest path problem using QAOA. What should be my approach on reporting quantum advantage? I haven't found solid resources on time complexity for QAOA. So I'm just confused on whether there is any scope for quantum advantage in solving a classically feasible routing problem (using Djikstra algorithm), or any approach I must take to determine such an advantage.
label r/quantumcomputing
dataType post
communityName r/QuantumComputing
datetime 2024-04-08
username_encoded Z0FBQUFBQm5LakwxNTBPdFNLSlptbURBWlpqaWQ2SHZZSU9rVUw3TUV1aDZ1ejF0dmZuVm5fSHpTZmRwOFJTdjVzd1htSlNwNkQ5c1hVaEQwbW10a3VSbnNLUzJQcXJVSVE9PQ==
url_encoded Z0FBQUFBQm5Lak9GakdyYlQ3RXMzQk9Fb3dtZFk2RjJpTnoxd0ptWlVfU3NCLXNROWNFU2gzRXI3cmJKSEVMb0ZULUNtbVJKdko2eS1rRm5pM0RQNnNZbkZXeDl1cjg2UXZSLTlWX1JjbUtRdHhiOU5qcF9UblhEOWFqLVNNTzUwaFJ5NjJILVNSNTVRVjMxcWN3bHlMa3dibVNhNndJU21XZmFBZC0waWdVS1RvbHJfQ0FqTVY1VmZad2NBMk1ycVdJZV81U1RuRGdl

Raw Record

{
  "text": "Is it possible to demonstrate quantum advantage for a combinatorial graph routing shortest path problem using QAOA. \nWhat should be my approach on reporting quantum advantage?\nI haven't found solid resources on time complexity for QAOA. So I'm just confused on whether there is any scope for quantum advantage in solving a classically feasible routing problem (using Djikstra algorithm), or any approach I must take to determine such an advantage. ",
  "label": "r/quantumcomputing",
  "dataType": "post",
  "communityName": "r/QuantumComputing",
  "datetime": "2024-04-08",
  "username_encoded": "Z0FBQUFBQm5LakwxNTBPdFNLSlptbURBWlpqaWQ2SHZZSU9rVUw3TUV1aDZ1ejF0dmZuVm5fSHpTZmRwOFJTdjVzd1htSlNwNkQ5c1hVaEQwbW10a3VSbnNLUzJQcXJVSVE9PQ==",
  "url_encoded": "Z0FBQUFBQm5Lak9GakdyYlQ3RXMzQk9Fb3dtZFk2RjJpTnoxd0ptWlVfU3NCLXNROWNFU2gzRXI3cmJKSEVMb0ZULUNtbVJKdko2eS1rRm5pM0RQNnNZbkZXeDl1cjg2UXZSLTlWX1JjbUtRdHhiOU5qcF9UblhEOWFqLVNNTzUwaFJ5NjJILVNSNTVRVjMxcWN3bHlMa3dibVNhNndJU21XZmFBZC0waWdVS1RvbHJfQ0FqTVY1VmZad2NBMk1ycVdJZV81U1RuRGdl"
}
Explore Dataset Explore Row

Entry Information