Quantum random walks do not need a coin toss

Physical Review A - Atomic, Molecular, and Optical Physics

Volumn 71, Issue 3, 2005, Pages

  Patel, Apoorva ^a   Raghunathan, K S ^a   Rungta, Pranaw ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ANSATZ; COIN TOSS INSTRUCTION; QUANTUM RANDOM WALKS; QUANTUM TURING MACHINE;

ALGORITHMS; HAMILTONIANS; MARKOV PROCESSES; MATRIX ALGEBRA; MONTE CARLO METHODS; PROBABILITY DISTRIBUTIONS;

QUANTUM THEORY;

EID: 18444379319     PISSN: 10502947     EISSN: 10941622     Source Type: Journal    
DOI: 10.1103/PhysRevA.71.032347     Document Type: Article

References (15)

1. R. Motwani and P. Raghavan, Randomized Algorithms (Cambridge University Press, Cambridge, U.K., 1995).
2. E. Farhi and S. Gutmann, Phys. Rev. A 58, 915 (1998).
3. J. Kempe, Contemp. Phys. 44, 307 (2003).
4. A. Ambainis, Int. J. Quantum Inf. 1, 507 (2003).
5. We deliberately use the label "ultralocal" here, because "local" physical interactions (especially when described in ' the renormalization-group framework) include all those that fall off exponentially or faster with distance.
6. L. Susskind, Phys. Rev. D 16, 3031 (1977).
7. J. L. Richardson, Comput. Phys. Commun. 63, 84 (1991).
8. D. A. Meyer, J. Stat. Phys. 85, 551 (1996).
9. K. Wilson, in New Phenomena in Subnuclear Physics, edited by A. Zichichi (Plenum Press, New York, 1977).
10. A. Ambainis, J. Kempe, and A. Rivosh, e-print quant-ph/ 0402107, Proceedings of the 16th ACM-SIAM SODA (in press).
11. A. M. Childs and J. Goldstone, Phys. Rev. A 70, 042312 (2004).
12. A. Patel, K. S. Raghunathan, and P. Rungta (unpublished).
13. A. Nayak and A. Vishwanath, e-print quant-ph/0010117.
14. A. Ambainis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous, Proceedings of STOC'01 (ACM, New York, 2001), p. 37.
15. Entanglement is always defined with respect to a specific division of the whole system into its parts. If the division scheme is altered, entanglement can change.