Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0405128 · Physical Review A

Quantum random walks do not need a coin toss

Apoorva Patel, K. S. Raghunathan, Pranaw Rungta

Published Mar 29, 2005• 67 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.71.032347

Related papers

Quantum Random Walks without a Coin Toss

Apoorva D. Patel, K. S. Raghunathan, Pranaw Rungta

We construct a quantum random walk algorithm, based on the Dirac operator instead of the Laplacian. The algorithm explores multiple evolutionary branches by superposition of states, and does not require the coin toss instruction of classical randomised algorithms. We use this algorithm to search for a marked vertex on a hypercubic lattice in arbitrary dimensions. Our numerical and analytical results match the scaling behaviour of earlier algorithms that use a coin toss instruction.

arXiv:quant-ph/0506221•Jun 27, 2005•1 citation

Unveiling two-dimensional discrete quantum walks dynamics via dispersion relations

Sergio Cantero‐Chinchilla, A. Romanelli, Eugenio Roldán +1 more

The discrete, or coined, quantum walk (QW) [1] is a process originally introduced as the quantum counterpart of the classical random walk (RW). In both cases there is a walker and a coin: at every time step the coin is tossed and the walker moves depending on the toss output. Unlike the RW, in the QW the walker and coin are quantum in nature what allows the coherent superpositions right/left and head/tail happen.

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•May 1, 2011•0 citations

Discrete time quantum walk model for single and entangled particles to retain entanglement in coin space

C. M. Chandrashekar

In most widely discussed discrete time quantum walk model, after every unitary shift operator, the particle evolves into the superposition of position space and settles down in one of its basis states, loosing entanglement in the coin space in the new position. The Hadamard operation is applied to let the particle to evolve into the superposition in the coin space and the walk is iterated. We present a model with a additional degree of freedom for the unitary shift operator $U^{\prime}$. The unitary operator with additional degree of freedom will evolve the quantum particle into superposition of position space retaining the entanglement in coin space. This eliminates the need for quantum coin toss (Hadamard operation) after every unitary displacement operation as used in most widely studied version of the discrete time quantum walk model. This construction is easily extended to a multiple particle quantum walk and in this article we extend it for a pair of particles in pure state entangled in coin degree of freedom by simultaneously subjecting it to a pair of unitary displacement operators which were constructed for single particle. We point out that unlike for single particle quantum walk, upon measurement of its position after $N$ steps, the entangled particles are found together with 1/2 probability and at different positions with 1/2 probability. This can act as an advantage in applications of the quantum walk. A special case is also treated using a complex physical system such as, inter species two-particle entangled Bose-Einstein condensate, as an example.

arXiv:quant-ph/0609113•Sep 15, 2006•4 citations

Quantum Walks with Entangled Coins and Walkers in Superposition

Salvador Elías Venegas-Andraca

We introduce a generalization of quantum walks with entangled coins consisting of a model of discrete quantum walks with coin pairs under various degrees of entanglement and walkers in quantum superposition as initial states. We introduce novel position probability distributions that may be used for algorithm development based on quantum-mechanical phenomena. Also, we numerically show that the skewness of position probability distribution produced by using coin initial state with various degrees of entanglement cannot be easily inferred.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2018•2 citations

Quantum Walk-based Generation of Entanglement Between Two Walkers

Salvador Elías Venegas-Andraca, Sougato Bose

Quantum walks can be used either as tools for quantum algorithm development or as entanglement generators, potentially useful to test quantum hardware. We present a novel algorithm based on a discrete Hadamard quantum walk on a line with one coin and two walkers whose purpose is to generate entanglement between walkers. We provide several classical computer simulations of our quantum algorithm in which we show that, although the asymptotical amount of entanglement generated between walkers does not reach the highest degree of entanglement possible at each step for either coin measurement outcome, the entanglement ratio (entanglement generated/highest value of entanglement possible, for each step) tends to converge, and the actual convergence value depends on the coin initial state and on the coin measurement outcome. Furthermore, our numerical simulations show that, for the quantum walks used in our algorithm, the value towards which entanglement ratio converges also depends on the position probability distribution symmetry of a quantum walk computed with one single walker and the same coin initial state employed in the corresponding quantum walk with two walkers.

arXiv:0901.3946•Jan 26, 2009•12 citations

Discrete quantum walks and quantum image processing

Salvador Elías Venegas-Andraca

