Quantum Query Complexity of Some Graph Problems
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic_journal
|
| gptkbp:author |
gptkb:Andris_Ambainis
|
| gptkbp:citation |
over 200
|
| gptkbp:focusesOn |
connectivity
minimum spanning tree bipartiteness graph properties |
| https://www.w3.org/2000/01/rdf-schema#label |
Quantum Query Complexity of Some Graph Problems
|
| gptkbp:provenBy |
quantum lower bounds for bipartiteness
quantum lower bounds for connectivity quantum lower bounds for minimum spanning tree |
| gptkbp:publicationYear |
2004
|
| gptkbp:publishedIn |
gptkb:SIAM_Journal_on_Computing
|
| gptkbp:shows |
quantum query complexity of bipartiteness is Omega(n^{3/2})
quantum query complexity of connectivity is Omega(n^{3/2}) quantum query complexity of minimum spanning tree is Omega(n^{3/2}) |
| gptkbp:studies |
quantum algorithms for graph properties
quantum lower bounds for graph properties |
| gptkbp:topic |
gptkb:quantum_computing
quantum query complexity graph problems |
| gptkbp:bfsParent |
gptkb:Ben_Reichardt
|
| gptkbp:bfsLayer |
7
|