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:2206.03642

Implementing quantum walks with a single qubit

Qi-Ping Su, Shi-Chao Wang, Yan Chi, Yong-Nan Sun, Yu Li, Zhe Sun, Franco Nori, Chui‐Ping Yang

Published Jun 8, 2022• 1 citation
arXivHTMLPDF

Abstract

Quantum walks have wide applications in quantum information, such as universal quantum computation, so it is important to explore properties of quantum walks thoroughly. We propose a novel method to implement discrete-time quantum walks (DTQWs) using only a single qubit, in which both coin and walker are encoded in the two-dimensional state space of a single qubit, operations are realized using single-qubit gates only, and high-dimensional final states of DTQWs can be obtained naturally. With this "one-qubit" approach, DTQW experiments can be realized much more easily, compared with previous methods, in most quantum systems and all properties based on quantum states of DTQWs (such as quantum correlation and coherence) can be investigated. By this approach, we experimentally implement one-particle and two-particle DTQWs with seven steps using single photons. Furthermore, we systematically investigate quantum correlations and coherence (based on the full state of the coin and walker) of the DTQW systems with different initial states of the coin, which have not been obtained and studied in DTQW experiments. As an application, we also study the assisted distillation of quantum coherence using the full state of the two-particle DTQW from the experiment. The maximal increase in distillable coherence for high-dimensional mixed states is investigated for the first time by obtaining its upper and lower bounds. Our work opens a new door to implement DTQW experiments and to better explore properties of quantum walks.

DOI
10.48550/arxiv.2206.03642

Related papers

Experimental demonstration of quantum walks with initial superposition states

Qi-Ping Su, Yu Zhang, Li Yu +9 more

Abstract The preparation of initial superposition states of discrete-time quantum walks (DTQWs) is necessary for the study and applications of DTQWs. Based on an encoding method, here, we propose a DTQW protocol in linear optics, which enables the preparation of arbitrary initial superposition states of the walker and the coin and enables to obtain the states of the DTQW in addition to the probability distribution of the walker. With this protocol, we experimentally demonstrate the DTQW in the polarization space with both the walker and the coin initially in superposition states, by using only passive linear-optical elements. The effects of the walker’s different initial superposition states on the spread speed of the DTQW and on the entanglement between the coin and the walker are also experimentally investigated, which have not been reported before. When the walker starts with superposition states, we show that the properties of DTQWs are very different from those of DTQWs starting with a single position. Our findings reveal different properties of DTQWs and pave an avenue to study DTQWs with arbitrary initial states. Moreover, this encoding method enables one to encode an arbitrary high-dimensional quantum state, using a single physical qubit, and may be adopted to implement other quantum information tasks.

arXiv:1805.09784•npj Quantum Information•May 17, 2019•34 citations

Quantum magic in discrete-time quantum walk

Vikash Mittal, Yi-Ping Huang

Quantum magic, which accounts for the nonstabilizer content of a state, is essential for universal quantum computation beyond classically simulable resources. However, the way magic builds up during structured unitary dynamics remains largely open. Here, we investigate the generation and evolution of quantum magic in discrete-time quantum walks (DTQWs)—a simple, tunable unitary model realizable on a wide range of architectures. We use stabilizer Rényi entropy as a measure of quantum magic and investigate single- and two-walker quantum walks on a one-dimensional lattice, considering a wide range of initial coin states. Our results reveal that DTQWs can dynamically generate significant magic, with the amount and structure dependent on the initial state of the coin. In the case of a single walker, we found a nontrivial and complementary relationship between magic and entanglement at long times. In the two-walker setting, even states close to stabilizer form can evolve into highly magical states when subjected to quantum walk protocols. The generation of magic can occur independently of entanglement growth, emphasizing its distinct role as a quantum resource. We further show that the dynamical magic generation is robust under realistic noise—specifically, decoherence in the coin degree of freedom—demonstrating that this process persists across noisy settings. Finally, we discuss an experimentally feasible scheme to measure magic using current technology. Our findings position DTQWs as accessible and controllable platforms for producing quantum magic, offering a fresh perspective on their role in quantum information processing and reliable quantum computation.

arXiv:2506.17783•Physical Review Research•Jan 5, 2026•3 citations

Efficient Implementation of Discrete-Time Quantum Walks on Quantum Computers

Luca Razzoli, Gabriele Cenedese, Maria Bondani +1 more

Quantum walks have proven to be a universal model for quantum computation and to provide speed-up in certain quantum algorithms. The discrete-time quantum walk (DTQW) model, among others, is one of the most suitable candidates for circuit implementation due to its discrete nature. Current implementations, however, are usually characterized by quantum circuits of large size and depth, which leads to a higher computational cost and severely limits the number of time steps that can be reliably implemented on current quantum computers. In this work, we propose an efficient and scalable quantum circuit implementing the DTQW on the 2n-cycle based on the diagonalization of the conditional shift operator. For t time steps of the DTQW, the proposed circuit requires only O(n2+nt) two-qubit gates compared to the O(n2t) of the current most efficient implementation based on quantum Fourier transforms. We test the proposed circuit on an IBM quantum device for a Hadamard DTQW on the 4-cycle and 8-cycle characterized by periodic dynamics and by recurrent generation of maximally entangled single-particle states. Experimental results are meaningful well beyond the regime of few time steps, paving the way for reliable implementation and use on quantum computers.

