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

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

Hengji Li, Jian Li, Xiu‐Bo Chen

Published Aug 10, 2021• 6 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2108.04923

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

Qubit state transfer via discrete-time quantum walks

İ. Yalçınkaya, Z. Gedik

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.

arXiv:1407.0689•Journal of Physics A Mathematical and Theoretical•May 15, 2015•37 citations

Determinate arbitrary quantum state engineering through one-dimensional quantum walks

Yu Wang, Meng Li, Yuanyuan Zhao

Efficient generation of arbitrary superposed quantum states in high-dimensional systems is crucial for various quantum technologies but remains fundamentally challenging because of the intricate and extensive parameter control. In this work, we propose a generalized discrete one-dimensional quantum walk model with time- and position-dependent coin operations, and varied shift lengths. This approach enables deterministic and direct preparation of any qudit state | ϕ 〉 = ∑ k = 0 d − 1 a k | k 〉 using binary or ternary tree structures, without solving quadratic equations. Our method requires only O ( log d ) steps and O ( d ) coin operations, significantly reducing the resource requirements compared to the previous approach of O ( d ) steps and O ( d 2 ) coin operations. Additionally, we propose an experimental scheme based on successive interferometers, demonstrating that our method is compatible with current state-of-the-art experimental technologies. This efficient method for preparing quantum superposition states lays a foundation for advancing quantum technologies, with broad applications in quantum information processing.

Physical Review Research•May 29, 2025•1 citation

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

Multipartite high-dimensional quantum state engineering via discrete-time quantum walk

Junhong Nie, Meng Li, Xiaoming Sun

Quantum state engineering, namely, the generation and control of arbitrary quantum states, is drawing more and more attention due to its wide applications in quantum information and computation. However, there is no general method in theory, and the existing schemes also depend heavily on the selected experimental platform. In this article, we give two schemes for the generating task of arbitrary quantum state in $c$-partite $d$-dimensional system, both of which are based on a discrete-time quantum walk with a ${2}^{c}$-dimensional time- and position-dependent coin. The first procedure is a $d$-step quantum walk where all the $d$ coins are nonidentity, while the second procedure is an $O(d)$-step quantum walk where only $O(logd)$ coins are nonidentity. A concrete example of preparing generalized Bell states is given to demonstrate the first scheme we proposed. Furthermore, the first scheme can be applied to give an alternative approach to the quantum state preparation problem which is one of the fundamental tasks of quantum information processing. We design circuits for quantum state preparation with the help of our quantum state engineering scheme that match the best current result in both size and depth of the circuit asymptotically.

arXiv:2212.12164•Physical Review A•Mar 29, 2024•5 citations

Implementing quantum walks with a single qubit

Qi-Ping Su, Shi-Chao Wang, Yan Chi +5 more

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.

arXiv:2206.03642•Jun 8, 2022•1 citation
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.
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.
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.
Efficient generation of arbitrary superposed quantum states in high-dimensional systems is crucial for various quantum technologies but remains fundamentally challenging because of the intricate and extensive parameter control. In this work, we propose a generalized discrete one-dimensional quantum walk model with time- and position-dependent coin operations, and varied shift lengths. This approach enables deterministic and direct preparation of any qudit state | ϕ 〉 = ∑ k = 0 d − 1 a k | k 〉 using binary or ternary tree structures, without solving quadratic equations. Our method requires only O ( log d ) steps and O ( d ) coin operations, significantly reducing the resource requirements compared to the previous approach of O ( d ) steps and O ( d 2 ) coin operations. Additionally, we propose an experimental scheme based on successive interferometers, demonstrating that our method is compatible with current state-of-the-art experimental technologies. This efficient method for preparing quantum superposition states lays a foundation for advancing quantum technologies, with broad applications in quantum information processing.
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.
Quantum state engineering, namely, the generation and control of arbitrary quantum states, is drawing more and more attention due to its wide applications in quantum information and computation. However, there is no general method in theory, and the existing schemes also depend heavily on the selected experimental platform. In this article, we give two schemes for the generating task of arbitrary quantum state in ccc-partite ddd-dimensional system, both of which are based on a discrete-time quantum walk with a 2c{2}^{c}2c-dimensional time- and position-dependent coin. The first procedure is a ddd-step quantum walk where all the ddd coins are nonidentity, while the second procedure is an O(d)O(d)O(d)-step quantum walk where only O(logd)O(logd)O(logd) coins are nonidentity. A concrete example of preparing generalized Bell states is given to demonstrate the first scheme we proposed. Furthermore, the first scheme can be applied to give an alternative approach to the quantum state preparation problem which is one of the fundamental tasks of quantum information processing. We design circuits for quantum state preparation with the help of our quantum state engineering scheme that match the best current result in both size and depth of the circuit asymptotically.
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.