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:1709.05279 · Quantum Information Processing

High-fidelity quantum state preparation using neighboring optimal control

Yuchen Peng, Frank Gaitan

Published Sep 12, 2017• 2 citations
arXivHTMLPDF
DOI
10.1007/s11128-017-1715-7

Related papers

State preparation in a Jaynes-Cummings lattice with quantum optimal control

Prabin Parajuli, Anuvetha Govindarajan, Lin Tian

High-fidelity preparation of quantum states in an interacting many-body system is often hindered by the lack of knowledge of such states and by limited decoherence times. Here, we study a quantum optimal control (QOC) approach for fast generation of quantum ground states in a finite-sized Jaynes-Cummings lattice with unit filling. Our result shows that the QOC approach can generate quantum many-body states with high fidelity when the evolution time is above a threshold time, and it can significantly outperform the adiabatic approach. We study the dependence of the threshold time on the parameter constraints and the connection of the threshold time with the quantum speed limit. We also show that the QOC approach can be robust against control errors. Our result can lead to advances in the application of the QOC to many-body state preparation.

arXiv:2306.11968•Scientific Reports•Nov 14, 2023•5 citations

Optimal control of fast and high-fidelity quantum state transfer in spin-1/2 chains

Xiong-Peng Zhang, Bin Shao, Shuai Hu +2 more

Annals of Physics•Oct 27, 2016•24 citations

Quantum Gate and Quantum State Preparation through Neighboring Optimal Control

Yuchen Peng

Successful implementation of fault-tolerant quantum computation on a system of qubits places severe demands on the hardware used to control the many-qubit state. It is known that an accuracy threshold Pa exists for any quantum gate that is to be used for such a computation to be able to continue for an unlimited number of steps. Specifically, the error probability Pe for such a gate must fall below the accuracy threshold: Pe < Pa. Estimates of Pa vary widely, though Pa ∼ 10−4 has emerged as a challenging target for hardware designers. I present a theoretical framework based on neighboring optimal control that takes as input a good quantum gate and returns a new gate with better performance. I illustrate this approach by applying it to a universal set of quantum gates produced using non-adiabatic rapid passage. Performance improvements are substantial comparing to the original (unimproved) gates, both for ideal and non-ideal controls. Under suitable conditions detailed below, all gate error probabilities fall by 1 to 4 orders of magnitude below the target threshold of 10−4. After applying the neighboring optimal control theory to improve the performance of quantum gates in a universal set, I further apply the general control theory in a two-step procedure for fault-tolerant logical state preparation, and I illustrate this procedure by preparing a logical Bell state fault-tolerantly. The two-step preparation procedure is as follow: Step 1 provides a one-shot procedure using neighboring optimal control theory to prepare a physical qubit state which is a high-fidelity approximation to the Bell state |β01⟩ = 1/√2(|01⟩ + |10⟩). I show that for ideal (non-ideal) control, an approximate |β01⟩ state could be prepared with error probability ϵ ∼ 10−6 (10−5) with one-shot local operations. Step 2 then takes a block of p pairs of physical qubits, each prepared in |β01⟩ state using Step 1, and fault-tolerantly prepares the logical Bell state for the C4 quantum error detection code.

•Jan 1, 2016•0 citations

discrete-Time feedback control strategies for quantum states preparation

Giacomo Baggio

•Oct 10, 2011•1 citation

Experimental demonstration of quantum optimal control via the alternating control–evolution protocol

Ruiqi Tang, Yanjun Hou, Zhenyue 臻越 Du 杜 +4 more

Abstract As a crucial component of quantum technologies, quantum optimal control enables the high-fidelity engineering of desired quantum states and operations. Conventional approaches, such as the widely used gradient ascent pulse engineering (GRAPE) algorithm, typically rely on dense pulse sequences with a large number of control parameters, leading to inefficient optimization and increased sensitivity to experimental imperfections. In this work, we propose the alternating control–evolution (ACE) protocol, a flexible framework that constructs quantum operations by interleaving elementary control operations with tunable free evolutions, thereby enabling the design of sparse pulse sequences that exploit intrinsic system dynamics. This design substantially reduces the number of control parameters while retaining high expressibility and control fidelity. Numerical simulations on nuclear magnetic resonance systems show that the ACE protocol achieves more than a 20-fold reduction in the number of control parameters compared to GRAPE, with comparable fidelity in state preparation tasks. We further experimentally validate the ACE protocol on a four-qubit NMR platform by preparing a Greenberger–Horne–Zeilinger (GHZ) state with a fidelity of 99.52%. These results demonstrate that the ACE protocol provides an efficient and experimentally robust strategy for quantum optimal control, particularly suitable for the noisy intermediate-scale quantum (NISQ) era.

Chinese Physics B•Mar 25, 2026•0 citations

Steering the Fidelity in State Preparation on Noisy Bosonic Systems with Risk-Seeking Optimization

Riccardo Piantoni, Riccardo Pellini, Maurizio Ferrari Dacrema +1 more

In order to execute quantum algorithms on bosonic quantum computers, it is necessary to encode their inputs into a desired target quantum state, with a process called state preparation. In real settings, state preparation methods operate in stochastic scenarios, where the prepared state is represented as a mixed state, that is a probabilistic ensemble of pure states. Therefore, existing state preparation methods optimize a variational ansatz by averaging over all possible sequences of photon loss events contained in the prepared ensemble, yielding an output state which approximates the desired target with a certain average fidelity. Such an approach, however, does not take into account directly the distribution of fidelities across states in the ensemble. In this work, we aim to maximize the fidelity of only a subset of pure states sampled from the prepared ensemble, at the cost of reducing the average fidelity overall. This trade-off is relevant when the goal is to obtain high-fidelity states with a certain probability, rather than maximizing the average fidelity of the prepared ensemble. We borrow and adapt objective functions from risk-sensitive optimization, a framework that optimizes specific characteristics of a distribution rather than only its expectation, and that has been successfully applied in Reinforcement Learning. In the considered experimental settings, our results show that the infidelities of some pure states in the prepared ensemble can be reduced by up to four orders of magnitude when using risk-seeking objectives, compared to those achieved using the standard optimization of the average fidelity. Furthermore, we show that it is possible to control the trade-off between the probability of obtaining high-fidelity states and the lowest infidelity threshold reached, providing the flexibility to select the operating point that best suits a certain application.

