Preparing quantum states in bosonic qudits with SNAP--Displacement sequences requires both optimizing the gate parameters and deciding which Fock levels should be controlled by each SNAP gate. A fully parameterized ansatz assigns an independent phase to every Fock level in every gate, leading to a number of phases that grows steeply. This constitutes a problem for short to medium term systems as controlling many phases requires complex control pulses which are subject to increased control errors. Previous work reduced this cost by restricting the trainable phases to predefined sparse patterns, such as a diagonal or a grid, which however may not be optimal for a specific target state. In this work, we address this limitation by introducing a method that learns which phases are needed together with their values, using a differentiable mask. A sparsity penalty encourages the removal of unnecessary phases, while temperature annealing gradually turns the masks into binary decisions. We compare the proposed method with fully parameterized and predefined sparse ansatzes on Fourier and Haar-random target states. The evaluation considers both the minimum number of phases required to reach different infidelity thresholds and the overall trade-off between fidelity and phases required, measured through Pareto frontiers and hypervolume. The results show that learning the location of the phases together with their values provides competitive or improved fidelity--resource trade-offs, although the advantage depends on the target state and qudit dimension.
AI Summary
Preparing bosonic qudit states with SNAP–displacement sequences requires choosing both phase values and which Fock levels each SNAP gate controls. This paper studies whether jointly optimizing these choices reduces the number of active SNAP phases relative to fully parameterized and predefined sparse ansatzes.
The method starts from a predefined diagonal-band mask and learns which allowed phases to retain using sigmoid masks, sparsity and entropy penalties, and temperature annealing. Masks are binarized, followed by parameter fine-tuning, greedy phase removal, and compression of empty blocks. Numerical simulations compare Fourier-5 and Haar-random targets at $d=8,16,32$, including additional Fock levels to account for leakage. Evaluation uses phase counts at fixed infidelity thresholds, Pareto frontiers, bootstrap hypervolume estimates, and estimated circuit durations.
For Fourier-5 at $d=32$, the learned ansatz uses 81 versus 152 phases for the best baseline at $I\leq10^{-3}$, and 153 versus 348 at $I\leq10^{-4}$: reductions of approximately 47% and 56%. Restricted hypervolume for $I\leq10^{-3}$ improves at $d=16,32$, whereas the predefined adaptive-diagonal ansatz has the highest mean hypervolume over the full explored range. Haar-random results are mixed, with no phase-count advantage at $d=32$.
The method can only remove phases permitted by its initial mask, and fewer phases do not necessarily shorten execution. Some high-accuracy searches remain incomplete under a four-day budget. Comparisons use different search procedures and 10 learned-method versus 100 baseline initializations. Realistic noise and hardware constraints remain future work.
Little sign of AI-generated textAI use disclosedIncrementalSmall numerics onlyMissing comparison
the authors used GPT-5.6 Sol in order to paraphrase and reword, as well as for grammar and spelling checks.
Error found: The reported improvements cannot be attributed specifically to differentiable masking because the Learnable pipeline also uses greedy phase removal and a different hyperparameter search, without an ablation separating their contributions.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Comments
16 pages, 3 figures, 4 tables, accepted at International Workshop on AI for Quantum and Quantum for AI (AIQxQIA 2026), co-located with AIxIA 2026, Perugia, Italy
Preparing quantum states in bosonic qudits with SNAP--Displacement sequences requires both optimizing the gate parameters and deciding which Fock levels should be controlled by each SNAP gate. A fully parameterized ansatz assigns an independent phase to every Fock level in every gate, leading to a number of phases that grows steeply. This constitutes a problem for short to medium term systems as controlling many phases requires complex control pulses which are subject to increased control errors. Previous work reduced this cost by restricting the trainable phases to predefined sparse patterns, such as a diagonal or a grid, which however may not be optimal for a specific target state. In this work, we address this limitation by introducing a method that learns which phases are needed together with their values, using a differentiable mask. A sparsity penalty encourages the removal of unnecessary phases, while temperature annealing gradually turns the masks into binary decisions. We compare the proposed method with fully parameterized and predefined sparse ansatzes on Fourier and Haar-random target states. The evaluation considers both the minimum number of phases required to reach different infidelity thresholds and the overall trade-off between fidelity and phases required, measured through Pareto frontiers and hypervolume. The results show that learning the location of the phases together with their values provides competitive or improved fidelity--resource trade-offs, although the advantage depends on the target state and qudit dimension.
Preparing bosonic qudit states with SNAP–displacement sequences requires choosing both phase values and which Fock levels each SNAP gate controls. This paper studies whether jointly optimizing these choices reduces the number of active SNAP phases relative to fully parameterized and predefined sparse ansatzes.
The method starts from a predefined diagonal-band mask and learns which allowed phases to retain using sigmoid masks, sparsity and entropy penalties, and temperature annealing. Masks are binarized, followed by parameter fine-tuning, greedy phase removal, and compression of empty blocks. Numerical simulations compare Fourier-5 and Haar-random targets at d=8,16,32, including additional Fock levels to account for leakage. Evaluation uses phase counts at fixed infidelity thresholds, Pareto frontiers, bootstrap hypervolume estimates, and estimated circuit durations.
For Fourier-5 at d=32, the learned ansatz uses 81 versus 152 phases for the best baseline at I≤10−3, and 153 versus 348 at I≤10−4: reductions of approximately 47% and 56%. Restricted hypervolume for I≤10−3 improves at d=16,32, whereas the predefined adaptive-diagonal ansatz has the highest mean hypervolume over the full explored range. Haar-random results are mixed, with no phase-count advantage at d=32.
The method can only remove phases permitted by its initial mask, and fewer phases do not necessarily shorten execution. Some high-accuracy searches remain incomplete under a four-day budget. Comparisons use different search procedures and 10 learned-method versus 100 baseline initializations. Realistic noise and hardware constraints remain future work.
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.
Abstract In this study, we explore the universality of Selective Number-dependent Arbitrary Phase (SNAP) and Displacement gates for quantum control in qudit-based systems. However, optimizing the parameters of these gates poses a challenging task. Our main focus is to investigate the sensitivity of training any of the SNAP parameters in the SNAP-Displacement protocol. We analyze conditions that could potentially lead to the Barren Plateau problem in a qudit system and draw comparisons with multi-qubit systems. The parameterized ansatz we consider consists of blocks, where each block is composed of hardware operations, namely SNAP and Displacement gates [Fösel et al 2020 Efficient cavity control with snap gates arXiv:2004.14256]. Applying Variational Quantum algorithm (VQA) with observable and gate cost functions, we utilize techniques similar to those in [McClean et al 2018 Barren plateaus in quantum neural network training landscapes Nat. Commun. 9 1–6] and [Cerezo et al 2021 Cost function dependent barren plateaus in shallow parametrized quantum circuits. Nat. Commun. 12 1–12] along with the concept of t − design. Through this analysis, we make the following key observations: (a) The trainability of a SNAP-parameter does not exhibit a preference for any particular direction within our cost function landscape, (b) By leveraging the first and second moments properties of Haar measures, we establish new lemmas concerning the expectation of certain polynomial functions, and (c) utilizing these new lemmas, we identify a general condition that indicates an expected trainability advantage in a qudit system when compared to multi-qubit systems.
Current experimental quantum computing devices are limited by noise, mainly originating from entangling gates. If an efficient gate sequence for an operation is unknown, one often employs layered parameterized quantum circuits, especially hardware-efficient ansätze, with fixed entangling layer structures. We demonstrate a reinforcement learning algorithm to improve on these by optimizing the entangling gate sequence in the task of quantum state preparation. This allows us to restrict the required number of CNOT gates while taking the qubit connectivity architecture into account. Recent advancements using reinforcement learning have already demonstrated the power of this technique when optimizing the circuit for a sequence of non-parameterized gates. We extend this approach to parameterized gate sets by incorporating general single-qubit unitaries, thus allowing us to consistently reach higher state preparation fidelities at the same number of CNOT gates compared to a hardware-efficient ansatz.
We present a function which connects the parameter of a previously published short sequence of selective number-dependent arbitrary phase (SNAP) and displacement gates acting on a qudit encoded into the Fock states of a superconducting cavity, Vk(α)=D(α)Rπ(k)D(−2α)Rπ(k)D(α) to the angle of the Givens rotation G(θ) on levels ∣k⟩,∣k+1⟩ that sequence approximates, namely α=Φ(θ)=4k+1θ. Previous publications left the determination of an appropriate α to numerical optimization at compile time. The map Φ gives us the ability to compile directly any d-dimensional unitary into a sequence of SNAP and displacement gates in O(d3) complex floating point operations with low constant prefactor, avoiding the need for numerical optimization. Numerical studies demonstrate that the infidelity of the generated gate sequence Vk per Givens rotation G scales as approximately O(θ6). We find numerically that the error on compiled circuits can be made arbitrarily small by breaking each rotation into mθ/m rotations, with the full d×d unitary infidelity scaling as approximately O(m−4). This represents a significant reduction in the computational effort to compile qudit unitaries either to SNAP and displacement gates or to generate them via direct low-level pulse optimization via optimal control.
Sparse quantum state preparation concerns an n-qubit target state that is a superposition of only d≪2n computational basis states. Existing approaches exploit this sparsity by compressing these d basis states and their amplitudes onto a smaller set of qubits, called the dense register, before expanding the prepared state to the full register. Rather than relying on the permutation-based compression used in prior work, we exploit affine relationships among the binary configurations over the finite field GF(2) to reduce both the non-Clifford gate count and the ancillary qubit count. Invertible affine transformations over GF(2), comprising Gaussian elimination and all-ones-row removal, first reduce the dense register from n to the rank r using only Clifford gates and no ancillary qubits. An optional binary encoding stage then trades additional Toffoli gates and ancillary qubits for further compression to the minimum ⌈log2d⌉ dense qubits needed to represent d distinct configurations. For chemically relevant wavefunctions, such as those obtained from selected configuration interaction calculations, shared electronic excitation patterns produce many of these affine relationships, enabling substantial Clifford-only compression before binary encoding. Across the molecular benchmarks, our method requires the fewest ancillary qubits among the evaluated sparse state preparation methods while maintaining comparable non-Clifford gate counts when using binary encoding.
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.