In this thesis we have focused on two topics: Discrete Quantum Walks and Quantum Image Processing. Our work is a contribution within the field of quantum computation from the perspective of a computer scientist. With the purpose of finding new techniques to develop quantum algorithms, there has been an increasing interest in studying Quantum Walks, the quantum counterparts of classical random walks. Our work in quantum walks begins with a critical and comprehensive assessment of those elements of classical random walks and discrete quantum walks on undirected graphs relevant to algorithm development. We propose a model of discrete quantum walks on an infinite line using pairs of quantum coins under different degrees of entanglement, as well as quantum walkers in different initial state configurations, including superpositions of corresponding basis states. We have found that the probability distributions of such quantum walks have particular forms which are different from the probability distributions of classical random walks. Also, our numerical results show that the symmetry properties of quantum walks with entangled coins have a non-trivial relationship with corresponding initial states and evolution operators. In addition, we have studied the properties of the entanglement generated between walkers, in a family of discrete Hadamard quantum walks on an infinite line with one coin and two walkers. We have found that there is indeed a relation between the amount of entanglement available in each step of the quantum walk and the symmetry of the initial coin state. However, as we show with our numerical simulations, such a relation is not straightforward and, in fact, it can be counterintuitive. Quantum Image Processing is a blend of two fields: quantum computation and image processing. Our aim has been to promote cross-fertilisation and to explore how ideas from quantum computation could be used to develop image processing algorithms. Firstly, we propose methods for storing and retrieving images using non-entangled and entangled qubits. Secondly, we study a case in which 4 different values are randomly stored in a single qubit, and show that quantum mechanical properties can, in certain cases, allow better reproduction of original stored values compared with classical methods. Finally, we briefly note that entanglement may be used as a computational resource to perform hardware-based pattern recognition of geometrical shapes that would otherwise require classical hardware and software.

•Jan 1, 2005•19 citations
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.
In most widely discussed discrete time quantum walk model, after every unitary shift operator, the particle evolves into the superposition of position space and settles down in one of its basis states, loosing entanglement in the coin space in the new position. The Hadamard operation is applied to let the particle to evolve into the superposition in the coin space and the walk is iterated. We present a model with a additional degree of freedom for the unitary shift operator U′U^{\prime}U′. The unitary operator with additional degree of freedom will evolve the quantum particle into superposition of position space retaining the entanglement in coin space. This eliminates the need for quantum coin toss (Hadamard operation) after every unitary displacement operation as used in most widely studied version of the discrete time quantum walk model. This construction is easily extended to a multiple particle quantum walk and in this article we extend it for a pair of particles in pure state entangled in coin degree of freedom by simultaneously subjecting it to a pair of unitary displacement operators which were constructed for single particle. We point out that unlike for single particle quantum walk, upon measurement of its position after NNN steps, the entangled particles are found together with 1/2 probability and at different positions with 1/2 probability. This can act as an advantage in applications of the quantum walk. A special case is also treated using a complex physical system such as, inter species two-particle entangled Bose-Einstein condensate, as an example.
We introduce a generalization of quantum walks with entangled coins consisting of a model of discrete quantum walks with coin pairs under various degrees of entanglement and walkers in quantum superposition as initial states. We introduce novel position probability distributions that may be used for algorithm development based on quantum-mechanical phenomena. Also, we numerically show that the skewness of position probability distribution produced by using coin initial state with various degrees of entanglement cannot be easily inferred.
Quantum walks can be used either as tools for quantum algorithm development or as entanglement generators, potentially useful to test quantum hardware. We present a novel algorithm based on a discrete Hadamard quantum walk on a line with one coin and two walkers whose purpose is to generate entanglement between walkers. We provide several classical computer simulations of our quantum algorithm in which we show that, although the asymptotical amount of entanglement generated between walkers does not reach the highest degree of entanglement possible at each step for either coin measurement outcome, the entanglement ratio (entanglement generated/highest value of entanglement possible, for each step) tends to converge, and the actual convergence value depends on the coin initial state and on the coin measurement outcome. Furthermore, our numerical simulations show that, for the quantum walks used in our algorithm, the value towards which entanglement ratio converges also depends on the position probability distribution symmetry of a quantum walk computed with one single walker and the same coin initial state employed in the corresponding quantum walk with two walkers.
In this thesis we have focused on two topics: Discrete Quantum Walks and Quantum Image Processing. Our work is a contribution within the field of quantum computation from the perspective of a computer scientist. With the purpose of finding new techniques to develop quantum algorithms, there has been an increasing interest in studying Quantum Walks, the quantum counterparts of classical random walks. Our work in quantum walks begins with a critical and comprehensive assessment of those elements of classical random walks and discrete quantum walks on undirected graphs relevant to algorithm development. We propose a model of discrete quantum walks on an infinite line using pairs of quantum coins under different degrees of entanglement, as well as quantum walkers in different initial state configurations, including superpositions of corresponding basis states. We have found that the probability distributions of such quantum walks have particular forms which are different from the probability distributions of classical random walks. Also, our numerical results show that the symmetry properties of quantum walks with entangled coins have a non-trivial relationship with corresponding initial states and evolution operators. In addition, we have studied the properties of the entanglement generated between walkers, in a family of discrete Hadamard quantum walks on an infinite line with one coin and two walkers. We have found that there is indeed a relation between the amount of entanglement available in each step of the quantum walk and the symmetry of the initial coin state. However, as we show with our numerical simulations, such a relation is not straightforward and, in fact, it can be counterintuitive. Quantum Image Processing is a blend of two fields: quantum computation and image processing. Our aim has been to promote cross-fertilisation and to explore how ideas from quantum computation could be used to develop image processing algorithms. Firstly, we propose methods for storing and retrieving images using non-entangled and entangled qubits. Secondly, we study a case in which 4 different values are randomly stored in a single qubit, and show that quantum mechanical properties can, in certain cases, allow better reproduction of original stored values compared with classical methods. Finally, we briefly note that entanglement may be used as a computational resource to perform hardware-based pattern recognition of geometrical shapes that would otherwise require classical hardware and software.