Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.32943

The wiring sets a phase-blind quantum memory's gap, the weight caps its coherence

Ruini Qian, Zhaobin Lyu, Zelong Yin, Jingjing Hu, Dengfeng Li, Shuoming An

quant-phSubmitted Sep 26, 2026• Announced Sep 29, 2026• 0 citations• Revised Oct 5, 2026 (v2)
v1 · Sep 26, 2026v2 · Oct 5, 2026
arXivHTMLPDF

Abstract

Engineered dissipation corrects errors, yet a memory's phase decays. What the memory's gap measures is not settled. Here we show that when each jump resets one basis state, the wiring can set the gap time while the phase keeps its rate. Under dephasing the gap time spans two orders across wirings; the phase does not. In this class, a contrast on two or more qubits fades faster than a bare qubit at any distance; no such pump power substitutes. The ceiling is two over the qubits the contrast spans. A two-branch pump can escape it at distance three; a two-clock test runs on published data.

AI Summary

The paper asks whether a dissipative quantum memory’s inverse Liouvillian gap measures its logical-coherence lifetime. It studies zero-Hamiltonian dynamics with independent dephasing, amplitude damping, and “phase-blind” reset jumps $L_\alpha=\sqrt{\kappa_\alpha}|\psi_\alpha\rangle\langle e_\alpha|$, whose inputs are individual computational-basis states. For opposite-phase superpositions of two basis codewords differing on $w$ qubits, it proves the all-time distinguishability bound $\|\Delta(t)\|_1\le e^{-wt/T_2}\|\Delta(0)\|_1$, where $T_2^{-1}=2\gamma_\phi+(2T_1)^{-1}$. Consequently, $T_X\le T_2/w$ and $T_X/T_1\le2/w$, independently of reset rates and assignments. The proof uses invariant fixed-XOR coherence sectors and a coefficient-norm contraction argument; parts are machine-checked in Lean 4. A four-qubit $ZZZZ$ plaquette illustrates the distinction between population and coherence modes. At $T_1=200\,\mu\mathrm{s}$, $T_\phi=100\,\mu\mathrm{s}$, and $\kappa=2\,\mathrm{MHz}$, enumerating all $8!$ bijective error-to-code assignments gives inverse gaps from $200$ to $40{,}300\,\mu\mathrm{s}$, while the GHZ coherence lifetime remains exactly $20\,\mu\mathrm{s}$. A closed classical population generator identifies the gap-setting mode. The bound concerns specified computational-basis contrasts, not arbitrary encoded states or recovery schemes. Non-diagonal control, superposition-valued reset inputs, and coherent multi-branch correction lie outside it. Numerical distance-three examples with coherent returns exceed bare-qubit coherence; the five-qubit code reaches $T_X/T_1=2.92$. The paper notes that the largest separations assume idealized dissipators, and that its coherent-correction advantages require gate fidelities above the demonstrated values considered.

Little sign of AI-generated textStrong assumptionsUnclear noveltyOverclaims

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Dephasing-time statistics of disordered Kitaev chains: the Oke scaling relation, noise speed and an optimal wire length

Julius Damilola Balogun

Majorana qubits built from Kitaev chains lose phase coherence when noise shifts the energy splitting δE of their Majorana pair. Real devices differ from one another through frozen, spatially correlated disorder, and they are also exposed to moving disorder (charge noise) whose switching rates span many decades. We ask how the frozen disorder sets the wire-to-wire statistics of the dephasing time T2, how the answer depends on the speed of the noise, and what it implies for the choice between long and short wires. (i) The Oke scaling relation carries over from the splitting to the dephasing time: Var(ln T2) grows by J²K per site for slow noise and 4J²K for fast noise (motional narrowing); in between, T2 ∝ δE^(−α), and for 1/f noise α rises from 1 to 2 as the wire gets longer. (ii) Noise acting on the whole wire dephases the qubit about √N times faster than site-by-site noise of the same strength. (iii) Combining dephasing with quasiparticle-pair creation gives each wire an optimal length N*, whose spread across wires follows std(N*) ≈ ξJ√(KN*). (iv) Confining disorder to part of a wire raises the median T2 by the Jensen gap, independently of where it is placed, but 22–40% of wires end up worse than a clean wire. The results are derived at Δ = t, tested numerically at Δ = 0.6t, for three correlation shapes and at two chemical potentials, and reproduce published limits.

