Quantum speed-up of Markov Chain based algorithms

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 32-41

  Szegedy, Mario ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION; QUANTUM ALGORITHMS; QUANTUM WALKS; TRANSITION MATRICES;

ALGORITHMS; BOUNDARY VALUE PROBLEMS; COMPUTER SCIENCE; CONSTRAINT THEORY; EIGENVALUES AND EIGENFUNCTIONS; MARKOV PROCESSES; MATRIX ALGEBRA; PROBABILITY;

QUANTUM THEORY;

EID: 17744397785     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. [AaA] S. Aaronson and A. Ambainis. Quantum search of spatial regions. In Proc. 44th Annual IEEE Symp. on Foundations of Computer Science (FOCS), pages 200-209, 2003
2. [AAKV] D. Aharonov, A. Ambainis, J. Kempe, U. Vazirani: Quantum walks on graphs, quant-ph/00121090, Proc 33rd STOC, 50 (2001)
3. [ABNVW] Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, John Watrous: "One-dimensional quantum walks." STOC 2001:37-49
4. [ADZ] Y. Aharonov, L. Davidovich, and N. Zagury: "Quantum Random Walks," Physical Review, A 48, 1687 (1993)
5. [AF] D. Aldous and J. Fill, Reversible Markov Chains and Random Walks on Graphs, manuscript http://www.stat.berkeley.edu/users/aldous/ RWG/book.html,.
6. [Amb03] A. Ambainis. Quantum walk algorithm for element distinctness quant-ph/0311001
7. [ABNV] Ambainis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous: One-dimensional quantum walks. Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 37-49, 2001.
8. [AKR] A. Ambainis, J. Kempe, A. Rivosh. Coins Make Quantum Walks Faster quant-ph/0402107
9. [BHMT] Gilles Brassard, Peter Hoyer, Michele Mosca, Alain Tapp: Quantum Amplitude Amplification and Estimation. quant-ph/0005055
10. [BK] A. Broder, A. Karlin, "Lower Bounds on the Cover Time", SRC Report 32
11. [CCDF] Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gut mann, Daniel A. Spielman Exponential algorithmic speedup by a quantum walk, quant-ph/0209131
12. [CE] Andrew M. Childs, Jason M. Eisenberg: Quantum algorithms for subset finding. quant-ph/0311038
13. [CG03] Childs, Goldstone: Spatial search by quantum walk, quant-ph/0306054
14. [CG04] Childs, Goldstone: Spatial search and the Dirac equation, quant-ph/0405120
15. [CFG] A. Childs, E. Farhi, and S. Guttman. An Example of the difference between quantum and classical random walks. Quantum Information Processing, 1:35 2002. lanl report quant-ph/0103020
16. [FG] E. Farhi, S. Gutmann: Quantum computation and decision trees, Phys Rev. A58, (1998)
17. [G96] Lov K. Grover: A Fast Quantum Mechanical Algorithm for Database Search. STOC 1996: 212-219
18. [K] J. Kempe: "Discrete Quantum Walks Hit Exponentially Faster", Proceedings of 7th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM'03), p. 354-69 (2003), [ps], lanl-report quant-ph/0205083
19. [L] László Lovász, "Random Walks on Graphs: A Survey", Combinatorics, Paul Erdos is Eighty (Volume 2) Keszthely (Hungary), 1993, pp. 1-46.
20. [MSS] F. Magniez, M. Santha, and M. Szegedy: An O(n1.3) quantum algorithm for the triangle problem. Technical Report quant-ph/0310134, arXiv, 2003.
21. [Mey] D.A. Meyer, From quantum cellular automata to quantum lattice gases," J. Stat. Phys. 85, 551 (1996).
22. [NW] Ashwin Nayak and Ashvin Vishwanath "Quantum walk on the line", LANL preprint quant-ph/0010117 and DIMACS Technical Report 2000-43.
23. [SKW] N. Shenvi, J. Kempe, and KB Whaley: "Quantum Random-Walk Search Algorithm", Phys. Rev. A, Vol. 67 (5), 052307 (2003), lanl-report quant-ph/0210064.
24. [Seh] Uwe Schöning, A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems, 40th Annual Symposium on Foundations of Computer Science October 17 - 18, 1999
25. [Sh] Yaoyun Shi: "Quantum Lower Bounds for the Collision and the Element Distinctness Problems." FOCS 2002:513-519
26. [S] M. Szegedy: "Spectra of Quantized Walks and a √δ∈ rule", quant-ph/0401053
27. [W] J. Watrous: Quantum simulations of classical random walks and undirected graph connectivity. Journal of Computer and System Sciences, 62(2): 376-391, 2001. (A preliminary version appeared in Proceedings of the 14th Annual IEEE Conference on Computational Complexity, pages 180-187, 1999.)
28. [W] J. Watrous: Quantum simulations of classical random walks and undirected graph connectivity. Journal of Computer and System Sciences, 62(2): 376-391, 2001. (A preliminary version appeared in Proceedings of the 14th Annual IEEE Conference on Computational Complexity, pages 180-187, 1999.)