A new sparse Pauli-frame method shows coherent noise thresholds are overestimated by a factor of ~4 under Pauli-twirling and revises the T-to-S gate error rate factor to as high as 7 at distance d=5.
Gidney, Quantum5, 497 (2021)
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
fields
quant-ph 5years
2026 5verdicts
UNVERDICTED 5representative citing papers
Shuttling check qubits in a spin-qubit railway and using the XZZX surface code under dephasing bias achieves a distance-7 megaquop footprint at 10^{-3} physical error rate.
The biplanar architecture maps Fermi-Hubbard spin sectors to two planes, eliminating swaps and cutting each Trotter step depth to 4t_synth + 90 logical timesteps versus 6t_synth + 354 in single-plane methods, yielding an estimated 2-hour runtime for L=8 with 1.35 million physical qubits under a 1% 1
A defect-adaptive lattice surgery technique reconstructs joint logical parities on irregular surface-code patches via GF(2) binary synthesis from seam measurements and pre-merge constraints, yielding executable rules or failure certificates while preserving effective distance.
Closed-form expressions and circuit compression enable efficient strong and weak simulation of noisy stabilizer circuits with non-deterministic measurements.
citing papers explorer
-
Computing logical error thresholds with the Pauli Frame Sparse Representation
A new sparse Pauli-frame method shows coherent noise thresholds are overestimated by a factor of ~4 under Pauli-twirling and revises the T-to-S gate error rate factor to as high as 7 at distance d=5.
-
Surface-Code Thresholds and Qubit Footprints in Shuttling-Based Spin-Qubit Railways
Shuttling check qubits in a spin-qubit railway and using the XZZX surface code under dephasing bias achieves a distance-7 megaquop footprint at 10^{-3} physical error rate.
-
Two Layers, No Swaps: Biplanar SPOQC Architecture Improves Runtime of Fermi-Hubbard Simulation
The biplanar architecture maps Fermi-Hubbard spin sectors to two planes, eliminating swaps and cutting each Trotter step depth to 4t_synth + 90 logical timesteps versus 6t_synth + 354 in single-plane methods, yielding an estimated 2-hour runtime for L=8 with 1.35 million physical qubits under a 1% 1
-
Defect-Adaptive Lattice Surgery on Irregular Boundary Surface-Code Patches
A defect-adaptive lattice surgery technique reconstructs joint logical parities on irregular surface-code patches via GF(2) binary synthesis from seam measurements and pre-merge constraints, yielding executable rules or failure certificates while preserving effective distance.
-
Analytical and Compressed Simulation of Noisy Stabilizer Circuits
Closed-form expressions and circuit compression enable efficient strong and weak simulation of noisy stabilizer circuits with non-deterministic measurements.