•Nov 11, 2026•0 citations

Tunable non-Markovian and quantum coherence in the single-qubit dephasing noise channel

Nana Zhang, Chao-Yi Wu, Xu Zhou +4 more

Science China Physics Mechanics and Astronomy•Jan 15, 2025•3 citations

Decoherence of quantum information of qubits by stochastic dephasing

Masashi Ban, Sachiko Kitajima, Fumiaki Shibata

Physics Letters A•Oct 5, 2005•26 citations

Demonstration of Logical Error Suppression in a Surface Code Memory on a Cloud-Accessible IBM Superconducting Processor

Shuwen Kan, Aaron Hoyt, Sean Garner +8 more

Quantum error correction can suppress logical errors exponentially with code distance when physical noise is below threshold. Realizing this on hardware requires tight coordination among quantum gates, mid-circuit measurements, and qubit coherence. Device variation, noise asymmetry, and correlations across space and time complicate the translation of these capabilities into logical error suppression. Here, we study rotated surface-code memory on an IBM Nighthawk r2 processor. Performance varies across tested processor placements, which we attribute to differences in qubit quality. We optimize the code by combining short readout, fused measurement and reset, and an XX echo on data qubits during ancilla readout. Compared with standard readout without reset or echo, the optimized syndrome extraction circuit reduces the median per-round logical error rate by factors of 3.8 in the X basis and 1.4 in the Z basis. In memory experiments of up to 150 rounds, the distance advantage weakens, alongside long-lived correlations that may reflect a persistent error component. Under our optimization recipe, increasing the protected distance from 3 to 6 while holding the other distance fixed reduces the per-round logical error rate from 0.53% to 0.24% in Z memory and from 0.52% to 0.22% in X memory. The corresponding error-suppression factors under maximum-likelihood decoding are 1.68 and 1.85. These results connect circuit compilation and optimization to surface-code memory performance and limitations, and motivate QPU and QEC circuit codesign for fault-tolerant quantum computing primitives on current cloud hardware.

quant-pharXiv:2610.23840•Oct 19, 2026•2 citations

Idle Decoherence Within One Syndrome Cycle: Duty-Cycle Arithmetic for Data Qubits Waiting on Measurement

William Alexander Aldred

In every syndrome cycle a data qubit spends most of its time doing nothing, waiting while its neighbouring measure qubits are read out and reset, and nothing is not free: idle decoherence accrues at a rate set by the ratio of waiting time to coherence time. This paper prices the wait. For a superconducting cycle of 1.0 microsecond in which entangling gates occupy a quarter of the schedule, against an energy-relaxation time of 100 microseconds, the idle error per data qubit per cycle is about 7.50e-3, which across the 441 data qubits of a distance-twenty-one patch amounts to an expectation of 3.3 idle error events per cycle, comparable to the entire gate-error contribution the cycle was designed around. The wait is a first-class error source, and the paper budgets the three ways to pay it down: faster cycles, longer coherence, and schedules that keep data qubits usefully busy, including dynamical decoupling, whose own costs are charged.

•Nov 15, 2026•0 citations

Comparative Analysis of Logical Error Rate Scaling in the Three-Qubit Bit-Flip Code and the Distance-3 Surface Code Under Depolarizing Noise: A Simulation Study Using Qiskit Aer and a Validated Stabilizer-Formalism Engine

B U Shanjeev

