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:2501.11933 · Physical Review Letters

Time-Optimal Transfer of the Quantum State in Long Qubit Arrays

Andrei A. Stepanenko, Kseniia S. Chernova, Maxim A. Gorlach

Published Jun 10, 2025• 8 citations
arXivHTMLPDF

Abstract

Recent technological advances have allowed the fabrication of large arrays of coupled qubits, serving as prototypes for quantum processors. However, the optimal control of such systems remains notoriously challenging, limiting the potential of large-scale quantum systems. Here, we investigate a model problem of quantum state transfer in a large nearest-neighbor-coupled qubit array. We derive an optimal control strategy that simultaneously achieves maximal fidelity and minimal transfer time, reaching the quantum speed limit in a lattice with time-varying couplings.

DOI
10.1103/mxrq-7rl4

Related papers

Time-Optimal Quantum State Transfer in Long Qubit Chains

Kseniia S. Chernova, Andrei A. Stepanenko, Maxim A. Gorlach

Recent progress in quantum technologies enables the fabrication of large-scale qubit arrays, but their optimal control remains challenging. In our work, we present a protocol for perfect quantum state transfer in a nearest-neighbor coupled chain of qubits, achieving maximal fidelity and minimal transfer time simultaneously. We apply the quantum brachistochrone method and obtain a protocol for the transfer of Fock and Bell states. Our solution reaches the fundamental quantum speed limit in the lattices with time-varying couplings.

Photonics & Electromagnetics Research Symposium - Fall (PIERS-Fall)•Nov 1, 2025•0 citations

Efficient computation of quantum time-optimal control

Andrei A. Stepanenko, Kseniia S. Chernova, Maxim Mazanov +1 more

We present an approach to compute time-optimal control of a quantum system which combines quantum brachistochrone and Lax pair techniques and enables efficient investigation of large-scale quantum systems. We illustrate our method by finding the quantum speed limit for a single-particle excitation in a nearest-neighbor-coupled qubit lattice with switchable couplings and fixed sum of their squares. We obtain the solution for a finite system with up to 10 000 qubits and for the effectively infinite lattice closed into ring. As another application of our method, we derive the quantum speed limit for a lattice with time-independent couplings.

quant-pharXiv:2511.11508•Physical Review A•Nov 17, 2025•0 citations

Optimizing state transfer in a three-qubit array via quantum brachistochrone method [Invited]

Kseniia S. Chernova, Andrei A. Stepanenko, Maxim A. Gorlach

The quantum brachistochrone method has recently emerged as a technique that allows one to implement the desired unitary evolution operator in a physical system within a minimal time. Here, we apply this approach to the problem of time-optimal quantum state transfer in an array of three qubits with time-varying nearest-neighbor couplings and analytically derive the fastest protocol.

arXiv:2411.08644•Optical Materials Express•Feb 13, 2025•5 citations

Efficient Hamiltonian programming in qubit arrays with nearest-neighbor couplings

Takahiro Tsunoda, Gaurav Bhole, Stephen Jones +2 more

We consider the problem of selectively controlling couplings in a practical quantum processor with always-on interactions that are diagonal in the computational basis, using sequences of local not gates. This methodology is well known in nuclear magnetic resonance implementations, but previous approaches do not scale efficiently for the general fully connected Hamiltonian, where the complexity of finding time-optimal solutions makes them only practical up to a few tens of qubits. Given the rapid growth in the number of qubits in cutting-edge quantum processors, it is of interest to investigate the applicability of this control scheme to much larger-scale systems with realistic restrictions on connectivity. Here we present an efficient scheme to find near time-optimal solutions that can be applied to engineered qubit arrays with local connectivity for any number of qubits, indicating the potential for practical quantum computing in such systems.

Bulletin of the American Physical Society•Mar 15, 2021•0 citations

Efficient Hamiltonian programming in qubit arrays with nearest-neighbor couplings

Takahiro Tsunoda, Gaurav Bhole, Stephen A. Jones +2 more

We consider the problem of selectively controlling couplings in a practical quantum processor with always-on interactions that are diagonal in the computational basis, using sequences of local not gates. This methodology is well known in nuclear magnetic resonance implementations, but previous approaches do not scale efficiently for the general fully connected Hamiltonian, where the complexity of finding time-optimal solutions makes them only practical up to a few tens of qubits. Given the rapid growth in the number of qubits in cutting-edge quantum processors, it is of interest to investigate the applicability of this control scheme to much larger-scale systems with realistic restrictions on connectivity. Here we present an efficient scheme to find near time-optimal solutions that can be applied to engineered qubit arrays with local connectivity for any number of qubits, indicating the potential for practical quantum computing in such systems.

