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

Physical Review Research

Determinate arbitrary quantum state engineering through one-dimensional quantum walks

Yu Wang, Meng Li, Yuanyuan Zhao

Published May 29, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.1103/2frm-2v6m

Related papers

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•4 citations

Quantum state engineering using one-dimensional discrete-time quantum walks

Luca Innocenti, Helena Majury, Taira Giordani +4 more

Quantum state preparation in high-dimensional systems is an essential requirement for many quantum-technology applications. The engineering of an arbitrary quantum state is, however, typically strongly dependent on the experimental platform chosen for implementation, and a general framework is still missing. Here we show that coined quantum walks on a line, which represent a framework general enough to encompass a variety of different platforms, can be used for quantum state engineering of arbitrary superpositions of the walker's sites. We achieve this goal by identifying a set of conditions that fully characterize the reachable states in the space comprising walker and coin and providing a method to efficiently compute the corresponding set of coin parameters. We assess the feasibility of our proposal by identifying a linear optics experiment based on photonic orbital angular momentum technology.

arXiv:1710.10518•Physical Review A•Dec 21, 2017•52 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•2 citations

Experimental Engineering of Arbitrary Qudit States with Discrete-Time Quantum Walks

Taira Giordani, Emanuele Polino, Sabrina Emiliani +8 more

The capability to generate and manipulate quantum states in high-dimensional Hilbert spaces is a crucial step for the development of quantum technologies, from quantum communication to quantum computation. One-dimensional quantum walk dynamics represents a valid tool in the task of engineering arbitrary quantum states. Here we affirm such potential in a linear-optics platform that realizes discrete-time quantum walks in the orbital angular momentum degree of freedom of photons. Different classes of relevant qudit states in a six-dimensional space are prepared and measured, confirming the feasibility of the protocol. Our results represent a further investigation of quantum walk dynamics in photonics platforms, paving the way for the use of such a quantum state-engineering toolbox for a large range of applications.

arXiv:1808.08875•Physical Review Letters•Jan 18, 2019•107 citations

Generation of high-dimensional qudit quantum states via two-dimensional quantum walks

Chiara Esposito, Francesco Di Colandrea, Francesco Hoch +5 more

Several quantum protocols, with applications ranging from fundamental studies to cryptographic scenarios, can be enhanced through the generation and manipulation of quantum states that belong to high-dimensional Hilbert spaces. For this reason, it is worth devoting efforts to find more efficient methods for complex qudit-state generation. One-dimensional quantum walks have proved to be efficient and versatile platforms for the engineering of such complex states. Hitherto, however, using their two-dimensional counterpart for this task has remained unexplored. In this paper, we consider two-dimensional quantum walk evolution as a tool for the generation of high-dimensional qudit states. We theoretically prove that a suitable change of the coin operators at each step permits the generation of a subset of qudit states by using less resources with respect to the one-dimensional counterpart. Then, we successfully generate qudit states by exploiting two-dimensional quantum walks on an experimental photonic platform. The walker position is encoded on discrete sets of optical modes carrying quantized amounts of transverse momentum and the mode couplings are actively controlled via liquid-crystal devices. The obtained results provide insight into qudit generation for applications in quantum communication and quantum cryptography.

Physical Review Research•Oct 10, 2023•8 citations

Robust implementation of discrete-time quantum walks in any finite-dimensional quantum system

Biswayan Nandi, Sandipan Singha, Ankan Datta +2 more

Research has shown that quantum walks can accelerate certain quantum algorithms and act as a universal paradigm for quantum processing. The discrete-time quantum walk (DTQW) model, owing to its discrete nature, stands out as one of the most suitable choices for circuit implementation. Nevertheless, most current implementations are characterized by extensive, multi-layered quantum circuits, leading to higher computational expenses and a notable decrease in the number of confidently executable time steps on current quantum computers. Since quantum computers are not scalable enough in this NISQ era, we also must confine ourselves to the ancilla-free frontier zone. Therefore, in this paper, we have successfully cut down the circuit cost concerning gate count and circuit depth by half through our proposed methodology in qubit systems as compared to the state-of-the-art increment–decrement approach. Furthermore, for the engineering excellence of our proposed approach, we implement DTQW in any finite-dimensional quantum system with akin efficiency. To ensure an efficient implementation of quantum walks without requiring ancilla, we have incorporated an intermediate qudit technique for decomposing multi-qubit gates. Experimental outcomes hold significance far beyond the realm of just a few time steps, laying the groundwork for dependable implementation and utilization on quantum computers.

