Pauli Envelope framework enables optimal loss-distance correction (d_loss ~ d) for rotated surface codes via Mid-SWAP circuits and Envelope-MLE decoder, with simulations showing up to 40% higher thresholds.
Fast correlated decoding of transversal log- ical algorithms
12 Pith papers cite this work. Polarity classification is still indexing.
12
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
roles
background 2polarities
background 2representative citing papers
Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
Neutral atom platform achieves repeated toric code syndrome extraction with qubit reloading, preserving logical information over 90 cycles and showing distance-dependent logical error suppression.
LightStim automates DEM construction for QEC protocols via a record-augmented Pauli tableau tracker, validated across memory, logical operations, distillation, and a novel cross-code lattice surgery design.
Knill error correction reduces circuit-level decoding for quantum LDPC codes to the simpler code-capacity decoder while remaining fault-tolerant under locally decaying noise.
A qubit-reduction method for hypergraph product codes preserves dimension, distance, and fault-tolerance properties, producing smaller codes such as [[441,64,6]] from [[610,64,6]] with comparable noise performance and compatibility with logical gates.
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 tree-encoded fusion scheme and MemTree compiler suppress fusion erasure errors in photonic MBQC, achieving large execution-time reductions over prior compilers with real-hardware validation.
Generalizes stat-mech mapping from toric code memories to transversal Clifford circuits, mapping tCNOT to random Ashkin-Teller and 4-body Ising models and estimating reduced thresholds of p=0.080 and p>=0.028.
Blueprint for a cavity-QED photon-atom platform that generates large-scale cluster states via atomic reuse and achieves a simulated 2.6% photon-loss threshold on the RHG lattice for fault-tolerant Clifford operations.
Comparative analysis of fault-tolerant interfaces for modular quantum computing using surface codes, including novel grow-and-distil protocols, to determine optimal strategies across hardware parameters for low logical error rates.
Proposes QLOPS as an integrated benchmarking metric for FTQC hardware that factors in code rates, decoder throughput, latency, and accuracy, illustrated via RSA-2048 factoring resource estimates.
citing papers explorer
-
Proof of a finite threshold for the union-find decoder
Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
-
Quantum error correction with the toric code
Neutral atom platform achieves repeated toric code syndrome extraction with qubit reloading, preserving logical information over 90 cycles and showing distance-dependent logical error suppression.
-
Spatial overhead reduction for 2D hypergraph product codes
A qubit-reduction method for hypergraph product codes preserves dimension, distance, and fault-tolerance properties, producing smaller codes such as [[441,64,6]] from [[610,64,6]] with comparable noise performance and compatibility with logical gates.
-
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
-
Rigorous estimation of error thresholds of transversal Clifford logical circuits
Generalizes stat-mech mapping from toric code memories to transversal Clifford circuits, mapping tCNOT to random Ashkin-Teller and 4-body Ising models and estimating reduced thresholds of p=0.080 and p>=0.028.
-
Fault-tolerant interfaces for modular quantum computing on diverse qubit platforms
Comparative analysis of fault-tolerant interfaces for modular quantum computing using surface codes, including novel grow-and-distil protocols, to determine optimal strategies across hardware parameters for low logical error rates.
-
Benchmarking fault-tolerant quantum computing hardware via QLOPS
Proposes QLOPS as an integrated benchmarking metric for FTQC hardware that factors in code rates, decoder throughput, latency, and accuracy, illustrated via RSA-2048 factoring resource estimates.