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

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.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24250500
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

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

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

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

Carles Marín Muñoz
preprint en
1 citations

Abstract

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.

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