Quantum error correction (QEC) is a prerequisite for fault-tolerant quantum computation, yet the overhead cost—the number of physical qubits required to encode and protect a single logical qubit—varies substantially across QEC code families. This paper presents a systematic simulation-based comparison of two paradigmatic QEC codes: the three-qubit bit-flip repetition code and the distance-3 surface code. The bit-flip code is simulated by literal Qiskit Aer circuit execution (encoding, injected depolarizing noise, and dynamic classical feed-forward correction). The distance-3 surface code is instead simulated with a custom, vectorized stabilizer-formalism engine, because its 17-qubit noisy circuit would be far more expensive to run shot-by-shot in Aer at the scale needed here. This engine implements the same Aaronson-Gottesman algorithm underlying Aer's stabilizer backend and is cross-validated against genuine Aer circuit execution at a representative operating point; no surface-code result in this paper comes from literal Aer execution. We apply an independent single-qubit depolarizing channel at physical error rates p ∈ [0.001, 0.30] and measure the resulting logical error rate P_L for each code across 200,000 independent trials per data point (95% Wilson confidence intervals reported throughout). We identify the pseudo-threshold p*—the physical error rate at which a code's logical error rate equals the uncorrected physical error rate, and compare simulated crossover points against closed-form analytical predictions. Our results reveal a more nuanced picture than the naive threshold-theorem intuition suggests. The three-qubit bit-flip code cannot correct phase-type errors under any circumstance: under a full quantum-state-protection criterion its logical error rate exceeds the physical error rate for every physically meaningful p, with the two curves crossing only at p ≈ 0.75 deep in the maximally-mixed regime and of no practical relevance. Under the narrower, but operationally standard, "bit-observable" criterion (protection of a definite computational-basis value only), the code is unconditionally beneficial (P_L < p) across the entire tested range, because the 2/3 fraction of depolarizing weight that manifests as a detectable bit-flip is compressed further by majority-vote correction. These two results are not contradictory: they evaluate different protection goals—preservation of a classical bit value versus preservation of an arbitrary quantum state—and every comparison in this paper that mixes the two is labeled accordingly. Under this study's idealized, single-round setup, the distance-3 surface code achieves a simulated finite-size pseudo-threshold of p*_SC ≈ 0.083 (8.3%)—a result specific to noiseless syndrome extraction, a single correction round, and an exact minimum weight decoder, and not a hardware representative or asymptotic threshold. That figure is roughly three orders of magnitude higher than an order-of-magnitude literature extrapolation of ≈ 5.6 × 10⁻⁵ (substituting the asymptotic literature threshold p_th ≈ 0.75% into a power law fit for a different, many-round, measurement noisy regime, not a dedicated prediction for our exact setup); the gap is attributable to precisely those idealizations. The surface code requires 17 physical qubits per logical qubit in our implementation (9 data + 8 ancilla) versus 3 for the bit-flip code, a ≈ 5.7× overhead, quantitatively illustrating the overhead-versus-protection tradeoff fundamental to near-term fault-tolerant architectures. All simulation code is available at https://github.com/shanjeev-b-u/qec-code-comparison-depolarizing-noise