arXiv:2402.01854•Entropy•Apr 2, 2024•16 citations

Quantum circuits for the realization of equivalent forms of one-dimensional discrete-time quantum walks on near-term quantum hardware

Shivani Singh, C. Huerta Alderete, Radhakrishnan Balu +3 more

Quantum walks are a promising framework for developing quantum algorithms and quantum simulations. They represent an important test case for the application of quantum computers. Here we present different forms of discrete-time quantum walks (DTQWs) and show their equivalence for physical realizations. Using an appropriate digital mapping of the position space on which a walker evolves to the multiqubit states of a quantum processor, we present different configurations of quantum circuits for the implementation of DTQWs in one-dimensional position space. We provide example circuits for a five-qubit processor and address scalability to higher dimensions as well as larger quantum processors.

arXiv:2001.11197•Physical Review A•Dec 1, 2021•13 citations

A simulator for discrete quantum walks on lattices

João Rodrigues, Nikola Paunković, Paulo Mateus

In this paper, we present a simulator for two-particle quantum walks on the line and one-particle on a two-dimensional squared lattice. It can be used to investigate the equivalence between the two cases (one- and two-particle walks) for various boundary conditions (open, circular, reflecting, absorbing and their combinations). For the case of a single walker on a two-dimensional lattice, the simulator can also implement the Möbius strip. Furthermore, other topologies for the walker are also simulated by the proposed tool, like certain types of planar graphs with degree up to 4, by considering missing links over the lattice. The main purpose of the simulator is to study the genuinely quantum effects on the global properties of the two-particle joint probability distribution on the entanglement between the walkers/axis. For that purpose, the simulator is designed to compute various quantities such as: the entanglement and classical correlations, (classical and quantum) mutual information, the average distance between the two walkers, different hitting times and quantum discord. These quantities are of vital importance in designing possible algorithmic applications of quantum walks, namely in search, 3-SAT problems, etc. The simulator can also implement the static partial measurements of particle(s) positions and dynamic breaking of the links between certain nodes, both of which can be used to investigate the effects of decoherence on the walker(s). Finally, the simulator can be used to investigate the dynamic Anderson-like particle localization by varying the coin operators of certain nodes on the line/lattice. We also present some illustrative and relevant examples of one- and two-particle quantum walks in various scenarios. The tool was implemented in C and is available on-line at http://qwsim.weebly.com/ .

International Journal of Modern Physics C•Mar 2, 2017•3 citations

Universal one-dimensional discrete-time quantum walks and their implementation on near term quantum hardware

Shivani Singh, C. Huerta Alderete, Radhakrishnan Balu +3 more

Quantum walks are a promising framework for developing quantum algorithms and quantum simulations. Quantum walks represent an important test case for the application of quantum computers. Here we present different forms of discrete-time quantum walks and show their equivalence for physical realizations. Using an appropriate digital mapping of the position space on which a walker evolves onto the multi-qubit states in a quantum processor, we present different configurations of quantum circuits for the implementation of discrete-time quantum walks in one-dimensional position space. With example circuits for a five qubit machine we address scalability to higher dimensions and larger quantum processors.

