Quantum walks on the hypercube

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2483, Issue , 2002, Pages 164-178

  Moore, Cristopher ^a,b   Russell, Alexander ^c  

^a University of New Mexico   (United States)

^b SANTA FE INSTITUTE   (Mexico)

^c University of Connecticut   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; MIXING; ONE DIMENSIONAL; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

CLASSICAL COUNTERPART; CLASSICAL WALKS; CONTINUOUS-TIME; DISCRETE TIME; DISCRETE-TIME CASE; INSTANTANEOUS MIXING; N-DIMENSIONAL HYPERCUBE; QUANTUM MONTE CARLO;

CONTINUOUS TIME SYSTEMS;

EID: 84959058975     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45726-7_14     Document Type: Conference Paper

References (26)

1. Dorit Aharonov, Andris Ambainis, Julia Kempe, and Umesh Vazirani. Quantum walks on graphs. In ACM [ACM01].
2. Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, and John Watrous. One-dimensional quantum walks. In ACM [ACM01].
3. Proc. 33rd Annual ACM Symposium on Theory of Computing (STOC) 2001.
4. Noga Alon and Joel H. Spencer. The Probabilistic Method. Wiley & Sons, 1992.
5. Norman Bleistein and Richard Handelsman. Asymptotic expansions of integrals. Holt, Rinehart and Winston, 1975.
6. Andrew Childs, Edward Farhi, and Sam Gutmann. An example of the difference between quantum and classical random walks. Preprint, quant-ph/0103020.
7. Martin Dyer, Alan Frieze, and Ravi Kannan. A random polynomial-time algorithm for approximating the volume of convex bodies. Journal of the ACM, 38 (1): 1-17, January 1991.
8. Persi Diaconis. Group Representations in Probability and Statistics. Lecture notes-Monograph series. Institute of Mathematical Statistics, 1988.
9. Persi Diaconis and Mehrdad Shahshahani. Generating a random permutation with random transpositions. Z. Wahrscheinlichkeitstheorie Verw. Gebiete, 57: 159-179, 1981.
10. Edward Farhi and Sam Gutmann. Quantum computation and decision trees. Phys. Rev. A, 58: 915-, 1998.
11. Ofer Gabber and Zvi Galil. Explicit constructions of linear-sized superconcentrators. Journal of Computer and System Sciences, 22 (3): 407-420, June 1981.
12. Lov K. Grover. A fast quantum mechanical algorithm for database search. Proc. 28th Annual ACM Symposium on the Theory of Computing (STOC) 1996.
13. Mark Jerrum and Alistair Sinclair. Approximating the permanent. SIAM Journal on Computing, 18 (6): 1149-1178, December 1989.
14. Mark Jerrum, Alistair Sinclair, and Eric Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. Technical Report TR00-079, Electronic Colloquium on Computational Complexity, 2000.
15. László Lovász and Ravi Kannan. Faster mixing via average conductance. Proc. 31st Annual ACM Symposium on Theory of Computing (STOC) 1999.
16. Alexander Lubotzky. Discrete Groups, Expanding Graphs, and Invariant Measures, volume 125 of Progress in Mathematics. Birkhäuser Verlag, 1994.
17. Cristopher Moore and Alexander Russell. Quantum Walks on the Hypercube. Preprint, quant-ph/0104137.
18. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
19. Noam Nisan. Pseudorandom generators for space-bounded computation. Proc. 22nd Annual ACM Symposium on Theory of Computing (STOC) 1990.
20. Joseph Naor and Moni Naor. Small-bias probability spaces: Effcient constructions and applications. SIAM Journal on Computing, 22 (4): 838-856, August 1993.
21. Ashwin Nayak and Ashvin Vishawanath. Quantum walk on the line. Los Alamos preprint archive, quant-ph/0010117, 2000.
22. Rene Peralta. On the distribution of quadratic residues and nonresidues modulo a prime number. Mathematics of Computation, 58 (197): 433-440, 1992.
23. Uwe Schöning. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In 40th Annual Symposium on Foundations of Computer Science, pages 17-19. IEEE, 1999.
24. Peter W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26 (5): 1484-1509, October 1997.
25. Umesh Vazirani. Rapidly mixing markov chains. In Béla Bollobás, editor, Probabilistic Combinatorics and Its Applications, volume 44 of Proceedings of Symposia in Applied Mathematics. American Mathematical Society, 1992.
26. John Watrous. Quantum simulations of classical random walks and undirected graph connectivity. Journal of Computer and System Sciences, 62: 376-391, 2001.