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

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

Riccardo Piantoni, Riccardo Pellini, Maurizio Ferrari Dacrema, Paolo Cremonesi

quant-phcs.LGSubmitted Oct 13, 2026• Announced Oct 14, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

Standard noisy-state preparation maximizes average fidelity, but does not directly control the fidelity distribution across noise trajectories. This paper asks whether risk-seeking optimization can favor high-fidelity trajectories at the expense of ensemble-average performance, using bosonic SNAP–displacement state preparation. Two objectives apply entropic risk to trajectory fidelity $F$ or negative log-infidelity $-\log(1-F)$, with a positive risk coefficient $\beta$ controlling the emphasis on favorable outcomes. Optimization uses Monte Carlo photon-counting trajectories and stochastic-computation-graph gradients that account for parameter-dependent trajectory probabilities. Classical simulations consider one eight-level qudit, 64 additional leakage-buffer levels, four SNAP–displacement blocks, cavity lifetime $T_1=1\,\mathrm{ms}$, and a Haar-random target. Each setting uses 100 optimization runs of 30,000 steps, with ten trajectories per step and 10,000 evaluation trajectories per run. Average-fidelity optimization achieves mean fidelity $0.824$, but reaches no trajectory-infidelity threshold below $10^{-2}$. Risk-seeking objectives reach $10^{-6}$, a four-order-of-magnitude reduction in the lowest threshold reached. At this threshold, log-infidelity risk with $\beta=1$ succeeds in 12% of optimization runs; successful runs produce qualifying trajectories with mean probability $0.680$, while mean ensemble fidelity across all runs is $0.748$. Reported trajectory probabilities are conditional on successful optimization. Practical use requires suitable measurement or heralding to associate trajectories with outcomes. The logarithmic objective introduces finite-sample gradient bias. Generalization across targets, dimensions, circuit depths, and noise models remains untested; saturation and conditional-probability trends require further investigation.

Little sign of AI-generated textAI use disclosedIncrementalSmall numerics onlyStrong assumptions
the authors used GPT-5.6 Sol, GPT-5.6 Luna and Grammarly in order to paraphrase and reword, as well as grammar and spelling check.

Central claim may not hold: The abstract's probability of obtaining high-fidelity states has an operational interpretation only with access to an appropriate photon-counting measurement or heralding record, which the paper assumes conditionally but does not implement. The reported four-orders improvement compares the lowest successful thresholds on a decade-spaced grid, rather than measured minimum infidelities whose ratio is established to be 10^4.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
12 pages, 1 table, accepted at International Workshop on AI for Quantum and Quantum for AI (AIQxQIA 2026), co-located with AIxIA 2026, Perugia, Italy

Related papers

Optimizing resource bounds in direct fidelity estimation

Netanel Barel, Lee Peleg, Yotam Kadish +2 more

Direct fidelity estimation provides a way to estimate the fidelity between an experimentally prepared state and a desired pure target state without performing full tomography. Two influential formulations were introduced in 2011 by Flammia and Liu and by da Silva, Landon-Cardinal, and Poulin. In these protocols, the total estimation error is controlled through two distinct probabilistic steps: first, the fidelity is approximated using randomly sampled Pauli observables; second, each sampled expectation value is estimated from finitely many measurement outcomes. In this work we show that additional structural information about the noise can substantially sharpen the corresponding resource bounds. In particular, for some canonical channels the effective number of sampled Pauli settings can be reduced, leading to lower measurement cost both in the general pure-state setting and in the case of a stabilizer state. These results illustrate a broader point: worst-case confidence bounds in direct fidelity estimation can be significantly conservative when experimentally relevant structure is ignored. As a technical ingredient, we also revisit the allocation of the total accuracy and confidence budgets between the two probabilistic steps. Reformulating the analysis in terms of separate error parameters yields a constrained optimization problem whose solution lowers the average number of measurements in the general pure-state setting. Numerical simulations based on quantum circuits implemented in Qiskit illustrate both the improvement obtained under structured-noise assumptions and the conservativeness of the original worst-case bounds.

