Name
Abstract | ||
|---|---|---|
We develop a new framework that extends the quantum walk framework of Magniez, Nayak, Roland, and Santha, by utilizing the idea of quantum data structures to construct an efficient method of nesting quantum walks. Surprisingly, only classical data structures were considered before for searching via quantum walks. The recently proposed learning graph framework of Belovs has yielded improved upper bounds for several problems, including triangle finding and more general subgraph detection. We exhibit the power of our framework by giving a simple explicit constructions that reproduce both the O(n35/27) and O(n9/7) learning graph upper bounds (up to logarithmic factors) for triangle finding, and discuss how other known upper bounds in the original learning graph framework can be converted to algorithms in our framework. We hope that the ease of use of this framework will lead to the discovery of new upper bounds. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.5555/2627817.2627923 | SODA |
Keywords | Field | DocType |
algorithms,design,general,theory,graph theory | Graph,Discrete mathematics,Quantum,Data structure,Combinatorics,Computer science,Quantum mechanics,Quantum walk,Quantum algorithm,Logarithm | Conference |
ISSN | ISBN | Citations |
Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms
(SODA 2013), pp. 1474-1485 (2013) | 978-1-61197-251-1 | 12 |
PageRank | References | Authors |
0.61 | 22 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stacey Jeffery | 1 | 207 | 16.16 |
| Robin Kothari | 2 | 196 | 21.05 |
| Frédéric Magniez | 3 | 570 | 44.33 |