•Jan 30, 2020•2 citations
Quantum walks have wide applications in quantum information, such as universal quantum computation, so it is important to explore properties of quantum walks thoroughly. We propose a novel method to implement discrete-time quantum walks (DTQWs) using only a single qubit, in which both coin and walker are encoded in the two-dimensional state space of a single qubit, operations are realized using single-qubit gates only, and high-dimensional final states of DTQWs can be obtained naturally. With this "one-qubit" approach, DTQW experiments can be realized much more easily, compared with previous methods, in most quantum systems and all properties based on quantum states of DTQWs (such as quantum correlation and coherence) can be investigated. By this approach, we experimentally implement one-particle and two-particle DTQWs with seven steps using single photons. Furthermore, we systematically investigate quantum correlations and coherence (based on the full state of the coin and walker) of the DTQW systems with different initial states of the coin, which have not been obtained and studied in DTQW experiments. As an application, we also study the assisted distillation of quantum coherence using the full state of the two-particle DTQW from the experiment. The maximal increase in distillable coherence for high-dimensional mixed states is investigated for the first time by obtaining its upper and lower bounds. Our work opens a new door to implement DTQW experiments and to better explore properties of quantum walks.
Abstract The preparation of initial superposition states of discrete-time quantum walks (DTQWs) is necessary for the study and applications of DTQWs. Based on an encoding method, here, we propose a DTQW protocol in linear optics, which enables the preparation of arbitrary initial superposition states of the walker and the coin and enables to obtain the states of the DTQW in addition to the probability distribution of the walker. With this protocol, we experimentally demonstrate the DTQW in the polarization space with both the walker and the coin initially in superposition states, by using only passive linear-optical elements. The effects of the walker’s different initial superposition states on the spread speed of the DTQW and on the entanglement between the coin and the walker are also experimentally investigated, which have not been reported before. When the walker starts with superposition states, we show that the properties of DTQWs are very different from those of DTQWs starting with a single position. Our findings reveal different properties of DTQWs and pave an avenue to study DTQWs with arbitrary initial states. Moreover, this encoding method enables one to encode an arbitrary high-dimensional quantum state, using a single physical qubit, and may be adopted to implement other quantum information tasks.
Quantum magic, which accounts for the nonstabilizer content of a state, is essential for universal quantum computation beyond classically simulable resources. However, the way magic builds up during structured unitary dynamics remains largely open. Here, we investigate the generation and evolution of quantum magic in discrete-time quantum walks (DTQWs)—a simple, tunable unitary model realizable on a wide range of architectures. We use stabilizer Rényi entropy as a measure of quantum magic and investigate single- and two-walker quantum walks on a one-dimensional lattice, considering a wide range of initial coin states. Our results reveal that DTQWs can dynamically generate significant magic, with the amount and structure dependent on the initial state of the coin. In the case of a single walker, we found a nontrivial and complementary relationship between magic and entanglement at long times. In the two-walker setting, even states close to stabilizer form can evolve into highly magical states when subjected to quantum walk protocols. The generation of magic can occur independently of entanglement growth, emphasizing its distinct role as a quantum resource. We further show that the dynamical magic generation is robust under realistic noise—specifically, decoherence in the coin degree of freedom—demonstrating that this process persists across noisy settings. Finally, we discuss an experimentally feasible scheme to measure magic using current technology. Our findings position DTQWs as accessible and controllable platforms for producing quantum magic, offering a fresh perspective on their role in quantum information processing and reliable quantum computation.
Quantum walks have proven to be a universal model for quantum computation and to provide speed-up in certain quantum algorithms. The discrete-time quantum walk (DTQW) model, among others, is one of the most suitable candidates for circuit implementation due to its discrete nature. Current implementations, however, are usually characterized by quantum circuits of large size and depth, which leads to a higher computational cost and severely limits the number of time steps that can be reliably implemented on current quantum computers. In this work, we propose an efficient and scalable quantum circuit implementing the DTQW on the 2n-cycle based on the diagonalization of the conditional shift operator. For t time steps of the DTQW, the proposed circuit requires only O(n2+nt) two-qubit gates compared to the O(n2t) of the current most efficient implementation based on quantum Fourier transforms. We test the proposed circuit on an IBM quantum device for a Hadamard DTQW on the 4-cycle and 8-cycle characterized by periodic dynamics and by recurrent generation of maximally entangled single-particle states. Experimental results are meaningful well beyond the regime of few time steps, paving the way for reliable implementation and use on quantum computers.
Quantum walks are a promising framework for developing quantum algorithms and quantum simulations. They represent an important test case for the application of quantum computers. Here we present different forms of discrete-time quantum walks (DTQWs) and show their equivalence for physical realizations. Using an appropriate digital mapping of the position space on which a walker evolves to the multiqubit states of a quantum processor, we present different configurations of quantum circuits for the implementation of DTQWs in one-dimensional position space. We provide example circuits for a five-qubit processor and address scalability to higher dimensions as well as larger quantum processors.
In this paper, we present a simulator for two-particle quantum walks on the line and one-particle on a two-dimensional squared lattice. It can be used to investigate the equivalence between the two cases (one- and two-particle walks) for various boundary conditions (open, circular, reflecting, absorbing and their combinations). For the case of a single walker on a two-dimensional lattice, the simulator can also implement the Möbius strip. Furthermore, other topologies for the walker are also simulated by the proposed tool, like certain types of planar graphs with degree up to 4, by considering missing links over the lattice. The main purpose of the simulator is to study the genuinely quantum effects on the global properties of the two-particle joint probability distribution on the entanglement between the walkers/axis. For that purpose, the simulator is designed to compute various quantities such as: the entanglement and classical correlations, (classical and quantum) mutual information, the average distance between the two walkers, different hitting times and quantum discord. These quantities are of vital importance in designing possible algorithmic applications of quantum walks, namely in search, 3-SAT problems, etc. The simulator can also implement the static partial measurements of particle(s) positions and dynamic breaking of the links between certain nodes, both of which can be used to investigate the effects of decoherence on the walker(s). Finally, the simulator can be used to investigate the dynamic Anderson-like particle localization by varying the coin operators of certain nodes on the line/lattice. We also present some illustrative and relevant examples of one- and two-particle quantum walks in various scenarios. The tool was implemented in C and is available on-line at http://qwsim.weebly.com/ .
Quantum walks are a promising framework for developing quantum algorithms and quantum simulations. Quantum walks represent an important test case for the application of quantum computers. Here we present different forms of discrete-time quantum walks and show their equivalence for physical realizations. Using an appropriate digital mapping of the position space on which a walker evolves onto the multi-qubit states in a quantum processor, we present different configurations of quantum circuits for the implementation of discrete-time quantum walks in one-dimensional position space. With example circuits for a five qubit machine we address scalability to higher dimensions and larger quantum processors.