A random walk approach to quantum algorithms

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences

Volumn 364, Issue 1849, 2006, Pages 3407-3422

  Kendon, Vivien M ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Quantum algorithms; Quantum computation; Quantum information

Indexed keywords

EID: 33845616399     PISSN: 1364503X     EISSN: None     Source Type: Journal    
DOI: 10.1098/rsta.2006.1901     Document Type: Article

References (53)

1. Aaronson, S. 2004 Multilinear formulas and skepticism of quantum computing. In STOC '04: Proc. Thirty-sixth Annual ACM Symp. Theory of computing, pp. 118-127. ACM Press: New York, NY.
2. Aaronson, S. & Gottesman, D. 2004 Improved simulation of stabilizer circuits. Phys. Rev. A 70, 052328. (doi:10.1103/PhysRevA.70.052328)
3. Aharanov, D., Ambainis, A., Kempe, J. & Vazirani, U. 2001 Quantum walks on graphs. In Proc. 33rd Annual ACM STOC, pp. 50-59. ACM: New York, NY.
4. Aharonov, D. & Ben-Or, M. 1996 Fault tolerant quantum computation with constant error. In Proc. 29th ACM STOC, pp. 176-188. ACM: New York, NY.
5. Ambainis, A. 2003 Quantum walks and their algorithmic applications. Int. J. Quantum Inf. 1, 507-518. (doi:10.1142/S0219749903000383)
6. Ambainis, A., Bach, E., Nayak, A., Vishwanath, A. & Watrous, J. 2001 One-dimensional quantum walks. In: Proc. 33rd Annual ACM STOC, pp. 60-69. ACM: New York, NY.
7. Blume-Kohout, R., Caves, C. M. & Deutsch, I. H. 2002 Climbing mount scalable: physical resource requirements for a scalable quantum computer. Found. Phys. 32, 1641. (doi:10.1023/A:1021471621587)
8. Bohr, N. 1928 The quantum postulate and the recent development of atomic theory. Nature 121, 580-591.
9. Das Quantenpostulat und die neuere Entwicklung der Atomistik, Naturwissenschaften, 16, 245-257.
10. Bohr, N. 1950 On the notions of causality and complementarity. Science 111, 51-54.
11. Reprinted from Dialectica 2, 312-319.
12. Bouwmeester, D., Marzoli, I., Karman, G. P., Schleich, W. & Woerdman, J. P. 1999 Optical Galton board. Phys. Rev. A 61, 013410. (doi:10.1103/ PhysRevA.61.013410)
13. Boyle, P. et al. 2003 Status of and performance estimates for QCDOC. In Proc. XXth Int. Symp. on Lattice Field Theory. Nuc. Phys. B Proc. Supp. 119, 1041-1043. (doi:10.1016/S0920-5632 (03)01756-0)
14. Brown, K. R., Clark, R. J. & Chuang, I. L. 2006 Limitations of quantum simulation examined by simulating a pairing hamiltonian using nuclear magnetic resonance. Phys. Rev. Lett. 97, 050504. (doi:10.1103/PhysRevLett.97. 050504)
15. Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S. & Spielman, D. A. 2003 Exponential algorithmic speedup by a quantum walk. In Proc. 35th Annual ACM STOC, pp. 59-68. ACM: New York, NY.
16. Deutsch, D. 1985 Quantum-theory, the church-turing principle and the universal quantum computer. Proc. R. Soc. A 400, 97-117.
17. Dür, W., Raussendorf, R., Kendon, V. M. & Briegel, H.-J. 2002 Quantum random walks in optical lattices. Phys. Rev. A 66, 052319. (doi:10.1103/PhysRevA.66.052319)
18. Dyer, M., Frieze, A. & Kannan, R. 1991 A random polynomial-time algorithm for approximating the volume of convex bodies. J. ACM 38, 1-17. (doi:10.1145/102782.102783)
19. Farhi, E. & Gutmann, S. 1998 Quantum computation and decision trees. Phys. Rev. A 58, 915-928. (doi:10.1103/PhysRevA.58.915)
20. Feynman, R. P. 1982 Simulating physics with computers. Int. J. Theor. Phys. 21, 467.
21. Frisch, U., d'Humières, D., Hasslacher, B., Lallemand, P., Pomeau, Y. & Rivet, J.-P. 1987 Lattice gas hydrodynamics in two and three dimensions. Complex Syst. 1, 649-707.
22. Grover, L. K. 1996 A fast quantum mechanical algorithm for database search. In Proc. 28th Annual ACM STOC, p. 212. ACM: New York, NY.
23. Hardy, J., Pomeau, Y. & de Pazzis, O. 1973 Time evolution of a two-dimensional model system. I. Invariant states and time correlation functions. J. Math. Phys. 14, 1746. (doi:10.1063/1.1666248)
24. Jerrum, M., Sinclair, A. & Vigoda, E. 2001 A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. In: Proc. 33rd Annual ACM STOC, pp. 712-721. ACM: New York, NY.
25. Jozsa, R. 1998 Entanglement and quantum computation. In The geometric Universe, geometry, and the work of rogerp penrose (ed. S. A. Huggett, L. J. Mason, K. P. Tod, S. Tsou & N. M. J. Woodhouse), pp. 369-379. Oxford, UK: Oxford University Press.
26. Jozsa, R. 2006 An introduction to measurement based quantum computation. In NATO Science Series, III: Computer and systems sciences, vol. 199, pp. 137-158. Washington, DC: IOS Press.
27. Keating, J. P., Linden, N., Matthews, J. C. F. & Winter, A. 2006 Localization and its consequences for quantum walk algorithms and quantum communication. ArXiv: quant-ph/0606205.
28. Kendon, V. M. & Sanders, B. C. 2004 Complementarity and quantum walks. Phys. Rev. A 71, 022307. (doi:10.1103/PhysRevA.71.022307)
29. Kendon, V. & Tregenna, B. 2003 Decoherence can be useful in quantum walks. Phys. Rev. A 67, 042315. (doi:10.1103/PhysRevA.67.042315)
30. Knight, P. L., Roldán, E. & Sipe, J. E. 2003 Quantum walk on the line as an interference phenomenon. Phys. Rev. A 68, 020301(R). (doi:10.1103/PhysRevA.68.020301)
31. Knill, E., Laflamme, R. & Zurek, W. 1996 Threshold accuracy for quantum computation. ArXiv: quant-ph/9610011.
32. Krovi, H. & Brun, T. A. In press. Quantum walks with infinite hitting times. Phys. Rev. A.
33. Lloyd, S. 1996 Universal quantum simulators. Science 273, 1073-1078.
34. Lomont, C. 2004 The hidden subgroup problem - review and open problems. ArXiv: quant-ph/0411037.
35. Meyer, D. A. 1996 On the absense of homogeneous scalar unitary cellular automata. Phys. Lett. A 223, 337-340. (doi:10.1016/S0375-9601(96)00745-1)
36. Moore, C. & Russell, A. 2002 Quantum walks on the hypercube. In Proc. 6th Intl. Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM '02) (eds. J. D. P. Rolim & S. Vadhan), pp. 164-178. Berlin, Germany: Springer.
37. Motwani, R. & Raghavan, P. 1995 Randomized algorithms. Cambridge, UK: Cambridge University Press.
38. Nielsen, M. A. & Chuang, I. J. 2000 Quantum computation and quantum information. Cambridge, UK: Cambridge University Press.
39. Raussendorf, R. & Briegel, H. J. 2001 A one-way quantum computer. Phys. Rev. Lett. 86, 5188-5191. (doi:10.1103/PhysRevLett.86.5188)
40. Richter, P. 2006 Almost uniform sampling in quantum walks. ArXiv: quant-ph/0606202.
41. Rubel, L. A. 1981 A universal differential equation. Bull. Am. Math. Soc. 4, 345-349.
42. Rubel, L. A. 1989 Digital simulation of analogue computation and Church's thesis. J. Sym. Logic 54, 1011-1017. (doi:10.2307/2274761)
43. Rubel, L. A. 1993 The extended analog computer. Adv. Appl. Math. 14, 39-50. (doi:10.1006/aama.1993.1003)
44. Schöning, U. 1999 A probabilistic algorithm for k-SAT and constraint satisfaction problems. In 40th Annual Symposium on FOCS, pp. 17-19. Los Alamitos, CA: IEEE.
45. Shannon, C. 1941 Mathematical theory of the differential analyzer. J. Math. Phys. Mass. Inst. Tech. 20, 337-354.
46. Shenvi, N., Kempe, J. & Birgitta Whaley, K. 2003 A quantum random walk search algorithm. Phys. Rev. A 67, 052307. (doi:10.1103/PhysRevA.67.052307)
47. Shor, P. W. 1997 Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Sci. Statist. Comput. 26, 1484.
48. Somaroo, S. S., Tseng, C. H., Havel, T. F., Laflamme, R. & Cory, D. G. 1999 Quantum simulations on a quantum computer. Phys. Rev. Lett. 82, 5381-5384. (doi:10.1103/PhysRevLett.82.5381)
49. Spiller, T. P., Munro, W. J., Barrett, S. D. & Kok, P. 2005 An introduction to quantum information processing: applications and realisations. Contemp. Phys. 46, 407. (doi:10.1080/00107510500293261)
50. Steane, A. 1996 Multiple particle interference and quantum error correction. Proc. R. Soc. A 452, 2551.
51. Szegedy, M. 2004 Quantum speed-up of Markov chain based algorithms. In 45th Annual IEEE Symposium on Foundations of Computer Science, OCT 17-19, 2004, pp. 32-41. Los Alamitos, CA: IEEE Computer Society Press.
52. Tregenna, B., Flanagan, W., Maile, R. & Kendon, V. 2003 Controlling discrete quantum walks: coins and initial states. New J. Phys. 5, 83. (doi:10.1088/1367-2630/5/1/383)
53. Wootters, W. K. & Zurek, W. H. 1979 Complementarity in the double-slit experiment: quantum nonseparability and a quantitative statement of Bohr's principle. Phys. Rev. D 19, 473-484. (doi:10.1103/PhysRevD.19.473)