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.
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.
A quasi-static offset of the qubit or memory frequency, the slowest part of the noise in a superconducting quantum memory, is described by no Markovian rate. For the exchange of one excitation between a qubit and a memory mode at a coupling bounded by G, we characterise every complete transfer by the times A and B it spends in the qubit and in the memory and by its first-order leakage ζ. For a coupling of any phase and any detuning the duration obeys T ≥ T0 + arccos(|ζ|/z0)/G for |ζ| ≤ z0 and the exposures obey (|ζ| − z0)2 ≤ (A − A0)(B − A0), with T0 = π/(2G), A0 = π/(4G), z0 = 1/(2G); both are sharp, and for a coupling of fixed phase and no detuning they follow from known results on paths of bounded curvature. Cancelling the leakage with a pulse of fixed phase and no detuning costs exactly (γq + γm)/(2G)·arccos(|γq − γm|/(γq + γm)) of first-order population loss above that of the square pulse (a third of it in average infidelity), through the shortest Dubins U-turn; for any pulse, with relaxation only, cancelling it costs at least max(√(γqγm), (π/2) min(γq, γm))/G in the same units. At second order in the offsets every pulse has error [2E(ξq − ξm)2|ζ|2 + E(ξqA + ξmB)2]/6: with noise on the qubit no pulse goes below π2σ2/(96G2), against (8 + π2)σ2/(96G2) for the square pulse; with noise on both elements the square pulse is optimal for 0.137 ≤ σm2/σq2 ≤ 7.30 and explicit shaped pulses beat it outside (0.1264, 7.91), certified by interval arithmetic; for pulses of fixed phase and no detuning, a planar exposure bound derived from the reachable set of the Dubins car gives the exact threshold ratio 0.12645352248541…, the crossing of the bang–bang family. With memory loss the square pulse stops being optimal (for fixed phase and no detuning exactly at σ2 = 7.9078851606875… γmG), and for large σ2/(γmG) a pulse that waits in the memory attains the optimal error to leading order. Positively correlated offsets favour the square pulse, with an elementary sufficient condition that also covers relaxation of both elements, and the band of optimality of the square pulse can only widen as the correlation grows; for fixed phase and no detuning we certify the exact band with correlated offsets and the exact threshold with qubit relaxation at several parameter values, and prove, given the planar bound, that this threshold grows as 2√r + π/2 + 4/√3 + O(r-1/2) in the ratio r of qubit to memory relaxation. English and Spanish versions, LaTeX sources and the scripts behind the certificates are included. The robustness inequalities, the minimisation of the cost, the unitarity step of the second-order expansion and the algebra of the bounds are machine-checked in Isabelle/HOL (https://github.com/karlesmarin/formalizations); the companion site https://karlesmarin.github.io/blueprints/robust-offset/ says, for each statement, where the formal statement ends and the written proof begins. We worked with an AI assistant.
How small can pulse shaping make the error of quantum state transfer between two qubits, such as superconducting qubits in different modules, through a lossy bus (a resonator, a waveguide or a cable mode)? We give bounds that hold for every control pulse, every duration and any number of bus modes, knowing only the maximal coupling strength G, the qubit loss rate γ and the bus loss rate κ ≥ γ. The population delivered in time T obeys P(T) ≤ e^{−γT}/[1 + (κ−γ)/(G²T)]: going slowly costs qubit loss, going fast costs bus loss, and no pulse escapes both. The end qubits cannot be bypassed either: in the frame where the qubits are lossless, every transfer keeps the excitation in them for an integrated time bounded below by a quantity that tends to π/(2G). As γ/(κ−γ) → 0 and √(γ(κ−γ))/G → 0, the error cannot fall below 2√(2γ(κ−γ))/G (1 − o(1)); this constant was known as the optimum of perturbative and quasi-adiabatic pulse optimisation; here it bounds every control, and an explicit pulse attains it with explicit error terms. Markovian dephasing enters through the same equations with rates 2/T₂; with a different coherence time for each element the bounds give the floor of a real device, and a reciprocity relation makes the direction of transfer irrelevant. For the four links of IBM's meter-scale relay experiment (arXiv:2610.29986), no pulse can bring the error below 6.03–10.05 × 10⁻⁴ (certified with interval arithmetic) if dephasing is Markovian at the measured T₂*, and not below 1.5–1.8 × 10⁻⁴ for any dephasing noise; the measured errors are 11–16 times larger. Doubling the coupling halves the floor; the dephasing of the worse qubit is the next lever; a 26-ns trapezoidal pulse at 18 MHz brings all four links below 10⁻³ within the model. The floor, the occupation lemma, the frontier lemma and the window comparisons are machine-checked in Isabelle/HOL, and every number comes with the script that produces it. Part II of a study whose Part I is «Certified Speed-Limit Diagnostics for Deployed Superconducting Quantum Processors». Companion site (blueprint, with the laboratory «Check your link»): https://karlesmarin.github.io/blueprints/relay-floors/. English and Spanish versions; sources and supplementary package (scripts, data, Isabelle theories, certificates).
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.
The resonator-induced phase gate is a multiqubit controlled-phase gate for fixed-frequency superconducting qubits. Through off-resonant driving of a bus resonator, statically coupled qubits acquire a state-dependent phase. However, photon loss leads to dephasing during the gate, and any residual entanglement between the resonator and qubits after the gate leads to decoherence. Here we consider how to shape the drive pulse to minimize these unwanted effects. First, we review how the gate's entangling and dephasing rates depend on the system parameters and validate closed-form solutions against direct numerical solution of a master equation. Next, we propose spline pulse shapes that reduce residual qubit-bus entanglement, are robust to imprecise knowledge of the resonator shift, and can be shortened by using higher-degree polynomials. Finally, we present a procedure that optimizes over the subspace of pulses that leave the resonator unpopulated. This finds shaped drive pulses that further reduce the gate duration. Assuming realistic parameters, we exhibit shaped pulses that have the potential to realize $\ensuremath{\sim}212$ ns spline pulse gates and $\ensuremath{\sim}120$ ns optimized gates with $\ensuremath{\sim}6\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}4}$ average gate infidelity. These examples do not represent fundamental limits of the gate and, in principle, even shorter gates may be achievable.
How far are deployed quantum gates from the fastest evolution quantum mechanics allows? We answer for pre-Heron IBM processors, mainly Falcon and Eagle, using public, version-pinned calibration snapshots and inequalities whose proofs are machine-checked in Lean 4. Heron snapshots lack a Hamiltonian. For single-qubit gates, with the drive-strength convention fixed by IBM's calibrated π pulses, the X gate lasts a median 11.3 times the two-level speed limit at full drive amplitude (1646 qubits, 41 backends). Most of this gap is a design choice: IBM drives at about a tenth of the anharmonicity, and at that drive its pulses are about 2 times the square-pulse limit. Within each device's full amplitude, optimal control on IBM's model gives gates about 10 times faster than the median. For two-qubit gates (1758 coupled pairs, 43 backends), the known qubit-subspace minimal time of controlled-NOT-class gates under exchange coupling (literature) gives a median ratio 4.22; across the snapshots it rose, not monotonically, from 2.78 (2021) to 4.26 (2025) as gates got longer, coinciding with the change from Falcon to Eagle. With the second level and fast arbitrary local control, the minimal time of a controlled-Z gate with ideal local control lies between 0.287 and 1/3 of the qubit-only exchange time (refined bound, explicit construction); bounded local control reaches 0.35. We also formalize an entangling-time bound in arbitrary local dimension, known for qubits and new only as a machine-checked assembly. Applied to IBM's chip-to-chip state transfer (version 2), the same diagnostic places the transfers at 5.8--7.9 times the single-mode minimal time, whose lower bound is machine-checked in Isabelle, and the coherence error of the fastest protocol four to six times below the measured errors. The contribution is a reproducible diagnostic built on the machine-checked inequalities, with explicit guarantees. Companion site (blueprint): https://karlesmarin.github.io/blueprints/qsl-diagnostics/
Many protocols for quantum computation require a memory element to store qubits. We discuss the speed and accuracy with which quantum states prepared in a superconducting qubit can be stored in and later retrieved from an attached high-Q resonator. The memory fidelity depends on both the qubit-resonator coupling strength and the location of the state on the Bloch sphere. Our results show that a quantum memory demonstration should be possible with existing superconducting qubit designs, which would be an important milestone in solid-state quantum information processing. Although we specifically focus on a large-area, current-biased Josesphson-junction phase qubit coupled to the dilatational mode of a piezoelectric nanoelectromechanical disk resonator, many of our results will apply to other qubit-oscillator models.