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

Qubit state transfer via discrete-time quantum walks

İ. Yalçınkaya, Z. Gedik

Published May 15, 2015• 37 citations
arXivHTMLPDF

Abstract

Abstract We propose a scheme for perfect transfer of an unknown qubit state via the discrete-time quantum walk on a line or a circle. For this purpose, we introduce an additional coin operator which is applied at the end of the walk. This operator does not depend on the state to be transferred. We show that perfect state transfer over an arbitrary distance can be achieved only if the walk is driven by an identity or a flip coin operator. Other biased coin operators and the Hadamard coin allow perfect state transfer over finite distances only. Furthermore, we show that quantum walks ending with a perfect state transfer are periodic.

DOI
10.1088/1751-8113/48/22/225302

Related papers

Perfect state transfer and efficient quantum routing: A discrete-time quantum-walk approach

Xiang Zhan, Hao Qin, Zhihao Bian +2 more

We show that a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flips and extend this method to the distribution of an arbitrary unknown multiqubit entangled state between every pair of sites in the multidimensional network. Furthermore, we study the routing of quantum information on this network in a quantum-walk architecture, which can be used as quantum information processors to communicate between separated qubits.

arXiv:1405.6422•Physical Review A•Jul 21, 2014•75 citations

Quantum communication protocols by quantum walks with two coins

Yun Shang, Yu Wang, Meng Li +1 more

We introduce some new perfect state transfer and generalized long-distance teleportation schemes by quantum walks with two coins. By encoding the transferred information in the coin-1 state and alternately using two coin operators, we can perfectly recover the information in the coin-1 state at the target position by at most two flipping operations. On the basis of quantum walks with two coins on either a line or an N -circle, we can perfectly transfer any qubit state. In addition, using quantum walks with two coins on regular graphs, we can first implement a perfect qudit state transfer by quantum walks. Compared with existing schemes driven by one coin, more general graph structures can be used to perfectly transfer a more general state. We also study how to realize generalized teleportation over long-distance walks by the above quantum walk models.

arXiv:1802.02400•Europhysics Letters (EPL)•Jan 10, 2019•51 citations

Discrete-time quantum walk approach to high-dimensional quantum state transfer and quantum routing

Hengji Li, Jian Li, Xiu‐Bo Chen

High-dimensional quantum systems can offer extended possibilities and multiple advantages while developing advanced quantum technologies. In this paper, we propose a class of quantum-walk architecture networks that admit the efficient routing of high-dimensional quantum states. Perfect state transfer of an arbitrary unknown qudit state can be achieved between two arbitrary nodes via a one-dimensional lackadaisical discrete-time quantum walk. In addition, this method can be generalized to the high-dimensional lattices, where it allows distillable entanglement to be shared between arbitrary input and output ports. Implementation of our scheme is more feasible through exploiting the coin degrees of freedom and the settings of the coin flipping operators are simple. These results provide a direct application in a high-dimensional computational architecture to process much more information.

arXiv:2108.04923•Aug 10, 2021•6 citations

Perfect state transfer by means of discrete-time quantum walk on the complete bipartite graph

J.S.T. Huang, Dan Li, Panlong Li +2 more

Abstract Perfect state transfer has attracted a great deal of attention recently due to its crucial role in quantum communication and scalable quantum computation. In this paper, we propose the perfect state transfer algorithms with a pair of sender-receiver and two pairs of sender-receiver on the complete bipartite graph respectively. The algorithm with a pair of sender-receiver is implemented through discrete-time quantum walk, flexibly setting the coin operators based on the positions of the sender and receiver. The algorithm with two pairs of sender-receiver ensures that the two quantum states are distributed on both sides of the complete bipartite graph during the process, thereby achieving perfect state transfer. In addition, the quantum circuits corresponding to the algorithms are provided. The algorithms can transfer an arbitrary quantum state and can simultaneously transfer two arbitrary quantum states from the senders to the receivers in any case. Moreover, the algorithms are not only applicable to complete bipartite graphs but also to more graph structures with complete bipartite subgraphs, which will provide potential applications for quantum information processing.

Physica Scripta•Dec 7, 2023•1 citation

Periodicity and perfect state transfer in quantum walks on variants of cycles

Katharine E. Barr, Tim Proctor, Daniel Allen +1 more

We systematically investigated perfect state transfer between antipodal nodes of discrete time quantum walks on variants of the cycles $C_4$, $C_6$ and $C_8$ for three choices of coin operator. Perfect state transfer was found, in general, to be very rare, only being preserved for a very small number of ways of modifying the cycles. We observed that some of our useful modifications of $C_4$ could be generalised to an arbitrary number of nodes, and present three families of graphs which admit quantum walks with interesting dynamics either in the continuous time walk, or in the discrete time walk for appropriate selections of coin and initial conditions. These dynamics are either periodicity, perfect state transfer, or very high fidelity state transfer. These families are modifications of families known not to exhibit periodicity or perfect state transfer in general. The robustness of the dynamics is tested by varying the initial state, interpolating between structures and by adding decoherence.

arXiv:1204.5937•Quantum Information and Computation•May 1, 2014•23 citations

Perfect State Transfer in Quantum Walks on Graphs

Viv M. Kendon, Christino Tamon

