Almost uniform sampling via quantum walks

New Journal of Physics

Volumn 9, Issue , 2007, Pages

  Richter, Peter C ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MARKOV PROCESSES; RANDOM PROCESSES; STATE SPACE METHODS;

CONSTANT DEGREE GRAPH; QUANTUM WALK ALGORITHM; QUANTUM WALKS; VARIATION DISTANCE;

QUANTUM THEORY;

EID: 33947591866     PISSN: 13672630     EISSN: None     Source Type: Journal    
DOI: 10.1088/1367-2630/9/3/072     Document Type: Article

References (39)

1. Simon D 1994 On the power of quantum computation Proc. Found. Comput. Sci. (FOCS)
2. Shor P 1994 Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer Proc. Found. Comput. Sci. (FOCS) (Preprint quant-ph/9508027)
3. Kitaev A Yu 1998 Quantum measurements and the Abelian stabilizer problem Preprint quant-ph/9511.026
4. Hallgren S 2002 Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem Proc. Symp. on the Theory of Computing (STOC)
5. Grover L K 1996 A fast quantum mechanical algorithm for database search Proc. Symp. on the Theory of Computing (STOC) (Preprint quant-ph/9605043)
6. Kempe J 2003 Quantum random walks - an introductory overview Contemp. Phys. 44 307-27 (Preprint quant-ph/0303081)
7. Ambainis A 2003 Quantum walks and their algorithmic applications Int. J. Quantum Inform. 1 507-18 (Preprint quant-ph/0403120)
8. Meyer D 1996 From quantum cellular automata to quantum lattice gases J. Stat. Phys. 85 551-74 (Preprint quant-ph/9604003)
9. Watrous J 2001 Quantum simulations of classical random walks and undirected graph connectivity J. Comput. Sys. Sci. 62 376-91 (Preprint cs.CC/9812012)
10. Nayak A and Vishwanath A Quantum walk on the line Preprint quant-ph/0010117
11. Ambainis A, Bach E, Nayak A, Vishwanath A and Watrous J 2001 One-dimensional quantum walks Proc. Symp. on the Theory of Computing (STOC)
12. Aharonov D, Ambainis A, Kempe J and Vazirani U 2001 Quantum walks on graphs Proc. Symp. on the Theory of Computing (STOC) (Preprint quant-ph/0012090)
13. Ambainis A 2004 Quantum walk algorithm for element distinctness Proc. Foundations of Computer Science (FOCS) (Preprint quant-ph/0311001)
14. Buhrman H and Spalek R 2006 Quantum verification of matrix products Proc. Symp. on Discrete Algorithms (SODA) (Preprint quant-ph/0409035)
15. Magniez F, Santha M and Szegedy M 2005 Quantum algorithms for the triangle problem Proc. Symp. on Discrete Algorithms (SODA) (Preprint quant-ph/031.0134)
16. Childs A M and Eisenberg J M 2005 Quantum algorithms for subset finding Quantum Inform. Comput. 5 593 (Preprint quant-ph/0311038)
17. Magniez F and Nayak A 2005 Quantum complexity of testing group commutativity Proc. Int. Conf. on Automata, Languages, and Programming (ICALP) (Preprint quant-ph/0506265)
18. Farhi E and Gutmann S 1998 Quantum computation and decision trees Phys. Rev. A 58 915-23 (Preprint quant-ph/9706062)
19. Childs A M, Farhi E and Gutmann S 2002 An example of the difference between quantum and classical random walks Quantum Inform. Process. 1 35 (Preprint quant-ph/0103020)
20. Childs A M, Cleve R, Deotto E, Farhi E, Gutmann S and Spielman D A 2003 Exponential algorithmic speedup by quantum walk Proc. Symp. on the Theory of Computing (STOC) (Preprint quant-ph/0209131)
21. Kempe J 2003 Discrete quantum walks hit exponentially faster Proc. Int. Workshop on Randomization and Computation (RANDOM) (Preprint quant-ph/0205083)
22. Shenvi N, Kempe J and Whaley K B 2003 A quantum random walk search algorithm Phys. Rev. A 67 052307 (Preprint quant-ph/0210064)
23. Ambainis A, Kempe J and Rivosh A 2005 Coins make quantum walks faster Proc. Symp. on Discrete Algorithms (SODA) (Preprint quant-ph/0402107)
24. Childs A M and Goldstone J 2004 Spatial search by quantum walk Phys. Rev. A 70 022314 (Preprint quant-ph/0306054)
25. Childs A M and Goldstone J 2004 Spatial search and the Dirac equation Phys. Rev. A 70 042312 (Preprint quant-ph/0405120)
26. Childs A M 2004 Quantum information processing in continuous time PhD Thesis Massachusetts Institute of Technology
27. Szegedy M 2004 Quantum speed-up of Markov chain based algorithms Proc. Found. Comput. Sci. (FOCS) (Preprint quant-ph/0401053)
28. Jerrum M 2003 Counting, Sampling and Integrating: Algorithms and Complexity (Lectures in Mathematics) (Zurich: Birkhauser)
29. Kendon V and Tregenna B 2003 Decoherence can be useful in quantum walks Phys. Rev. A 67 042315 (Preprint quant-ph/0209005)
30. Kendon V 2006 Decoherence in quantum walks - a review Preprint quant-ph/0606016
31. Richter P Quantum speedup of classical mixing processes Preprint quant-ph/0609204
32. Kendon V and Maloyer O 2006 Optimal computation with non-unitary quantum walks Preprint quant-ph/0610240
33. Diaconis P and Strook D 1991 Geometric bounds for eigenvalues of Markov chains Ann. Appl. Probab. 1 36-61
34. Aldous D 1982 Some inequalities for reversible Markov chains J. Lond. Math. Soc. (2) 25 564-76
35. Jerrum M, Sinclair A and Vigoda E 2004 A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries J. Assoc. Comput. Mach. 51 671-97
36. Aldous D and Fill J Reversible Markov Chains and Random Walks on Graphs, in preparation
37. Gerhardt H and Watrous J 2003 Continuous-time quantum walks on the symmetric group Proc. Int. Workshop on Randomization and Computation (RANDOM) (Preprint quant-ph/0305182)
38. Moore C and Russell A 2002 Quantum walks on the hypercube Proc. Int. Workshop on Randomization and Computation (RANDOM) (Preprint quant-ph/0104137)
39. Conway J H and Jones A J 1976 Trigonometric diophantine equations (on vanishing sums of roots of unity) Acta Arithmetica 30 229-40 (3)