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

Quantum Information Processing

Efficient preparation method for arbitrary multiqubit states based on quantum walk

Dan Li, Lei Zhong

Published Oct 21, 2025• 0 citations
Publisher
DOI
10.1007/s11128-025-04957-6

Related papers

Quantum walks as a path for complexity reduction of multiqubit gates

Dmitry Solenov

Bulletin of the American Physical Society•Mar 5, 2018•0 citations

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

Controlled Remote State Preparation Using Quantum Walks

Binayak Samadder Choudhury, Manoj Kumar Mandal, Soumen Samanta

•Jan 1, 2023•0 citations

Lazy Quantum Walks with Native Multiqubit Gates

Steph Foulds, Viv Kendon

Quantum walks, the quantum analogue of the classical random walk, have been shown to underpin quantum algorithms for fluid dynamics. We propose the quantum half-adder gate method for quantum walks as a good benchmark algorithm, specifically to compare native two-qubit gate and native multiqubit gate implementations. Neutral atom hardware is a promising choice of platform for implementing quantum walks due to its ability to implement native multiqubit (>2-qubit) gates and to dynamically re-arrange qubits. Using detailed realistic error modelling for multiqubit Rydberg gates via two-photon adiabatic rapid passage, we present the gate sequences and predicted final state fidelities for some small one dimensional quantum walks, including lazy quantum walks; lazy quantum walks include a rest state, which is needed for quantum walks for fluid simulation. Our simulations pinpoint the sweet spot where native multiqubit gates provide an advantage compared with decomposing the gate into multiple smaller higher fidelity gates.

quant-pharXiv:2511.21608•Nov 27, 2025•0 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•0 citations

Quantum Walk Models with Multi-Component Qubits

玄洋 宮﨑

•Jul 1, 2007•0 citations
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.
Quantum walks, the quantum analogue of the classical random walk, have been shown to underpin quantum algorithms for fluid dynamics. We propose the quantum half-adder gate method for quantum walks as a good benchmark algorithm, specifically to compare native two-qubit gate and native multiqubit gate implementations. Neutral atom hardware is a promising choice of platform for implementing quantum walks due to its ability to implement native multiqubit (>2-qubit) gates and to dynamically re-arrange qubits. Using detailed realistic error modelling for multiqubit Rydberg gates via two-photon adiabatic rapid passage, we present the gate sequences and predicted final state fidelities for some small one dimensional quantum walks, including lazy quantum walks; lazy quantum walks include a rest state, which is needed for quantum walks for fluid simulation. Our simulations pinpoint the sweet spot where native multiqubit gates provide an advantage compared with decomposing the gate into multiple smaller higher fidelity gates.
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.