quant-pharXiv:2606.16336•Jun 16, 2026•0 citations

Sparse Phase Ansatzes for Resource-Efficient Qudit State Preparation via the SNAP-Displacement Protocol

Maurizio Ferrari Dacrema, Doga Murat Kurkcuoglu, Andy C. Y. Li +2 more

Efficient preparation of nonclassical bosonic states is a central requirement for quantum computing, simulation, and precision metrology. We study resource-efficient quantum state preparation in bosonic qudit systems using the SNAP-displacement (SD) protocol. Existing SD-based approaches typically require a large number of gates and SNAP phases, resulting in complex control pulses with longer ansatz durations and amplified impact of photon-loss and control errors. In this work, we focus on the near- to medium-term regime, in which noisy quantum devices impose trade-offs on the fidelity that can be achieved, which must be taken into account. Specifically, we propose to optimize only a subset of the SNAP phases and introduce three progressively more general sparse ansatzes. To provide fine-grained control and identify the most suitable ansatz for a given target fidelity, we further employ a scalarized multi-objective optimization that trades off fidelity against either the number of phases or the duration of the ansatz. Numerical results for several target states and qudit dimensions up to $d=64$, evaluated through the hypervolume of the Pareto frontiers, show that these sparse ansatzes achieve favorable trade-offs over the fully parameterized SD protocol in both ideal and noisy settings. The advantage is strongest and most consistent when minimizing the number of phases, while improvements in ansatz duration are smaller and more dependent on the target-state family and noise level, suggesting a practical route to more efficient near- and medium-term bosonic state preparation.

quant-pharXiv:2603.12203•Mar 13, 2026•2 citations

Machine Learning Meets Quantum State Preparation. The Phase Diagram of Quantum Control

Marin Bukov, Alexandre G. R. Day, Dries Sels +3 more

The ability to prepare a physical system in a desired quantum state is central to many areas of physics such as nuclear magnetic resonance, cold atoms, and quantum computing. Yet, preparing states quickly and with high fidelity remains a formidable challenge. In this work we implement cutting-edge Reinforcement Learning (RL) techniques and show that their performance is comparable to optimal control methods in the task of finding short, high-fidelity driving protocol from an initial to a target state in non-integrable many-body quantum systems of interacting qubits. RL methods learn about the underlying physical system solely through a single scalar reward (the fidelity of the resulting state) calculated from numerical simulations of the physical system. We further show that quantum state manipulation, viewed as an optimization problem, exhibits a spin-glass-like phase transition in the space of protocols as a function of the protocol duration. Our RL-aided approach helps identify variational protocols with nearly optimal fidelity, even in the glassy phase, where optimal state manipulation is exponentially hard. This study highlights the potential usefulness of RL for applications in out-of-equilibrium quantum physics.

•May 1, 2017•5 citations

A Quantum States Preparation Method Based on Difference-Driven Reinforcement Learning

Wenjie Liu, Jing Xu, Bosi Wang

Due to the large state space of the two-qubit system, and the adoption of ladder reward function in the existing quantum state preparation methods, the convergence speed is slow and it is difficult to prepare the desired target quantum state with high fidelity under limited conditions. To solve the above problems, a difference-driven reinforcement learning (RL) algorithm for quantum state preparation of two-qubit system is proposed by improving the reward function and action selection strategy. Firstly, a model is constructed for the problem of preparing quantum states of a two-qubit system, with restrictions on the type of quantum gates and the time for quantum state evolution. In the preparation process, a weighted differential dynamic reward function is designed to assist the algorithm quickly obtain the maximum expected cumulative reward. Then, an adaptive [Formula: see text]-greedy action selection strategy is adopted to achieve a balance between exploration and utilization to a certain extent, thereby improving the fidelity of the final quantum state. The simulation results show that the proposed algorithm can prepare quantum state with high fidelity under limited conditions. Compared with other algorithms, it has different degrees of improvement in convergence speed and fidelity of the final quantum state.

