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:2003.07141 · Journal of Physics A Mathematical and Theoretical

Universal and optimal coin sequences for high entanglement generation in 1D discrete time quantum walks

Aikaterini Gratsea, Friederike Metz, Thomas Busch

Published Sep 4, 2020• 22 citations
arXivHTMLPDF

Abstract

Abstract Entanglement is a key resource in many quantum information applications and achieving high values independently of the initial conditions is an important task. Here we address the problem of generating highly entangled states in a discrete time quantum walk irrespective of the initial state using two different approaches. First, we present and analyze a deterministic sequence of coin operators which produces high values of entanglement in a universal manner for a class of localized initial states. In a second approach, we optimize the discrete sequence of coin operators using a reinforcement learning algorithm. While the amount of entanglement produced by the deterministic sequence is fully independent of the initial states considered, the optimized sequences achieve in general higher average values of entanglement that do however depend on the initial state parameters. Our proposed sequence and optimization algorithm are especially useful in cases where the initial state is not fully known or entanglement has to be generated in a universal manner for a range of initial states.

DOI
10.1088/1751-8121/abb54d

Related papers

Maximal coin-position entanglement generation in a quantum walk for the third step and beyond regardless of the initial state

Xiao‐Xu Fang, Kui An, Baitao Zhang +2 more

We study maximal coin-position entanglement generation via a discrete-time quantum walk, in which the coin operation is randomly selected from one of two coin operators set at each step. We solve maximal entanglement generation as an optimization problem with quantum process fidelity as the cost function. Then we determine the maximal entanglement that can be rigorously generated for any step beyond the second regardless of initial conditions with appropriate coin sequences. The simplest coin sequence comprising Hadamard and identity operations is equivalent to the generalized elephant quantum walk, which exhibits an increasingly faster spreading in terms of probability distribution. Experimentally, we demonstrate a ten-step quantum walk driven by such coin sequences with linear optics and thereby show the desired high-dimensional bipartite entanglement as well as the transport behavior of faster spreading.

arXiv:2209.01727•Physical Review A•Jan 30, 2023•14 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•25 citations

ASYMPTOTIC ENTANGLEMENT IN 1D QUANTUM WALKS WITH A TIME-DEPENDENT COINED

S. Salimi, R. YOSEFJANI

Discrete-time quantum walk evolve by a unitary operator which involves two operators a conditional shift in position space and a coin operator. This operator entangles the coin and position degrees of freedom of the walker. In this paper, we investigate the asymptotic behavior of the coin position entanglement (CPE) for an inhomogeneous quantum walk which determined by two orthogonal matrices in one-dimensional lattice. Free parameters of coin operator together provide many conditions under which a measurement perform on the coin state yield the value of entanglement on the resulting position quantum state. We study the problem analytically for all values that two free parameters of coin operator can take and the conditions under which entanglement becomes maximal are sought.

arXiv:1012.4566•International Journal of Modern Physics B•Jul 18, 2012•23 citations

Asymptotic entanglement in the discrete-time quantum walk

Gonzalo Abal, R. Donangelo, Hugo Fort

The coin-position entanglement generated by the evolution operator of a discrete--time quantum walk converges, in the long time limit, to a well defined value which depends on the initial state. We also discuss the asymptotic bi-partite entanglement generated by several non-separable coin operations for two coherent quantum walkers, for which the entropy of entanglement increases logarithmically.

arXiv:0709.3279•Sep 20, 2007•9 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•6 citations

Discrete-time quantum walks generated by aperiodic fractal sequence of space coin operators

R. F. S. Andrade, A. M. C. Souza

Properties of one-dimensional discrete-time quantum walks (DTQWs) are sensitive to the presence of inhomogeneities in the substrate, which can be generated by defining position-dependent coin operators. Deterministic aperiodic sequences of two or more symbols provide ideal environments where these properties can be explored in a controlled way. Based on an exhaustive numerical study, this work discusses a two-coin model resulting from the construction rules that lead to the usual fractal Cantor set. Although the fraction of the less frequent coin [Formula: see text] as the size of the chain is increased, it leaves peculiar properties in the walker dynamics. They are characterized by the wave function, from which results for the probability distribution and its variance, as well as the entanglement entropy, were obtained. A number of results for different choices of the two coins are presented. The entanglement entropy has shown to be very sensitive to uncovering subtle quantum effects present in the model.

arXiv:1806.04041•International Journal of Modern Physics C•Sep 6, 2018•4 citations
Abstract Entanglement is a key resource in many quantum information applications and achieving high values independently of the initial conditions is an important task. Here we address the problem of generating highly entangled states in a discrete time quantum walk irrespective of the initial state using two different approaches. First, we present and analyze a deterministic sequence of coin operators which produces high values of entanglement in a universal manner for a class of localized initial states. In a second approach, we optimize the discrete sequence of coin operators using a reinforcement learning algorithm. While the amount of entanglement produced by the deterministic sequence is fully independent of the initial states considered, the optimized sequences achieve in general higher average values of entanglement that do however depend on the initial state parameters. Our proposed sequence and optimization algorithm are especially useful in cases where the initial state is not fully known or entanglement has to be generated in a universal manner for a range of initial states.
We study maximal coin-position entanglement generation via a discrete-time quantum walk, in which the coin operation is randomly selected from one of two coin operators set at each step. We solve maximal entanglement generation as an optimization problem with quantum process fidelity as the cost function. Then we determine the maximal entanglement that can be rigorously generated for any step beyond the second regardless of initial conditions with appropriate coin sequences. The simplest coin sequence comprising Hadamard and identity operations is equivalent to the generalized elephant quantum walk, which exhibits an increasingly faster spreading in terms of probability distribution. Experimentally, we demonstrate a ten-step quantum walk driven by such coin sequences with linear optics and thereby show the desired high-dimensional bipartite entanglement as well as the transport behavior of faster spreading.
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.
Discrete-time quantum walk evolve by a unitary operator which involves two operators a conditional shift in position space and a coin operator. This operator entangles the coin and position degrees of freedom of the walker. In this paper, we investigate the asymptotic behavior of the coin position entanglement (CPE) for an inhomogeneous quantum walk which determined by two orthogonal matrices in one-dimensional lattice. Free parameters of coin operator together provide many conditions under which a measurement perform on the coin state yield the value of entanglement on the resulting position quantum state. We study the problem analytically for all values that two free parameters of coin operator can take and the conditions under which entanglement becomes maximal are sought.
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.
Properties of one-dimensional discrete-time quantum walks (DTQWs) are sensitive to the presence of inhomogeneities in the substrate, which can be generated by defining position-dependent coin operators. Deterministic aperiodic sequences of two or more symbols provide ideal environments where these properties can be explored in a controlled way. Based on an exhaustive numerical study, this work discusses a two-coin model resulting from the construction rules that lead to the usual fractal Cantor set. Although the fraction of the less frequent coin [Formula: see text] as the size of the chain is increased, it leaves peculiar properties in the walker dynamics. They are characterized by the wave function, from which results for the probability distribution and its variance, as well as the entanglement entropy, were obtained. A number of results for different choices of the two coins are presented. The entanglement entropy has shown to be very sensitive to uncovering subtle quantum effects present in the model.