Quantum random walks do not need a coin toss

Journal Article · Tue Mar 01 04:00:00 EST 2005 · Physical Review. A

DOI:https://doi.org/10.1103/PhysRevA.71.032347· OSTI ID:20650385

Patel, Apoorva; Raghunathan, K S; Rungta, Pranaw ^[1]

---

1. Centre for High Energy Physics, Indian Institute of Science, Bangalore-560012 (India)

Classical randomized algorithms use a coin toss instruction to explore different evolutionary branches of a problem. Quantum algorithms, on the other hand, can explore multiple evolutionary branches by mere superposition of states. Discrete quantum random walks, studied in the literature, have nonetheless used both superposition and a quantum coin toss instruction. This is not necessary, and a discrete quantum random walk without a quantum coin toss instruction is defined and analyzed here. Our construction eliminates quantum entanglement between the coin and the position degrees of freedom from the algorithm, and the results match those obtained with a quantum coin toss instruction.

• OSTI ID: 20650385
• Journal Information: Physical Review. A, Journal Name: Physical Review. A Journal Issue: 3 Vol. 71; ISSN 1050-2947; ISSN PLRAAN
• Country of Publication: United States
• Language: English

Related Subjects

74 ATOMIC AND MOLECULAR PHYSICS
ALGORITHMS
CORRELATIONS
DEGREES OF FREEDOM
ENERGY LEVELS
INFORMATION THEORY
QUANTUM MECHANICS
QUANTUM NUMBERS
RANDOMNESS