arXiv:2309.16972•SPIN•May 19, 2023•5 citations

RobustState: Boosting Fidelity of Quantum State Preparation via Noise-Aware Variational Training

Hanrui Wang, Yilian Liu, Pengyu Liu +10 more

Quantum state preparation, a crucial subroutine in quantum computing, involves generating a target quantum state from initialized qubits. Arbitrary state preparation algorithms can be broadly categorized into arithmetic decomposition (AD) and variational quantum state preparation (VQSP). AD employs a predefined procedure to decompose the target state into a series of gates, whereas VQSP iteratively tunes ansatz parameters to approximate target state. VQSP is particularly apt for Noisy-Intermediate Scale Quantum (NISQ) machines due to its shorter circuits. However, achieving noise-robust parameter optimization still remains challenging. We present RobustState, a novel VQSP training methodology that combines high robustness with high training efficiency. The core idea involves utilizing measurement outcomes from real machines to perform back-propagation through classical simulators, thus incorporating real quantum noise into gradient calculations. RobustState serves as a versatile, plug-and-play technique applicable for training parameters from scratch or fine-tuning existing parameters to enhance fidelity on target machines. It is adaptable to various ansatzes at both gate and pulse levels and can even benefit other variational algorithms, such as variational unitary synthesis. Comprehensive evaluation of RobustState on state preparation tasks for 4 distinct quantum algorithms using 10 real quantum machines demonstrates a coherent error reduction of up to 7.1 $\times$ and state fidelity improvement of up to 96\% and 81\% for 4-Q and 5-Q states, respectively. On average, RobustState improves fidelity by 50\% and 72\% for 4-Q and 5-Q states compared to baseline approaches.

arXiv:2311.16035•Nov 27, 2023•12 citations

Derivation and experimental test of fidelity benchmarks for remote preparation of arbitrary qubit states

Nathan Killoran, Devon N. Biggerstaff, Rainer Kaltenbaek +2 more

Remote state preparation (RSP) is the act of preparing a quantum state at a remote location without actually transmitting the state itself. Using at most two classical bits and a single shared maximally entangled state, one can in theory remotely prepare any qubit state with certainty and with perfect fidelity. However, in any experimental implementation the average fidelity between the target and output states cannot be perfect. In order for an RSP experiment to demonstrate genuine quantum advantages, it must surpass the optimal threshold of a comparable classical protocol. Here we study the fidelity achievable by RSP protocols lacking shared entanglement and determine the optimal value for the average fidelity in several different cases. We implement an experimental scheme for deterministic remote preparation of arbitrary photon polarization qubits, preparing $178$ different pure and mixed qubit states with an average fidelity of $0.995$. Our experimentally achieved average fidelities surpass our derived classical thresholds whenever the classical protocol does not trivially allow for perfect RSP.