We provide a brief survey of perfect state transfer in quantum walks on finite graphs. The ability to transfer a quantum state from one part of a quantum computer to another is a key ingredient of scalable architectures. Transfer through structures that do not require locally varying dynamic control simplifies the design and hence reduces the opportunities for errors to arise. Continuous time walks quantum walks on highly structured graphs exhibit perfect state transfer for the complete graph of size 2, the path of length 3, and the cycle of size 4. From these, larger graphs can be constructed, and the use of edge weights widens this set considerably. Discrete-time quantum walks have more flexibility through exploiting the coin degrees of freedom, but with the disadvantage that local control of the coin is required if the degree of the vertices varies. The closely related property of periodicity (exact return to the starting state) is also mentioned.

Journal of Computational and Theoretical Nanoscience•Mar 1, 2011•104 citations
Abstract We propose a scheme for perfect transfer of an unknown qubit state via the discrete-time quantum walk on a line or a circle. For this purpose, we introduce an additional coin operator which is applied at the end of the walk. This operator does not depend on the state to be transferred. We show that perfect state transfer over an arbitrary distance can be achieved only if the walk is driven by an identity or a flip coin operator. Other biased coin operators and the Hadamard coin allow perfect state transfer over finite distances only. Furthermore, we show that quantum walks ending with a perfect state transfer are periodic.
We show that a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flips and extend this method to the distribution of an arbitrary unknown multiqubit entangled state between every pair of sites in the multidimensional network. Furthermore, we study the routing of quantum information on this network in a quantum-walk architecture, which can be used as quantum information processors to communicate between separated qubits.
We introduce some new perfect state transfer and generalized long-distance teleportation schemes by quantum walks with two coins. By encoding the transferred information in the coin-1 state and alternately using two coin operators, we can perfectly recover the information in the coin-1 state at the target position by at most two flipping operations. On the basis of quantum walks with two coins on either a line or an N -circle, we can perfectly transfer any qubit state. In addition, using quantum walks with two coins on regular graphs, we can first implement a perfect qudit state transfer by quantum walks. Compared with existing schemes driven by one coin, more general graph structures can be used to perfectly transfer a more general state. We also study how to realize generalized teleportation over long-distance walks by the above quantum walk models.
High-dimensional quantum systems can offer extended possibilities and multiple advantages while developing advanced quantum technologies. In this paper, we propose a class of quantum-walk architecture networks that admit the efficient routing of high-dimensional quantum states. Perfect state transfer of an arbitrary unknown qudit state can be achieved between two arbitrary nodes via a one-dimensional lackadaisical discrete-time quantum walk. In addition, this method can be generalized to the high-dimensional lattices, where it allows distillable entanglement to be shared between arbitrary input and output ports. Implementation of our scheme is more feasible through exploiting the coin degrees of freedom and the settings of the coin flipping operators are simple. These results provide a direct application in a high-dimensional computational architecture to process much more information.
Abstract Perfect state transfer has attracted a great deal of attention recently due to its crucial role in quantum communication and scalable quantum computation. In this paper, we propose the perfect state transfer algorithms with a pair of sender-receiver and two pairs of sender-receiver on the complete bipartite graph respectively. The algorithm with a pair of sender-receiver is implemented through discrete-time quantum walk, flexibly setting the coin operators based on the positions of the sender and receiver. The algorithm with two pairs of sender-receiver ensures that the two quantum states are distributed on both sides of the complete bipartite graph during the process, thereby achieving perfect state transfer. In addition, the quantum circuits corresponding to the algorithms are provided. The algorithms can transfer an arbitrary quantum state and can simultaneously transfer two arbitrary quantum states from the senders to the receivers in any case. Moreover, the algorithms are not only applicable to complete bipartite graphs but also to more graph structures with complete bipartite subgraphs, which will provide potential applications for quantum information processing.
We systematically investigated perfect state transfer between antipodal nodes of discrete time quantum walks on variants of the cycles C4C_4C4​, C6C_6C6​ and C8C_8C8​ for three choices of coin operator. Perfect state transfer was found, in general, to be very rare, only being preserved for a very small number of ways of modifying the cycles. We observed that some of our useful modifications of C4C_4C4​ could be generalised to an arbitrary number of nodes, and present three families of graphs which admit quantum walks with interesting dynamics either in the continuous time walk, or in the discrete time walk for appropriate selections of coin and initial conditions. These dynamics are either periodicity, perfect state transfer, or very high fidelity state transfer. These families are modifications of families known not to exhibit periodicity or perfect state transfer in general. The robustness of the dynamics is tested by varying the initial state, interpolating between structures and by adding decoherence.
We provide a brief survey of perfect state transfer in quantum walks on finite graphs. The ability to transfer a quantum state from one part of a quantum computer to another is a key ingredient of scalable architectures. Transfer through structures that do not require locally varying dynamic control simplifies the design and hence reduces the opportunities for errors to arise. Continuous time walks quantum walks on highly structured graphs exhibit perfect state transfer for the complete graph of size 2, the path of length 3, and the cycle of size 4. From these, larger graphs can be constructed, and the use of edge weights widens this set considerably. Discrete-time quantum walks have more flexibility through exploiting the coin degrees of freedom, but with the disadvantage that local control of the coin is required if the degree of the vertices varies. The closely related property of periodicity (exact return to the starting state) is also mentioned.