Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This paper is a theoretical analysis of error mechanisms in superconducting bosonic quantum error correction. It argues that photons in the code can open an unheralded decay channel in the transmon ancilla used for syndrome readout, which could set a bit-flip floor that grows with cat size and caps noise bias near 10^3. The authors note that current published gate data stop at four photons, so the scaling claim is a prediction that experiments have not yet tested. For quantum hardware readers, it is a concrete constraint on how ancilla choice and readout matching affect scalability.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Photon-stimulated decay of $\chi$-matched ancillas causes unheralded bit flips in bosonic codes

arXiv3 min read

arXiv:2610.17017v1 Announce Type: new Abstract: Bosonic codes often read out their syndrome with a transmon ancilla whose computational levels $g$ and $f$ have equal parity and matched dispersive shifts: a decay $f\to e$ is then heralded and leaves the code intact, while the direct $f\to g$ is forbidden by parity. We show that the photons of the code open this decay at first order in the ancilla's decay rate. Dressing by the code mode lets the charge noise that limits the ancilla's $T_1$ drive a photon-stimulated Raman decay $|f,n\rangle\to|g,n+1\rangle$, at $(n+1)(\chi_{ge}/2g_{01})^2$ times the $f\to e$ rate for a smooth noise spectrum. When the matching is set by the detuning, the decay costs $\approx\Gamma_{fe}/\alpha$ per gate and photon, whatever the coupling strength; a deliberate mismatch or matching by a drive lowers this cost, and a qubit ancilla has no such channel. The opened decay is unheralded and flips a cat with probability $\approx 1/2$; being first order, it overtakes the second-order double decay $f\to e\to g$ as the ancilla improves. In a microscopic model of the Ocelot repetition cat code, it makes the bit-flip floor of the gates grow linearly with the cat size, by a factor 1.2-1.7 from four to ten photons, which would limit the noise bias to $\sim 10^3$. The published gate data end at four photons and do not yet test this growth.

Abstract:Bosonic codes often read out their syndrome with a transmon ancilla whose computational levels $g$ and $f$ have equal parity and matched dispersive shifts: a decay $f\to e$ is then heralded and leaves the code intact, while the direct $f\to g$ is forbidden by parity. We show that the photons of the code open this decay at first order in the ancilla's decay rate. Dressing by the code mode lets the charge noise that limits the ancilla's $T_1$ drive a photon-stimulated Raman decay $|f,n\rangle\to|g,n+1\rangle$, at $(n+1)(\chi_{ge}/2g_{01})^2$ times the $f\to e$ rate for a smooth noise spectrum. When the matching is set by the detuning, the decay costs $\approx\Gamma_{fe}/\alpha$ per gate and photon, whatever the coupling strength; a deliberate mismatch or matching by a drive lowers this cost, and a qubit ancilla has no such channel. The opened decay is unheralded and flips a cat with probability $\approx 1/2$; being first order, it overtakes the second-order double decay $f\to e\to g$ as the ancilla improves. In a microscopic model of the Ocelot repetition cat code, it makes the bit-flip floor of the gates grow linearly with the cat size, by a factor 1.2-1.7 from four to ten photons, which would limit the noise bias to $\sim 10^3$. The published gate data end at four photons and do not yet test this growth.

27 pages, 15 figures. Code and data: this https URL

Quantum Physics (quant-ph); Superconductivity (cond-mat.supr-con)

arXiv:2610.17017 [quant-ph]

(or arXiv:2610.17017v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2610.17017 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 327 words

Related coverage