arXiv:0909.5461•Physical Review A•Jan 29, 2010•45 citations
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.
Standard noisy-state preparation maximizes average fidelity, but does not directly control the fidelity distribution across noise trajectories. This paper asks whether risk-seeking optimization can favor high-fidelity trajectories at the expense of ensemble-average performance, using bosonic SNAP–displacement state preparation.
Two objectives apply entropic risk to trajectory fidelity FFF or negative log-infidelity −log⁡(1−F)-\log(1-F)−log(1−F), with a positive risk coefficient β\betaβ controlling the emphasis on favorable outcomes. Optimization uses Monte Carlo photon-counting trajectories and stochastic-computation-graph gradients that account for parameter-dependent trajectory probabilities. Classical simulations consider one eight-level qudit, 64 additional leakage-buffer levels, four SNAP–displacement blocks, cavity lifetime T1=1 msT_1=1\,\mathrm{ms}T1​=1ms, and a Haar-random target. Each setting uses 100 optimization runs of 30,000 steps, with ten trajectories per step and 10,000 evaluation trajectories per run.
Average-fidelity optimization achieves mean fidelity 0.8240.8240.824, but reaches no trajectory-infidelity threshold below 10−210^{-2}10−2. Risk-seeking objectives reach 10−610^{-6}10−6, a four-order-of-magnitude reduction in the lowest threshold reached. At this threshold, log-infidelity risk with β=1\beta=1β=1 succeeds in 12% of optimization runs; successful runs produce qualifying trajectories with mean probability 0.6800.6800.680, while mean ensemble fidelity across all runs is 0.7480.7480.748.
Reported trajectory probabilities are conditional on successful optimization. Practical use requires suitable measurement or heralding to associate trajectories with outcomes. The logarithmic objective introduces finite-sample gradient bias. Generalization across targets, dimensions, circuit depths, and noise models remains untested; saturation and conditional-probability trends require further investigation.
Direct fidelity estimation provides a way to estimate the fidelity between an experimentally prepared state and a desired pure target state without performing full tomography. Two influential formulations were introduced in 2011 by Flammia and Liu and by da Silva, Landon-Cardinal, and Poulin. In these protocols, the total estimation error is controlled through two distinct probabilistic steps: first, the fidelity is approximated using randomly sampled Pauli observables; second, each sampled expectation value is estimated from finitely many measurement outcomes. In this work we show that additional structural information about the noise can substantially sharpen the corresponding resource bounds. In particular, for some canonical channels the effective number of sampled Pauli settings can be reduced, leading to lower measurement cost both in the general pure-state setting and in the case of a stabilizer state. These results illustrate a broader point: worst-case confidence bounds in direct fidelity estimation can be significantly conservative when experimentally relevant structure is ignored. As a technical ingredient, we also revisit the allocation of the total accuracy and confidence budgets between the two probabilistic steps. Reformulating the analysis in terms of separate error parameters yields a constrained optimization problem whose solution lowers the average number of measurements in the general pure-state setting. Numerical simulations based on quantum circuits implemented in Qiskit illustrate both the improvement obtained under structured-noise assumptions and the conservativeness of the original worst-case bounds.
Efficient preparation of nonclassical bosonic states is a central requirement for quantum computing, simulation, and precision metrology. We study resource-efficient quantum state preparation in bosonic qudit systems using the SNAP-displacement (SD) protocol. Existing SD-based approaches typically require a large number of gates and SNAP phases, resulting in complex control pulses with longer ansatz durations and amplified impact of photon-loss and control errors. In this work, we focus on the near- to medium-term regime, in which noisy quantum devices impose trade-offs on the fidelity that can be achieved, which must be taken into account. Specifically, we propose to optimize only a subset of the SNAP phases and introduce three progressively more general sparse ansatzes. To provide fine-grained control and identify the most suitable ansatz for a given target fidelity, we further employ a scalarized multi-objective optimization that trades off fidelity against either the number of phases or the duration of the ansatz. Numerical results for several target states and qudit dimensions up to d=64d=64d=64, evaluated through the hypervolume of the Pareto frontiers, show that these sparse ansatzes achieve favorable trade-offs over the fully parameterized SD protocol in both ideal and noisy settings. The advantage is strongest and most consistent when minimizing the number of phases, while improvements in ansatz duration are smaller and more dependent on the target-state family and noise level, suggesting a practical route to more efficient near- and medium-term bosonic state preparation.
The ability to prepare a physical system in a desired quantum state is central to many areas of physics such as nuclear magnetic resonance, cold atoms, and quantum computing. Yet, preparing states quickly and with high fidelity remains a formidable challenge. In this work we implement cutting-edge Reinforcement Learning (RL) techniques and show that their performance is comparable to optimal control methods in the task of finding short, high-fidelity driving protocol from an initial to a target state in non-integrable many-body quantum systems of interacting qubits. RL methods learn about the underlying physical system solely through a single scalar reward (the fidelity of the resulting state) calculated from numerical simulations of the physical system. We further show that quantum state manipulation, viewed as an optimization problem, exhibits a spin-glass-like phase transition in the space of protocols as a function of the protocol duration. Our RL-aided approach helps identify variational protocols with nearly optimal fidelity, even in the glassy phase, where optimal state manipulation is exponentially hard. This study highlights the potential usefulness of RL for applications in out-of-equilibrium quantum physics.
Due to the large state space of the two-qubit system, and the adoption of ladder reward function in the existing quantum state preparation methods, the convergence speed is slow and it is difficult to prepare the desired target quantum state with high fidelity under limited conditions. To solve the above problems, a difference-driven reinforcement learning (RL) algorithm for quantum state preparation of two-qubit system is proposed by improving the reward function and action selection strategy. Firstly, a model is constructed for the problem of preparing quantum states of a two-qubit system, with restrictions on the type of quantum gates and the time for quantum state evolution. In the preparation process, a weighted differential dynamic reward function is designed to assist the algorithm quickly obtain the maximum expected cumulative reward. Then, an adaptive [Formula: see text]-greedy action selection strategy is adopted to achieve a balance between exploration and utilization to a certain extent, thereby improving the fidelity of the final quantum state. The simulation results show that the proposed algorithm can prepare quantum state with high fidelity under limited conditions. Compared with other algorithms, it has different degrees of improvement in convergence speed and fidelity of the final quantum state.
Quantum state preparation, a crucial subroutine in quantum computing, involves generating a target quantum state from initialized qubits. Arbitrary state preparation algorithms can be broadly categorized into arithmetic decomposition (AD) and variational quantum state preparation (VQSP). AD employs a predefined procedure to decompose the target state into a series of gates, whereas VQSP iteratively tunes ansatz parameters to approximate target state. VQSP is particularly apt for Noisy-Intermediate Scale Quantum (NISQ) machines due to its shorter circuits. However, achieving noise-robust parameter optimization still remains challenging. We present RobustState, a novel VQSP training methodology that combines high robustness with high training efficiency. The core idea involves utilizing measurement outcomes from real machines to perform back-propagation through classical simulators, thus incorporating real quantum noise into gradient calculations. RobustState serves as a versatile, plug-and-play technique applicable for training parameters from scratch or fine-tuning existing parameters to enhance fidelity on target machines. It is adaptable to various ansatzes at both gate and pulse levels and can even benefit other variational algorithms, such as variational unitary synthesis. Comprehensive evaluation of RobustState on state preparation tasks for 4 distinct quantum algorithms using 10 real quantum machines demonstrates a coherent error reduction of up to 7.1 ×\times× and state fidelity improvement of up to 96\% and 81\% for 4-Q and 5-Q states, respectively. On average, RobustState improves fidelity by 50\% and 72\% for 4-Q and 5-Q states compared to baseline approaches.
Remote state preparation (RSP) is the act of preparing a quantum state at a remote location without actually transmitting the state itself. Using at most two classical bits and a single shared maximally entangled state, one can in theory remotely prepare any qubit state with certainty and with perfect fidelity. However, in any experimental implementation the average fidelity between the target and output states cannot be perfect. In order for an RSP experiment to demonstrate genuine quantum advantages, it must surpass the optimal threshold of a comparable classical protocol. Here we study the fidelity achievable by RSP protocols lacking shared entanglement and determine the optimal value for the average fidelity in several different cases. We implement an experimental scheme for deterministic remote preparation of arbitrary photon polarization qubits, preparing 178178178 different pure and mixed qubit states with an average fidelity of 0.9950.9950.995. Our experimentally achieved average fidelities surpass our derived classical thresholds whenever the classical protocol does not trivially allow for perfect RSP.