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

A Closed-Form Excess-Population Latency Budget for Active Reset of Superconducting Qubits

Kuzey Kaya

Published Oct 10, 2026• 0 citations
Publisher

Abstract

Active reset returns a superconducting qubit to its ground state: read it out, apply a π-pulse if it reads excited. The classical decision between the two takes time, and the qubit relaxes meanwhile. Salathé and co-workers tied this cost to the ratio of feedback latency to lifetime and expected the error to scale as one minus its exponential, and Ristè and co-workers had already written the reset error to first order as readout errors plus equilibration terms linear in the latency. This work makes that accounting exact at a fixed evaluation time. A transmon with T₁ = 50 μs is prepared in its excited state and read out by an ideal terminal projection followed by a classical confusion channel with symmetric assignment error P_AE. Under that instrument the ensemble-averaged residual population after one feedback cycle is an exact weighted sum of four deterministic Lindblad evolutions, conditioned on the projected and the reported outcome. The sum is evaluated in closed form, together with the critical latency τ_crit at which the residual exceeds its zero-latency value by a chosen budget, defined throughout as an absolute increase in excitation probability of 0.01, that is one percentage point. To leading order τ_crit is the budget times T₁ divided by the pulse-firing probability p_pulse, times a prefactor of 1.019 for the parameters considered here. Discarding that prefactor while retaining the division by p_pulse costs under 2%; the further simplification to budget times T₁ carries 3.4% to 7.3% error across P_AE = 1% to 5%. Because P_AE enters only through p_pulse, the budget is weakly sensitive to assignment error over the tested range for an initially excited qubit, giving 518 to 539 ns; the readout duration enters separately, through the observation window and the post-readout population. A critical latency exists only for budgets below the maximum excess attainable within that window. The four-branch representation is exact for the stated measurement model; the finite-pulse map used to evaluate it is approximate, and is replaced here by its exact affine propagator. The closed form agrees with a master-equation solver to 3.3×10⁻⁷ and is cross-checked against stochastic trajectories.

DOI
10.5281/zenodo.23280764

Related papers

Low-leakage superconducting-qubit measurement with sub-100-ns total duration

Peter A. Spring, Adrian L. Hesse, Shiyu Wang +2 more

Fast, accurate, and low-leakage qubit measurement is a key requirement for quantum error correction. Here, we demonstrate measurement of a superconducting transmon qubit with a total duration of 97(1) ns, defined as the time from the start of the measurement pulse until the measurement-induced error on a subsequent $π$-pulse operation falls below $10^{-4}$. By combining a large state-averaged resonator decay rate of $κ_\mathrm{eff}/2π$ = 30.8 MHz with a dispersive shift close to the optimal SNR-per-photon condition, we achieve an assignment error of 0.17(1)% using a 58-ns measurement pulse, with residual readout photons depleting passively in tens of nanoseconds without an active depletion pulse. Using a repeated-measurement sequence together with a leakage-sensitive measurement, we benchmark the measurement-induced state transitions, finding a per-measurement leakage rate of $2.7(2) \times 10^{-5}$, only twice the background rate and two orders of magnitude below the measurement-induced relaxation rate, which dominates the assignment error. Floquet simulations indicate that the multiphoton resonances present at the operating point are weakly coupled and traversed diabatically, without causing leakage. These results demonstrate that a large resonator decay rate, combined with a dispersive shift close to the optimal SNR-per-photon condition, can enable fast, high-fidelity, low-leakage dispersive readout at small qubit-resonator detuning.

quant-pharXiv:2608.25484•Aug 27, 2026•1 citation

Research on FPGA-Based Electronic System for Active Reset of Superconducting Qubits

Yaping Lü, Yifei Chen, Maojie Ma +1 more

Active reset of qubits is a critical step toward realizing large-scale quantum error correction(QEC) algorithms, as it enables rapid initialization of qubits to the ground state and enhances the accuracy of quantum computing. In this paper, we address the issues of existing active reset schemes that require faster feedback speeds, higher flexibility, and integration in multichannel operations. We propose a highly scalable, integrated, low-latency feedback closed-loop measurement and control system that supports local decision-making and independent judgment. The system achieves precise timing control, parameterized waveform generation, high-fidelity demodulation and decision-making computations, and rapid closed-loop feedback links. Experimental results show that the total latency of the closed-loop feedback is 243 ns, and the active reset test success rate reaches 99.5%, representing significant improvements in both efficiency and precision compared to traditional passive reset methods. Through modular design, the system supports multi-board expansion and can be adapted for concurrent reset control of large-scale qubit chips.

IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)•Aug 8, 2025•0 citations

Time-Integrated Leakage as a Dynamical Benchmark for Multi-Mode Superconducting-Qubit Reset

Sushant Sharma, Aswath Babu H

Reset performance in superconducting qubits is often summarized by the population that remains at the end of the pulse. This is an important number, but it does not describe what happens during the reset itself. A protocol may reach a small final residual while keeping the qubit in a leakage state for a comparatively long part of the trajectory. In this work, we therefore use time-integrated leakage, together with the usual endpoint population, to study a multi-mode dissipative reset model under flux-frequency control. We examine finite thermal occupation, parameter sweeps, frequency disorder, an auxiliary-chain ablation, and a literature-based rate benchmark. At the representative ablation point, adding the auxiliary chain reduces Lf from 8.56 to 0.78 ns and shifts the sustained Pf less-than- 10-2 crossing from 39.5 to 9.8 ns. Interestingly, the configuration without the chain still reaches the smaller long-time residual. The two metrics can therefore favor different reset configurations. For the same 300 ns analysis window, an effective rate model built from the f-ket and e-ket decay rates reported by Zhou et al. gives Lf is 108.0 ns, while the complete simulated configuration gives 0.783 ns. We use this only as a kinetic reference and not as a reproduction of the experiment. In the wider set of simulations, thermal occupation is the main source of degradation, while the frequency disorder considered here has a much weaker effect. The results suggest that time-integrated leakage is a useful quantity to report alongside endpoint residuals, especially when reset is part of repeated quantum-error-correction cycles.

quant-pharXiv:2609.38354•Oct 1, 2026•0 citations

Entanglement diagnostics of stochastic-resetting steady states: theory and measurement on superconducting qubits

Jakob Murauer, Sabine Tornow, Manas Kulkarni +3 more

Stochastic resetting drives quantum systems into nonequilibrium stationary states unreachable under uninterrupted unitary evolution, and their entanglement depends on whether the reset history is resolved or averaged over. We study this interplay in the transverse-field Ising chain, deriving closed-form results for two qubits and evaluating chains of up to 12 qubits exactly. In the two-qubit system, these closed-form results show that phase matching between energy eigenstates produces resonances, and their visibility in the stationary state is determined by the symmetry of the reset state. Measurements on an IBM superconducting processor show the entropies evaluated before and after the reset average closely following noiseless predictions with no fitted parameter, while concurrence lies below prediction across most of the hardware measurements. The two diagnostics respond differently because they read different components of the same reconstructed state, and a depolarizing model captures the concurrence suppression with one fitted parameter. The difference between the two entropies, i. e., the Jensen gap of entanglement entropy, equals the Holevo information that a subsystem retains about the time since the last reset. With a Bell-state reset, this information grows with chain length across a half-chain cut over the sizes studied, without visible saturation at the smaller reset probabilities. Since reset times are sampled and recorded classically, the trajectory-averaged entropy, and with it the Jensen gap, is obtained without postselection, in contrast to monitored circuits, where trajectory-resolved entanglement requires sampling exponentially rare measurement records.

quant-pharXiv:2610.40638•Oct 30, 2026•0 citations

Exact limits on writing a superconducting quantum memory: when can pulse shaping beat the resonant swap?

Carles Marín Muñoz

