Quantum query complexity of graph connectivity
| dc.creator | Durr, Christoph | |
| dc.creator | Mhalla, Mehdi | |
| dc.creator | Lei, Yaohui | |
| dc.date | 2003-03-27 | |
| dc.date | 2003-04-05 | |
| dc.date.accessioned | 2026-07-07T06:06:27Z | |
| dc.date.available | 2026-07-07T06:06:27Z | |
| dc.description | Harry Buhrman et al gave an Omega(sqrt n) lower bound for monotone graph properties in the adjacency matrix query model. Their proof is based on the polynomial method. However for some properties stronger lower bounds exist. We give an Omega(n^{3/2}) bound for Graph Connectivity using Andris Ambainis' method, and an O(n^{3/2} log n) upper bound based on Grover's search algorithm. In addition we study the adjacency list query model, where we have almost matching lower and upper bounds for Strong Connectivity of directed graphs. | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0303169 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0303169 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/90980 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum query complexity of graph connectivity | |
| dc.type | text |