quant-pharXiv:2610.18495•Oct 14, 2026•0 citations
High-fidelity preparation of quantum states in an interacting many-body system is often hindered by the lack of knowledge of such states and by limited decoherence times. Here, we study a quantum optimal control (QOC) approach for fast generation of quantum ground states in a finite-sized Jaynes-Cummings lattice with unit filling. Our result shows that the QOC approach can generate quantum many-body states with high fidelity when the evolution time is above a threshold time, and it can significantly outperform the adiabatic approach. We study the dependence of the threshold time on the parameter constraints and the connection of the threshold time with the quantum speed limit. We also show that the QOC approach can be robust against control errors. Our result can lead to advances in the application of the QOC to many-body state preparation.
Successful implementation of fault-tolerant quantum computation on a system of qubits places severe demands on the hardware used to control the many-qubit state. It is known that an accuracy threshold Pa exists for any quantum gate that is to be used for such a computation to be able to continue for an unlimited number of steps. Specifically, the error probability Pe for such a gate must fall below the accuracy threshold: Pe < Pa. Estimates of Pa vary widely, though Pa ∼ 10−4 has emerged as a challenging target for hardware designers. I present a theoretical framework based on neighboring optimal control that takes as input a good quantum gate and returns a new gate with better performance. I illustrate this approach by applying it to a universal set of quantum gates produced using non-adiabatic rapid passage. Performance improvements are substantial comparing to the original (unimproved) gates, both for ideal and non-ideal controls. Under suitable conditions detailed below, all gate error probabilities fall by 1 to 4 orders of magnitude below the target threshold of 10−4. After applying the neighboring optimal control theory to improve the performance of quantum gates in a universal set, I further apply the general control theory in a two-step procedure for fault-tolerant logical state preparation, and I illustrate this procedure by preparing a logical Bell state fault-tolerantly. The two-step preparation procedure is as follow: Step 1 provides a one-shot procedure using neighboring optimal control theory to prepare a physical qubit state which is a high-fidelity approximation to the Bell state |β01⟩ = 1/√2(|01⟩ + |10⟩). I show that for ideal (non-ideal) control, an approximate |β01⟩ state could be prepared with error probability ϵ ∼ 10−6 (10−5) with one-shot local operations. Step 2 then takes a block of p pairs of physical qubits, each prepared in |β01⟩ state using Step 1, and fault-tolerantly prepares the logical Bell state for the C4 quantum error detection code.
Abstract As a crucial component of quantum technologies, quantum optimal control enables the high-fidelity engineering of desired quantum states and operations. Conventional approaches, such as the widely used gradient ascent pulse engineering (GRAPE) algorithm, typically rely on dense pulse sequences with a large number of control parameters, leading to inefficient optimization and increased sensitivity to experimental imperfections. In this work, we propose the alternating control–evolution (ACE) protocol, a flexible framework that constructs quantum operations by interleaving elementary control operations with tunable free evolutions, thereby enabling the design of sparse pulse sequences that exploit intrinsic system dynamics. This design substantially reduces the number of control parameters while retaining high expressibility and control fidelity. Numerical simulations on nuclear magnetic resonance systems show that the ACE protocol achieves more than a 20-fold reduction in the number of control parameters compared to GRAPE, with comparable fidelity in state preparation tasks. We further experimentally validate the ACE protocol on a four-qubit NMR platform by preparing a Greenberger–Horne–Zeilinger (GHZ) state with a fidelity of 99.52%. These results demonstrate that the ACE protocol provides an efficient and experimentally robust strategy for quantum optimal control, particularly suitable for the noisy intermediate-scale quantum (NISQ) era.
In order to execute quantum algorithms on bosonic quantum computers, it is necessary to encode their inputs into a desired target quantum state, with a process called state preparation. In real settings, state preparation methods operate in stochastic scenarios, where the prepared state is represented as a mixed state, that is a probabilistic ensemble of pure states. Therefore, existing state preparation methods optimize a variational ansatz by averaging over all possible sequences of photon loss events contained in the prepared ensemble, yielding an output state which approximates the desired target with a certain average fidelity. Such an approach, however, does not take into account directly the distribution of fidelities across states in the ensemble. In this work, we aim to maximize the fidelity of only a subset of pure states sampled from the prepared ensemble, at the cost of reducing the average fidelity overall. This trade-off is relevant when the goal is to obtain high-fidelity states with a certain probability, rather than maximizing the average fidelity of the prepared ensemble. We borrow and adapt objective functions from risk-sensitive optimization, a framework that optimizes specific characteristics of a distribution rather than only its expectation, and that has been successfully applied in Reinforcement Learning. In the considered experimental settings, our results show that the infidelities of some pure states in the prepared ensemble can be reduced by up to four orders of magnitude when using risk-seeking objectives, compared to those achieved using the standard optimization of the average fidelity. Furthermore, we show that it is possible to control the trade-off between the probability of obtaining high-fidelity states and the lowest infidelity threshold reached, providing the flexibility to select the operating point that best suits a certain application.