We study quantum-memory writing implemented by the exchange of one excitation between a short-lived superconducting qubit and a long-lived memory mode, at a coupling rate bounded by G, and ask how small pulse shaping can make the error of that exchange. With relaxation at unequal rates and Markovian dephasing, no pulse transfers more population than the plain resonant swap, and at a prescribed duration none beats a resonant pulse combined with a wait in the less lossy element; the proof is a Lyapunov function, with no condition on G. Without dephasing the maximum has a closed form. For the average infidelity of the write operation this gives a lower bound which the resonant pulse misses by less than 1.5·10-6 for a recent phonon-memory processor and attains for one of its modes: the limits are 1.00–1.14 % per access for its three modes against 1.71 % measured on average. Along a fixed small-rate direction the resonant pulse is exactly optimal whenever four times the smaller coherence decay rate exceeds the total pure dephasing rate, and otherwise the undecided width is of second order. Without relaxation and under strong dephasing the optimum is the trivial value 5/12: for equal rates at and above a unique threshold φ*, with 2.0941221534 < φ*/G < 2.0941221542, and, for fixed-phase, zero-detuning controls with 0 ≤ g ≤ G and |φq − φm| ≥ 2√5 G, exactly when the product of the rates is at least 3G2; between 2G and 2√5 G an explicit product of the rates still suffices. A write–wait–read cycle with a reset of the qubit composes exactly, which gives its floor; without the reset, for cycles that close in the absence of noise and to first order in the rates, the optimum reduces to a scalar minimisation: it never completes the swap when the memory decays or dephases, and accessing the memory pays only when the memory loses less than the qubit, and then only after an explicit waiting time. Five recent devices are evaluated within the model. Slow noise is not Markovian, and a counterexample shows that shaping can then help; for a quasi-static offset we give two bounds, and its first- and second-order theory is the subject of a companion paper. English and Spanish versions, LaTeX sources and the scripts behind the numbers, interval enclosures and certificates are included. The bound without dephasing, the quasi-static square-pulse bound, the Lyapunov step of the population bound for continuous controls (given the derivative identities of the master equation) and the elementary steps of the other proofs are machine-checked in Isabelle/HOL (https://github.com/karlesmarin/formalizations); the companion site https://karlesmarin.github.io/blueprints/memory-floors/ says, for each statement, what is formalised, what is certified by computation and what is a written proof. We worked with an AI assistant.

•Nov 15, 2026•1 citation

Adaptive thresholding for scalable measurement-based qubit reset

Qian Cao, Unnati Akhouri, Samuel Vizvary +3 more

Fast, high-fidelity qubit initialization is a key primitive for scalable quantum information processing, but conventional reset protocols either require long relaxation times or discard information contained in continuous measurement records. We demonstrate an adaptive measurement-based reset protocol for superconducting qubits that uses Bayesian inference to update the qubit-state estimate after each readout and dynamically adjust the feedback threshold. Unlike fixed-threshold or repeat-until-success (RUS) protocols, the method utilizes the full analog measurement history, enabling the reset decision to become progressively more conservative as confidence in ground-state preparation increases. Implemented with real-time FPGA-based feedback on a dispersively readout transmon qubit, the protocol achieves a ground-state initialization fidelity of $99.44\pm0.04\%$ after a small number of reset rounds. We further compare adaptive reset with RUS strategies in multi-qubit experiments and show that adaptive thresholding provides deterministic reset duration while maintaining a five-qubit simultaneous-reset fidelity of $98.78 \pm 0.19\%$. These results establish Bayesian adaptive thresholding as a practical and scalable route to fast qubit reset in superconducting quantum processors.

quant-pharXiv:2609.25208•Sep 23, 2026•0 citations
Active reset returns a superconducting qubit to its ground state: read it out, apply a π-pulse if it reads excited. The classical decision between the two takes time, and the qubit relaxes meanwhile. Salathé and co-workers tied this cost to the ratio of feedback latency to lifetime and expected the error to scale as one minus its exponential, and Ristè and co-workers had already written the reset error to first order as readout errors plus equilibration terms linear in the latency. This work makes that accounting exact at a fixed evaluation time. A transmon with T₁ = 50 μs is prepared in its excited state and read out by an ideal terminal projection followed by a classical confusion channel with symmetric assignment error P_AE. Under that instrument the ensemble-averaged residual population after one feedback cycle is an exact weighted sum of four deterministic Lindblad evolutions, conditioned on the projected and the reported outcome. The sum is evaluated in closed form, together with the critical latency τ_crit at which the residual exceeds its zero-latency value by a chosen budget, defined throughout as an absolute increase in excitation probability of 0.01, that is one percentage point. To leading order τ_crit is the budget times T₁ divided by the pulse-firing probability p_pulse, times a prefactor of 1.019 for the parameters considered here. Discarding that prefactor while retaining the division by p_pulse costs under 2%; the further simplification to budget times T₁ carries 3.4% to 7.3% error across P_AE = 1% to 5%. Because P_AE enters only through p_pulse, the budget is weakly sensitive to assignment error over the tested range for an initially excited qubit, giving 518 to 539 ns; the readout duration enters separately, through the observation window and the post-readout population. A critical latency exists only for budgets below the maximum excess attainable within that window. The four-branch representation is exact for the stated measurement model; the finite-pulse map used to evaluate it is approximate, and is replaced here by its exact affine propagator. The closed form agrees with a master-equation solver to 3.3×10⁻⁷ and is cross-checked against stochastic trajectories.
Fast, accurate, and low-leakage qubit measurement is a key requirement for quantum error correction. Here, we demonstrate measurement of a superconducting transmon qubit with a total duration of 97(1) ns, defined as the time from the start of the measurement pulse until the measurement-induced error on a subsequent πππ-pulse operation falls below 10−410^{-4}10−4. By combining a large state-averaged resonator decay rate of κeff/2πκ_\mathrm{eff}/2πκeff​/2π = 30.8 MHz with a dispersive shift close to the optimal SNR-per-photon condition, we achieve an assignment error of 0.17(1)% using a 58-ns measurement pulse, with residual readout photons depleting passively in tens of nanoseconds without an active depletion pulse. Using a repeated-measurement sequence together with a leakage-sensitive measurement, we benchmark the measurement-induced state transitions, finding a per-measurement leakage rate of 2.7(2)×10−52.7(2) \times 10^{-5}2.7(2)×10−5, only twice the background rate and two orders of magnitude below the measurement-induced relaxation rate, which dominates the assignment error. Floquet simulations indicate that the multiphoton resonances present at the operating point are weakly coupled and traversed diabatically, without causing leakage. These results demonstrate that a large resonator decay rate, combined with a dispersive shift close to the optimal SNR-per-photon condition, can enable fast, high-fidelity, low-leakage dispersive readout at small qubit-resonator detuning.
Active reset of qubits is a critical step toward realizing large-scale quantum error correction(QEC) algorithms, as it enables rapid initialization of qubits to the ground state and enhances the accuracy of quantum computing. In this paper, we address the issues of existing active reset schemes that require faster feedback speeds, higher flexibility, and integration in multichannel operations. We propose a highly scalable, integrated, low-latency feedback closed-loop measurement and control system that supports local decision-making and independent judgment. The system achieves precise timing control, parameterized waveform generation, high-fidelity demodulation and decision-making computations, and rapid closed-loop feedback links. Experimental results show that the total latency of the closed-loop feedback is 243 ns, and the active reset test success rate reaches 99.5%, representing significant improvements in both efficiency and precision compared to traditional passive reset methods. Through modular design, the system supports multi-board expansion and can be adapted for concurrent reset control of large-scale qubit chips.
Reset performance in superconducting qubits is often summarized by the population that remains at the end of the pulse. This is an important number, but it does not describe what happens during the reset itself. A protocol may reach a small final residual while keeping the qubit in a leakage state for a comparatively long part of the trajectory. In this work, we therefore use time-integrated leakage, together with the usual endpoint population, to study a multi-mode dissipative reset model under flux-frequency control. We examine finite thermal occupation, parameter sweeps, frequency disorder, an auxiliary-chain ablation, and a literature-based rate benchmark. At the representative ablation point, adding the auxiliary chain reduces Lf from 8.56 to 0.78 ns and shifts the sustained Pf less-than- 10-2 crossing from 39.5 to 9.8 ns. Interestingly, the configuration without the chain still reaches the smaller long-time residual. The two metrics can therefore favor different reset configurations. For the same 300 ns analysis window, an effective rate model built from the f-ket and e-ket decay rates reported by Zhou et al. gives Lf is 108.0 ns, while the complete simulated configuration gives 0.783 ns. We use this only as a kinetic reference and not as a reproduction of the experiment. In the wider set of simulations, thermal occupation is the main source of degradation, while the frequency disorder considered here has a much weaker effect. The results suggest that time-integrated leakage is a useful quantity to report alongside endpoint residuals, especially when reset is part of repeated quantum-error-correction cycles.
Stochastic resetting drives quantum systems into nonequilibrium stationary states unreachable under uninterrupted unitary evolution, and their entanglement depends on whether the reset history is resolved or averaged over. We study this interplay in the transverse-field Ising chain, deriving closed-form results for two qubits and evaluating chains of up to 12 qubits exactly. In the two-qubit system, these closed-form results show that phase matching between energy eigenstates produces resonances, and their visibility in the stationary state is determined by the symmetry of the reset state. Measurements on an IBM superconducting processor show the entropies evaluated before and after the reset average closely following noiseless predictions with no fitted parameter, while concurrence lies below prediction across most of the hardware measurements. The two diagnostics respond differently because they read different components of the same reconstructed state, and a depolarizing model captures the concurrence suppression with one fitted parameter. The difference between the two entropies, i. e., the Jensen gap of entanglement entropy, equals the Holevo information that a subsystem retains about the time since the last reset. With a Bell-state reset, this information grows with chain length across a half-chain cut over the sizes studied, without visible saturation at the smaller reset probabilities. Since reset times are sampled and recorded classically, the trajectory-averaged entropy, and with it the Jensen gap, is obtained without postselection, in contrast to monitored circuits, where trajectory-resolved entanglement requires sampling exponentially rare measurement records.
We study quantum-memory writing implemented by the exchange of one excitation between a short-lived superconducting qubit and a long-lived memory mode, at a coupling rate bounded by G, and ask how small pulse shaping can make the error of that exchange. With relaxation at unequal rates and Markovian dephasing, no pulse transfers more population than the plain resonant swap, and at a prescribed duration none beats a resonant pulse combined with a wait in the less lossy element; the proof is a Lyapunov function, with no condition on G. Without dephasing the maximum has a closed form. For the average infidelity of the write operation this gives a lower bound which the resonant pulse misses by less than 1.5·10-6 for a recent phonon-memory processor and attains for one of its modes: the limits are 1.00–1.14 % per access for its three modes against 1.71 % measured on average. Along a fixed small-rate direction the resonant pulse is exactly optimal whenever four times the smaller coherence decay rate exceeds the total pure dephasing rate, and otherwise the undecided width is of second order. Without relaxation and under strong dephasing the optimum is the trivial value 5/12: for equal rates at and above a unique threshold φ*, with 2.0941221534 < φ*/G < 2.0941221542, and, for fixed-phase, zero-detuning controls with 0 ≤ g ≤ G and |φq − φm| ≥ 2√5 G, exactly when the product of the rates is at least 3G2; between 2G and 2√5 G an explicit product of the rates still suffices. A write–wait–read cycle with a reset of the qubit composes exactly, which gives its floor; without the reset, for cycles that close in the absence of noise and to first order in the rates, the optimum reduces to a scalar minimisation: it never completes the swap when the memory decays or dephases, and accessing the memory pays only when the memory loses less than the qubit, and then only after an explicit waiting time. Five recent devices are evaluated within the model. Slow noise is not Markovian, and a counterexample shows that shaping can then help; for a quasi-static offset we give two bounds, and its first- and second-order theory is the subject of a companion paper. English and Spanish versions, LaTeX sources and the scripts behind the numbers, interval enclosures and certificates are included. The bound without dephasing, the quasi-static square-pulse bound, the Lyapunov step of the population bound for continuous controls (given the derivative identities of the master equation) and the elementary steps of the other proofs are machine-checked in Isabelle/HOL (https://github.com/karlesmarin/formalizations); the companion site https://karlesmarin.github.io/blueprints/memory-floors/ says, for each statement, what is formalised, what is certified by computation and what is a written proof. We worked with an AI assistant.
Fast, high-fidelity qubit initialization is a key primitive for scalable quantum information processing, but conventional reset protocols either require long relaxation times or discard information contained in continuous measurement records. We demonstrate an adaptive measurement-based reset protocol for superconducting qubits that uses Bayesian inference to update the qubit-state estimate after each readout and dynamically adjust the feedback threshold. Unlike fixed-threshold or repeat-until-success (RUS) protocols, the method utilizes the full analog measurement history, enabling the reset decision to become progressively more conservative as confidence in ground-state preparation increases. Implemented with real-time FPGA-based feedback on a dispersively readout transmon qubit, the protocol achieves a ground-state initialization fidelity of 99.44±0.04%99.44\pm0.04\%99.44±0.04% after a small number of reset rounds. We further compare adaptive reset with RUS strategies in multi-qubit experiments and show that adaptive thresholding provides deterministic reset duration while maintaining a five-qubit simultaneous-reset fidelity of 98.78±0.19%98.78 \pm 0.19\%98.78±0.19%. These results establish Bayesian adaptive thresholding as a practical and scalable route to fast qubit reset in superconducting quantum processors.