arXiv:2408.00530•Modern Physics Letters A•Mar 29, 2025•0 citations
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.
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 state preparation in high-dimensional systems is an essential requirement for many quantum-technology applications. The engineering of an arbitrary quantum state is, however, typically strongly dependent on the experimental platform chosen for implementation, and a general framework is still missing. Here we show that coined quantum walks on a line, which represent a framework general enough to encompass a variety of different platforms, can be used for quantum state engineering of arbitrary superpositions of the walker's sites. We achieve this goal by identifying a set of conditions that fully characterize the reachable states in the space comprising walker and coin and providing a method to efficiently compute the corresponding set of coin parameters. We assess the feasibility of our proposal by identifying a linear optics experiment based on photonic orbital angular momentum technology.
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.
The capability to generate and manipulate quantum states in high-dimensional Hilbert spaces is a crucial step for the development of quantum technologies, from quantum communication to quantum computation. One-dimensional quantum walk dynamics represents a valid tool in the task of engineering arbitrary quantum states. Here we affirm such potential in a linear-optics platform that realizes discrete-time quantum walks in the orbital angular momentum degree of freedom of photons. Different classes of relevant qudit states in a six-dimensional space are prepared and measured, confirming the feasibility of the protocol. Our results represent a further investigation of quantum walk dynamics in photonics platforms, paving the way for the use of such a quantum state-engineering toolbox for a large range of applications.
Several quantum protocols, with applications ranging from fundamental studies to cryptographic scenarios, can be enhanced through the generation and manipulation of quantum states that belong to high-dimensional Hilbert spaces. For this reason, it is worth devoting efforts to find more efficient methods for complex qudit-state generation. One-dimensional quantum walks have proved to be efficient and versatile platforms for the engineering of such complex states. Hitherto, however, using their two-dimensional counterpart for this task has remained unexplored. In this paper, we consider two-dimensional quantum walk evolution as a tool for the generation of high-dimensional qudit states. We theoretically prove that a suitable change of the coin operators at each step permits the generation of a subset of qudit states by using less resources with respect to the one-dimensional counterpart. Then, we successfully generate qudit states by exploiting two-dimensional quantum walks on an experimental photonic platform. The walker position is encoded on discrete sets of optical modes carrying quantized amounts of transverse momentum and the mode couplings are actively controlled via liquid-crystal devices. The obtained results provide insight into qudit generation for applications in quantum communication and quantum cryptography.
Research has shown that quantum walks can accelerate certain quantum algorithms and act as a universal paradigm for quantum processing. The discrete-time quantum walk (DTQW) model, owing to its discrete nature, stands out as one of the most suitable choices for circuit implementation. Nevertheless, most current implementations are characterized by extensive, multi-layered quantum circuits, leading to higher computational expenses and a notable decrease in the number of confidently executable time steps on current quantum computers. Since quantum computers are not scalable enough in this NISQ era, we also must confine ourselves to the ancilla-free frontier zone. Therefore, in this paper, we have successfully cut down the circuit cost concerning gate count and circuit depth by half through our proposed methodology in qubit systems as compared to the state-of-the-art increment–decrement approach. Furthermore, for the engineering excellence of our proposed approach, we implement DTQW in any finite-dimensional quantum system with akin efficiency. To ensure an efficient implementation of quantum walks without requiring ancilla, we have incorporated an intermediate qudit technique for decomposing multi-qubit gates. Experimental outcomes hold significance far beyond the realm of just a few time steps, laying the groundwork for dependable implementation and utilization on quantum computers.