Robust qubit–memory transfer against quasi-static frequency noise costs time and exposure: exact bounds from Dubins curves

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.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24250502
Citations
1
Primary Topic
Quantum Information and Cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Robust qubit–memory transfer against quasi-static frequency noise costs time and exposure: exact bounds from Dubins curves

Carles Marín Muñoz
1 citations
Zenodo (CERN European Organization for Nuclear Research)
Quantum Information and Cryptography
preprint

Robust qubit–memory transfer against quasi-static frequency noise costs time and exposure: exact bounds from Dubins curves

Carles Marín Muñoz
preprint en
1 citations

Abstract

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.

Zenodo (CERN European Organization for Nuclear Research)
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon