We study the infinite-dimensional Lindblad generator $L_ε=D[a^2-α^2]+εD[a]$, describing a dissipative cat qubit subject to single-photon loss. For sufficiently large $α$ and sufficiently small $ε>0$, we identify a two-dimensional spectral subspace near zero and establish an upper bound on the slow decay rate that decreases exponentially with $α^2$, uniformly in $ε$. This proves exponential suppression of bit-flip errors.
AI Summary
The paper asks whether exponential bit-flip suppression in a dissipative cat qubit survives beyond finite-order perturbation theory in single-photon loss. It studies the infinite-dimensional generator $\mathcal L_\epsilon=D[a^2-\alpha^2]+\epsilon D[a]$, where $\epsilon=\kappa_1/\kappa_2$. Earlier perturbative calculations give exponentially small first- and second-order contributions, but do not control higher orders at fixed small $\epsilon$ as $\alpha\to\infty$.
For sufficiently large $\alpha$ and $0<\epsilon\leq\epsilon_0$, with thresholds independent of one another, the paper isolates a rank-two spectral subspace near zero in an adapted weighted trace-class space. Its parity-even and parity-odd eigenvectors have eigenvalues $0$ and $-\lambda$, respectively, with the stronger bound derived in the proof $0\leq\lambda\leq C\epsilon\alpha^6\exp[-(\log 2)\alpha^2/4]$. Thus, for every $0<\kappa<(\log 2)/4$, $\lambda\leq C_\kappa\epsilon e^{-\kappa\alpha^2}$. The physical bit-flip rate is $\Gamma_{\mathrm{bf}}=\kappa_2\lambda/2$.
The proof constructs a block-solvable auxiliary generator using the cat-code subspace and its complement, then controls relative perturbations through resolvent estimates. Displacement to either coherent component and an exponential Lyapunov weight give localization estimates for a Fock truncation at $M=\lfloor\alpha^2/2+1\rfloor$. Exponentially small boundary defects bound the generator’s action on localized spectral vectors; parity identifies the stationary and slow modes.
The result concerns this specific noise model in the large-cat, small-loss regime. It supplies an upper bound rather than a matching asymptotic rate, and allows $\lambda=0$; no strict positivity or optimal suppression exponent is established.
No sign of AI-generated text
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
We study the infinite-dimensional Lindblad generator Lε=D[a2−α2]+εD[a], describing a dissipative cat qubit subject to single-photon loss. For sufficiently large α and sufficiently small ε>0, we identify a two-dimensional spectral subspace near zero and establish an upper bound on the slow decay rate that decreases exponentially with α2, uniformly in ε. This proves exponential suppression of bit-flip errors.
The paper asks whether exponential bit-flip suppression in a dissipative cat qubit survives beyond finite-order perturbation theory in single-photon loss. It studies the infinite-dimensional generator Lϵ=D[a2−α2]+ϵD[a], where ϵ=κ1/κ2. Earlier perturbative calculations give exponentially small first- and second-order contributions, but do not control higher orders at fixed small ϵ as α→∞.
For sufficiently large α and 0<ϵ≤ϵ0, with thresholds independent of one another, the paper isolates a rank-two spectral subspace near zero in an adapted weighted trace-class space. Its parity-even and parity-odd eigenvectors have eigenvalues 0 and −λ, respectively, with the stronger bound derived in the proof 0≤λ≤Cϵα6exp[−(log2)α2/4]. Thus, for every 0<κ<(log2)/4, λ≤Cκϵe−κα2. The physical bit-flip rate is Γbf=κ2λ/2.
The proof constructs a block-solvable auxiliary generator using the cat-code subspace and its complement, then controls relative perturbations through resolvent estimates. Displacement to either coherent component and an exponential Lyapunov weight give localization estimates for a Fock truncation at M=⌊α2/2+1⌋. Exponentially small boundary defects bound the generator’s action on localized spectral vectors; parity identifies the stationary and slow modes.
The result concerns this specific noise model in the large-cat, small-loss regime. It supplies an upper bound rather than a matching asymptotic rate, and allows λ=0; no strict positivity or optimal suppression exponent is established.
Dissipative cat qubits are known for the exponential suppression of the bit-flip rate. However, there is significant discrepancy between experimental measurements and analytical predictions of the strength of the bit-flip suppression. In this paper we resolve this discrepancy for some of the perturbations, by developing a second-order perturbation theory on top of a nonlinear dissipative Lindbladian. Following this scheme, we derive an analytical expression for the exponentially small bit-flip rate due to single-photon loss, which shows good agreement with numerical simulations. We also apply our scheme to other perturbations, such as frequency detuning and the Z gate, and find the corresponding bit-flip rates, which also show good agreement with the numerical simulation.
Dissipatively stabilized cat qubits provide a promising route toward fault-tolerant quantum computation, exhibiting exponential suppression of bit-flip errors with increasing phase-space separation of the logical states, while incurring only a linear increase in phase-flip errors. Existing implementations rely on engineered two-photon dissipation via nonlinear coupling to a lossy environment, an approach largely confined to superconducting platforms and limited by spurious decay channels and finite dissipation rates. Here, we propose a fundamentally different stabilization paradigm based on repeated interactions with an auxiliary two-level system mediated by a quadratic Hamiltonian, enabling dissipative stabilization without reservoir engineering. Our approach overcomes key limitations of existing schemes and is compatible with a wider class of experimental platforms. Furthermore, it preserves the noise bias and extends to squeezed cat qubits, rendering single-photon loss errors partially correctable.
Cat qubits, a type of bosonic qubit encoded in a harmonic oscillator, can exhibit an exponential noise bias against bit-flip errors with increasing mean photon number. Here, we focus on cat qubits stabilized by two-photon dissipation, where pairs of photons are added and removed from a harmonic oscillator by an auxiliary, lossy buffer mode. This process requires a large loss rate and strong nonlinearities of the buffer mode that must not degrade the coherence and linearity of the oscillator. In this work, we show how to overcome this challenge by coloring the loss environment of the buffer mode with a multipole filter and optimizing the circuit to take into account additional inductances in the buffer mode. Using these techniques, we achieve near-ideal enhancement of cat-qubit bit-flip times with increasing photon number, reaching over 0.1 s with a mean photon number of only 4. Concurrently, our cat qubit remains highly phase coherent, with phase-flip times corresponding to an effective lifetime of T 1 , eff ≃ 70 μ s , comparable with the bare oscillator lifetime. We achieve this performance even in the presence of an ancilla transmon, used for reading out the cat-qubit states, by engineering a tunable oscillator-ancilla dispersive coupling. Furthermore, the low nonlinearity of the harmonic oscillator mode allows us to perform pulsed cat-qubit stabilization, an important control primitive, where the stabilization can remain off for a significant fraction (e.g., two-thirds) of a 3 μ s cycle without degrading bit-flip times. These advances are important for the realization of scalable error correction with cat qubits, where large noise bias and low phase-flip error rate enable the use of hardware-efficient outer error-correcting codes.
Bosonic cat qubits promise hardware-efficient quantum error correction because their logical bit-flip rate is exponentially suppressed with the photon number of the cat state. However, several experiments report a saturation of this suppression at large photon numbers, thus limiting the achievable protection. Combining quantum-trajectory simulations, semiclassical analysis, and Liouvillian spectral methods, we investigate the properties of bit flips in realistic dissipative cat qubits, where a memory mode hosting quantum information interacts with a dissipative buffer cavity. We show that bit flips are dynamical processes inherently involving both the memory and buffer, and therefore cannot be captured by single-mode approximate descriptions. We identify a reflection symmetry, resulting in a phase-locking condition at the semiclassical level and for quantum trajectories, as the main requirement for regular bit-flip dynamics. Its breakdown is the origin of the saturation, and we find that it occurs when two conditions are met. First, the adiabatic approximation, where the state of the buffer instantaneously follows that of the memory, must not be valid, which typically happens at large photon numbers. Second, key parameters such as the cross-Kerr interaction and dephasing must be present, leading to irregular dynamics in which memory fluctuations are amplified by the buffer during bit flips. In this regime, we find that bit flips manifest as chaotic bursts within otherwise regular dynamics, as evidenced by both changes in the topology of quantum trajectories and in the Liouvillian spectrum and its associated eigenmodes involved in these switching events. Finally, we verify our predictions against experimental data, highlighting the detrimental role of dissipative chaotic behavior in bosonic error-correcting codes.
Quantum error correction becomes more hardware efficient when physical noise is strongly biased towards one error channel. Cat qubits realize such a bias by encoding information in two opposite coherent states of a superconducting oscillator, so that bit flips are exponentially suppressed with photon number while phase-flip rates increase only linearly. In Kerr-cat qubits, a driven double-well potential confines these states and enables fast coherent control, but excitations can induce interwell switching, limiting bit-flip times to milliseconds. Here we show that the nonlinear interaction generating the confinement can also cool these excitations. When an intra-well transition becomes resonant with a lossy readout mode, excitations are transferred out of the qubit and dissipated, as established by spectroscopy and relaxation measurements. We observe the predicted exponential scaling of Kerr-cat bit-flip times with photon number, reaching 450 s, over five orders of magnitude beyond previous demonstrations. Phase-flip rates remain consistent with intrinsic photon loss at operating points with seconds-long bit-flip times. We further demonstrate fast Z gates without measurable degradation of bit-flip protection and single-shot readout with a bit-flip probability below 10−6 per measurement. Autonomous cooling thus brings minutes-long bit-flip protection to Kerr-cat qubits while retaining fast coherent control, without additional cooling drives or circuit elements.
Noise-biased qubits have bit-flip errors that are exponentially suppressed relative to phase-flip errors, and offer a promising route toward fault-tolerant quantum computing. However, this bias can be compromised during gate operations with non-biased control qubits. To address this limitation, we propose a "0-n" Fock qubit architecture that maintains the noise bias by encoding information in the ground state and n-th excited state of a nonlinear multi-level system, such as a transmon. This encoding is achieved via a dissipative stabilization that acts as decay and gain for lower and upper intermediate levels, respectively. We first analytically demonstrate that bit-flip errors are exponentially suppressed with the number of levels. Then, we present a practical implementation using a multi-mode lossy filter to achieve the frequency-selective dissipation. Finally, we numerically demonstrate that bit-flip probabilities approaching 10−8 are achievable for controlled-X gates on cat qubits using the 0-n qubit as an ancilla with n≥9 (i.e. ten or more levels), for realistic experimental parameters. Building on this, we simulate syndrome extraction in a repetition code, achieving logical error rates in the megaquop regime with only a distance of d=9.