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).
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).
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.
The main source of error for superconducting quantum processors today is two-qubit gates, so understanding what limits their fidelity is central to improving these devices. This thesis studies the controlled-Z (CZ) gate between two transmon qubits, realized by tuning the ∣11⟩ and ∣20⟩ states through an avoided crossing with a flux pulse. There are two primary errors inherent to this approach. The first is leakage into non-computational states like ∣20⟩; the second is an exchange error from population transferring between the single-excitation states ∣01⟩ and ∣10⟩. Using a closed-system simulation, this work compares four flux-pulse shapes (unipolar, net-zero bipolar, Gaussian-filtered bipolar, and adiabatic) and constructs a CNOT from each CZ. The central question is which error channel sets the gate fidelity, and whether the widely used net-zero pulse, known to protect neighboring qubits, also helps inside the gate itself. An important finding of this research is that every type of flux pulse has an average gate fidelity limited by exchange error rather than leakage. While the exchange error is not apparent in the return of the ∣11⟩ population, because excitation-number conservation prevents ∣11⟩ from entering the single-excitation sector, it does appear as an off-diagonal term in the CZ unitary, and subsequently in the CNOT. A second finding concerns the net-zero pulse: although its zero net flux integral cancels the first-order phase imprinted on neighboring qubits, it does not suppress the exchange error. The strong suppression observed in the analytic bipolar gate happens because its idle time leaves the exchange oscillation near a cancellation point at the end of the gate, not because the pulse is net-zero. The flux operating point predicted by the simulation was tested on a physical transmon device accessed remotely, where a square pulse produced a 180∘ conditional phase close to the simulated flux and duration. Because the model is closed-system, the reported fidelities describe the coherent error of each pulse rather than the total infidelity of a physical device.
Sending quantum information over long distances is ultimately limited by photon loss. The rate limit of a lossy bosonic channel of transmissivity η is the two-way assisted capacity -log2(1-η) (the PLOB bound), whose achievability rests on unlimited classical feedback: without feedback the quantum capacity vanishes for all η ≤ 1/2, so classical back-communication acts as an on/off switch for quantum communication. Classical bits are priced for entanglement transformations and, for a fixed bipartite state, the one-way distillation trade-off between classical rate and ebit yield has a regularized entropic characterization; but no framework prices the feedback that assists a channel's quantum capacity — feedback that may steer subsequent channel inputs — and no such trade-off has been evaluated for any bosonic channel. Here we show that quantum communication can be metered in classical bits. Writing C(η,B) for the capacity of the pure-loss channel under a feedback budget of B classical bits per channel use, we construct the first achievable-rate frontier C_{ach}(η,B) ≤ C(η,B) and prove the onset law C_{ach}(η,B) ≥ ηlog2(m_B)/m_B, m_B = ⌈ H_2(η)/B⌉, valid for every B>0 with envelope (η/H_2(η)) Blog2(H_2(η)/B) as B → 0 — an exact identity R = η Blog2(1/B) under fixed-length accounting, so the Blog(1/B) order is accounting-convention invariant. The B=0 switch thereby resolves, at the level of achievable rates, into a continuous but non-analytic onset: even for η ≤ 1/2 any positive budget buys a positive quantum rate, each bit unlocking ~log2(1/B) ebits at small budgets and refuting the naive pricing C ≤ Q + B. At large budgets a metered quantum-state-merging family, consuming backward one-way classical communication only, achieves C_{ach}(η,B) ≥ PLOB - [eη^2/(2ln 2)] 2^{-B}(1+o(1)): each backward bit per use halves the achievable distance to PLOB, which exposes the 73.6% plateau of the purification families as a family artifact. Standard entanglement-measure converses are provably blind to B, so what remains open is only strict saturation at finite B, now confined to an exponentially small window. The frontier is also a design tool: on a network of lossy links, the joint allocation of per-link feedback budgets and photon directions under per-site classical budgets is a convex program, and on a 20-site fibre network its optimum doubles the end-to-end entanglement rate relative to a fixed orientation. An appendix extends the frontier to multimode loss, where Grassmann-quantized beamforming controls the PLOB loss at rate 2^{-B/(M-1)}. Preprint (companion paper: Conservation laws for the classical communication cost of one-way entanglement distillation, with entropic converse bounds for the pure-loss channel). Ancillary files: reproduction scripts and data; code maintained at https://github.com/deeptell-inc/fmplob.
This note applies a single first-order source-loss balance, C dθ/dt = A − ρθ, to systems across many scales — from a planetary surface to a qubit register — and reports, with exact numbers, where the balance reproduces measured values and where it does not. The central quantitative result concerns quantum error correction. Using published surface-code and trapped-ion data (Google Quantum AI, Nature 638, 920 (2024); Quantinuum Helios colour-code results, 2026), the note shows that the logical error per cycle falls by a constant factor Λ only while errors are independent. Correlated bursts act as a common loss channel whose rate does not fall with code distance; the quoted floor is about 3×10⁻¹⁰ per cycle, reached at distance about 46 for Λ = 2.17. For factoring a 2048-bit integer (about 1.4×10³ logical qubits, 6.5×10⁹ Toffoli gates, 4.96 days at a 1 μs cycle), the permitted logical error is 1.7×10⁻¹⁵ per qubit per cycle. At measured suppression factors this requires code distances of about 78 (Λ = 2.17) or about 24 (Λ = 12), while the published design uses 25 — and the correlated-error floor is not removed by increasing distance. This is a quantitative statement about where the scaling of error suppression stops matching the requirements of large computations, not a claim that small-scale quantum devices cannot work. The note also lists, separately and with exact values, the tests the balance fails: quark mass-step prediction (T6), gas/solid classification (T8, p = 0.81), nuclear count with A = 3, 4, prediction SP1 (−11.8% against a 10% threshold), coupling versus number of doors (T10, p = 0.015), width-to-cosmological-scale mapping (q₀ = −0.528 ± 0.011 against 0), human loss-rate estimates (11.1 and 15.3 W/K), critical Q₁₀ = 3.03 against measured 2.0–2.3, Higgs width from the b-quark exit alone (13.7% residual), shell boundaries (13 of 18), and several time constants. Of nine tests where the balance gives a value different from the standard one, one agreed with measurement and eight did not; the rules and thresholds were written before the data were examined. Successful checks include: photosynthesis stage efficiencies (0.487 × 0.094 = 0.0458 against 0.046 reported), a three-stage 2.45 GHz rectenna chain (0.906³ = 0.744), closure of the lunar surface energy budget to a ratio of 1.005, mode quality factors Q = m/Γ for the τ lepton (7.84×10¹¹), the Z boson (36.5) and the Higgs boson (3.38×10⁴), the Higgs lifetime from its width (290.87 fs against 290.3 ± 0.5 fs, a consistency check of standard formulas), and the proton-decay bound ρ < 1.3×10⁻⁴² s⁻¹. The complete theory, tests, scripts and the list of open items are maintained at https://zenodo.org/records/23812417. This note is a standalone publication; readers are invited to report measured values that disagree.
High-fidelity control of superconducting qubits requires carefully shaped microwave pulses to avoid several different kinds of error at once. This article is a pedagogical bridging text aimed at upper-level undergraduate and early graduate students who have completed an introductory quantum mechanics course and a first course in quantum computing or quantum information, but who have not yet encountered the physical implementation of qubit gates. We integrate physical intuition for pulse design, analytical gate-level descriptions, and practical hardware considerations into a single, derivation-driven narrative, with explicit learning objectives. We begin with simple pulse envelopes and their spectral properties, showing how finite bandwidth produces leakage outside the computational subspace. This motivates the derivative removal by adiabatic gate (DRAG) technique, which we derive explicitly using the Magnus expansion, obtaining a clear, order-by-order account of which physical error channel appears at which order and why DRAG's cancellation is necessarily incomplete. We discuss the practical hardware realities of control pulse generation, focusing on arbitrary waveform generators (AWG), local oscillators (LO), and IQ mixing. Finally, we extend the discussion to two-qubit operation via the cross-resonance gate, and interpret how driving the control qubit at the target qubit's transition frequency necessarily produces several unwanted interaction terms alongside the desired one, and how successive generations of pulse-engineering strategies have been designed to suppress them.