•Jul 26, 2026•0 citations
Engineered dissipation corrects errors, yet a memory's phase decays. What the memory's gap measures is not settled. Here we show that when each jump resets one basis state, the wiring can set the gap time while the phase keeps its rate. Under dephasing the gap time spans two orders across wirings; the phase does not. In this class, a contrast on two or more qubits fades faster than a bare qubit at any distance; no such pump power substitutes. The ceiling is two over the qubits the contrast spans. A two-branch pump can escape it at distance three; a two-clock test runs on published data.
The paper asks whether a dissipative quantum memory’s inverse Liouvillian gap measures its logical-coherence lifetime. It studies zero-Hamiltonian dynamics with independent dephasing, amplitude damping, and “phase-blind” reset jumps Lα=κα∣ψα⟩⟨eα∣L_\alpha=\sqrt{\kappa_\alpha}|\psi_\alpha\rangle\langle e_\alpha|Lα​=κα​​∣ψα​⟩⟨eα​∣, whose inputs are individual computational-basis states.
For opposite-phase superpositions of two basis codewords differing on www qubits, it proves the all-time distinguishability bound ∥Δ(t)∥1≤e−wt/T2∥Δ(0)∥1\|\Delta(t)\|_1\le e^{-wt/T_2}\|\Delta(0)\|_1∥Δ(t)∥1​≤e−wt/T2​∥Δ(0)∥1​, where T2−1=2γϕ+(2T1)−1T_2^{-1}=2\gamma_\phi+(2T_1)^{-1}T2−1​=2γϕ​+(2T1​)−1. Consequently, TX≤T2/wT_X\le T_2/wTX​≤T2​/w and TX/T1≤2/wT_X/T_1\le2/wTX​/T1​≤2/w, independently of reset rates and assignments. The proof uses invariant fixed-XOR coherence sectors and a coefficient-norm contraction argument; parts are machine-checked in Lean 4.
A four-qubit ZZZZZZZZZZZZ plaquette illustrates the distinction between population and coherence modes. At T1=200 μsT_1=200\,\mu\mathrm{s}T1​=200μs, Tϕ=100 μsT_\phi=100\,\mu\mathrm{s}Tϕ​=100μs, and κ=2 MHz\kappa=2\,\mathrm{MHz}κ=2MHz, enumerating all 8!8!8! bijective error-to-code assignments gives inverse gaps from 200200200 to 40,300 μs40{,}300\,\mu\mathrm{s}40,300μs, while the GHZ coherence lifetime remains exactly 20 μs20\,\mu\mathrm{s}20μs. A closed classical population generator identifies the gap-setting mode.
The bound concerns specified computational-basis contrasts, not arbitrary encoded states or recovery schemes. Non-diagonal control, superposition-valued reset inputs, and coherent multi-branch correction lie outside it. Numerical distance-three examples with coherent returns exceed bare-qubit coherence; the five-qubit code reaches TX/T1=2.92T_X/T_1=2.92TX​/T1​=2.92. The paper notes that the largest separations assume idealized dissipators, and that its coherent-correction advantages require gate fidelities above the demonstrated values considered.
Majorana qubits built from Kitaev chains lose phase coherence when noise shifts the energy splitting δE of their Majorana pair. Real devices differ from one another through frozen, spatially correlated disorder, and they are also exposed to moving disorder (charge noise) whose switching rates span many decades. We ask how the frozen disorder sets the wire-to-wire statistics of the dephasing time T2, how the answer depends on the speed of the noise, and what it implies for the choice between long and short wires. (i) The Oke scaling relation carries over from the splitting to the dephasing time: Var(ln T2) grows by J²K per site for slow noise and 4J²K for fast noise (motional narrowing); in between, T2 ∝ δE^(−α), and for 1/f noise α rises from 1 to 2 as the wire gets longer. (ii) Noise acting on the whole wire dephases the qubit about √N times faster than site-by-site noise of the same strength. (iii) Combining dephasing with quasiparticle-pair creation gives each wire an optimal length N*, whose spread across wires follows std(N*) ≈ ξJ√(KN*). (iv) Confining disorder to part of a wire raises the median T2 by the Jensen gap, independently of where it is placed, but 22–40% of wires end up worse than a clean wire. The results are derived at Δ = t, tested numerically at Δ = 0.6t, for three correlation shapes and at two chemical potentials, and reproduce published limits.
Quantum error correction can suppress logical errors exponentially with code distance when physical noise is below threshold. Realizing this on hardware requires tight coordination among quantum gates, mid-circuit measurements, and qubit coherence. Device variation, noise asymmetry, and correlations across space and time complicate the translation of these capabilities into logical error suppression. Here, we study rotated surface-code memory on an IBM Nighthawk r2 processor. Performance varies across tested processor placements, which we attribute to differences in qubit quality. We optimize the code by combining short readout, fused measurement and reset, and an XX echo on data qubits during ancilla readout. Compared with standard readout without reset or echo, the optimized syndrome extraction circuit reduces the median per-round logical error rate by factors of 3.8 in the X basis and 1.4 in the Z basis. In memory experiments of up to 150 rounds, the distance advantage weakens, alongside long-lived correlations that may reflect a persistent error component. Under our optimization recipe, increasing the protected distance from 3 to 6 while holding the other distance fixed reduces the per-round logical error rate from 0.53% to 0.24% in Z memory and from 0.52% to 0.22% in X memory. The corresponding error-suppression factors under maximum-likelihood decoding are 1.68 and 1.85. These results connect circuit compilation and optimization to surface-code memory performance and limitations, and motivate QPU and QEC circuit codesign for fault-tolerant quantum computing primitives on current cloud hardware.
In every syndrome cycle a data qubit spends most of its time doing nothing, waiting while its neighbouring measure qubits are read out and reset, and nothing is not free: idle decoherence accrues at a rate set by the ratio of waiting time to coherence time. This paper prices the wait. For a superconducting cycle of 1.0 microsecond in which entangling gates occupy a quarter of the schedule, against an energy-relaxation time of 100 microseconds, the idle error per data qubit per cycle is about 7.50e-3, which across the 441 data qubits of a distance-twenty-one patch amounts to an expectation of 3.3 idle error events per cycle, comparable to the entire gate-error contribution the cycle was designed around. The wait is a first-class error source, and the paper budgets the three ways to pay it down: faster cycles, longer coherence, and schedules that keep data qubits usefully busy, including dynamical decoupling, whose own costs are charged.
Quantum error correction (QEC) is a prerequisite for fault-tolerant quantum computation, yet the overhead cost—the number of physical qubits required to encode and protect a single logical qubit—varies substantially across QEC code families. This paper presents a systematic simulation-based comparison of two paradigmatic QEC codes: the three-qubit bit-flip repetition code and the distance-3 surface code. The bit-flip code is simulated by literal Qiskit Aer circuit execution (encoding, injected depolarizing noise, and dynamic classical feed-forward correction). The distance-3 surface code is instead simulated with a custom, vectorized stabilizer-formalism engine, because its 17-qubit noisy circuit would be far more expensive to run shot-by-shot in Aer at the scale needed here. This engine implements the same Aaronson-Gottesman algorithm underlying Aer's stabilizer backend and is cross-validated against genuine Aer circuit execution at a representative operating point; no surface-code result in this paper comes from literal Aer execution. We apply an independent single-qubit depolarizing channel at physical error rates p ∈ [0.001, 0.30] and measure the resulting logical error rate P_L for each code across 200,000 independent trials per data point (95% Wilson confidence intervals reported throughout). We identify the pseudo-threshold p*—the physical error rate at which a code's logical error rate equals the uncorrected physical error rate, and compare simulated crossover points against closed-form analytical predictions. Our results reveal a more nuanced picture than the naive threshold-theorem intuition suggests. The three-qubit bit-flip code cannot correct phase-type errors under any circumstance: under a full quantum-state-protection criterion its logical error rate exceeds the physical error rate for every physically meaningful p, with the two curves crossing only at p ≈ 0.75 deep in the maximally-mixed regime and of no practical relevance. Under the narrower, but operationally standard, "bit-observable" criterion (protection of a definite computational-basis value only), the code is unconditionally beneficial (P_L < p) across the entire tested range, because the 2/3 fraction of depolarizing weight that manifests as a detectable bit-flip is compressed further by majority-vote correction. These two results are not contradictory: they evaluate different protection goals—preservation of a classical bit value versus preservation of an arbitrary quantum state—and every comparison in this paper that mixes the two is labeled accordingly. Under this study's idealized, single-round setup, the distance-3 surface code achieves a simulated finite-size pseudo-threshold of p*_SC ≈ 0.083 (8.3%)—a result specific to noiseless syndrome extraction, a single correction round, and an exact minimum weight decoder, and not a hardware representative or asymptotic threshold. That figure is roughly three orders of magnitude higher than an order-of-magnitude literature extrapolation of ≈ 5.6 × 10⁻⁵ (substituting the asymptotic literature threshold p_th ≈ 0.75% into a power law fit for a different, many-round, measurement noisy regime, not a dedicated prediction for our exact setup); the gap is attributable to precisely those idealizations. The surface code requires 17 physical qubits per logical qubit in our implementation (9 data + 8 ancilla) versus 3 for the bit-flip code, a ≈ 5.7× overhead, quantitatively illustrating the overhead-versus-protection tradeoff fundamental to near-term fault-tolerant architectures. All simulation code is available at https://github.com/shanjeev-b-u/qec-code-comparison-depolarizing-noise