arXiv:2003.07815•Physical Review A•Sep 10, 2020•8 citations

Quantum advantage in transfer of quantum states

Andrei Stepanenko, Kseniia Chernova, Maxim Gorlach

Quantum advantage, broadly understood as the ability of quantum systems to significantly outperform their classical counterparts, underpins current interest to quantum technologies and is a topic of active investigation. In many situations, its existence is subject to debate, and the areas of supremacy of large-scale quantum systems are not well defined. Here, we uncover a novel niche where quantum advantage can be clearly defined and proven. We study a time-optimal transfer of excitations in the lattice involving both nearest-neighbor and longer-range couplings. We prove that the quantum-mechanical property of a particle to propagate along several trajectories simultaneously speeds up the transfer process, which takes a shorter time compared to any particular trajectory and thus provides a clear example of quantum advantage.

quant-pharXiv:2604.05915•Apr 8, 2026•0 citations
Recent technological advances have allowed the fabrication of large arrays of coupled qubits, serving as prototypes for quantum processors. However, the optimal control of such systems remains notoriously challenging, limiting the potential of large-scale quantum systems. Here, we investigate a model problem of quantum state transfer in a large nearest-neighbor-coupled qubit array. We derive an optimal control strategy that simultaneously achieves maximal fidelity and minimal transfer time, reaching the quantum speed limit in a lattice with time-varying couplings.
Recent progress in quantum technologies enables the fabrication of large-scale qubit arrays, but their optimal control remains challenging. In our work, we present a protocol for perfect quantum state transfer in a nearest-neighbor coupled chain of qubits, achieving maximal fidelity and minimal transfer time simultaneously. We apply the quantum brachistochrone method and obtain a protocol for the transfer of Fock and Bell states. Our solution reaches the fundamental quantum speed limit in the lattices with time-varying couplings.
We present an approach to compute time-optimal control of a quantum system which combines quantum brachistochrone and Lax pair techniques and enables efficient investigation of large-scale quantum systems. We illustrate our method by finding the quantum speed limit for a single-particle excitation in a nearest-neighbor-coupled qubit lattice with switchable couplings and fixed sum of their squares. We obtain the solution for a finite system with up to 10 000 qubits and for the effectively infinite lattice closed into ring. As another application of our method, we derive the quantum speed limit for a lattice with time-independent couplings.
We consider the problem of selectively controlling couplings in a practical quantum processor with always-on interactions that are diagonal in the computational basis, using sequences of local not gates. This methodology is well known in nuclear magnetic resonance implementations, but previous approaches do not scale efficiently for the general fully connected Hamiltonian, where the complexity of finding time-optimal solutions makes them only practical up to a few tens of qubits. Given the rapid growth in the number of qubits in cutting-edge quantum processors, it is of interest to investigate the applicability of this control scheme to much larger-scale systems with realistic restrictions on connectivity. Here we present an efficient scheme to find near time-optimal solutions that can be applied to engineered qubit arrays with local connectivity for any number of qubits, indicating the potential for practical quantum computing in such systems.
We consider the problem of selectively controlling couplings in a practical quantum processor with always-on interactions that are diagonal in the computational basis, using sequences of local not gates. This methodology is well known in nuclear magnetic resonance implementations, but previous approaches do not scale efficiently for the general fully connected Hamiltonian, where the complexity of finding time-optimal solutions makes them only practical up to a few tens of qubits. Given the rapid growth in the number of qubits in cutting-edge quantum processors, it is of interest to investigate the applicability of this control scheme to much larger-scale systems with realistic restrictions on connectivity. Here we present an efficient scheme to find near time-optimal solutions that can be applied to engineered qubit arrays with local connectivity for any number of qubits, indicating the potential for practical quantum computing in such systems.
Quantum advantage, broadly understood as the ability of quantum systems to significantly outperform their classical counterparts, underpins current interest to quantum technologies and is a topic of active investigation. In many situations, its existence is subject to debate, and the areas of supremacy of large-scale quantum systems are not well defined. Here, we uncover a novel niche where quantum advantage can be clearly defined and proven. We study a time-optimal transfer of excitations in the lattice involving both nearest-neighbor and longer-range couplings. We prove that the quantum-mechanical property of a particle to propagate along several trajectories simultaneously speeds up the transfer process, which takes a shorter time compared to any particular trajectory and thus provides a clear example of quantum advantage.