Derives parameter-free analytical expression for collision resolution in peeling decoding of BB codes, validated with R^2=0.86 and enabling low-latency two-shot decoding.
hub
Wanget al., Demonstration of low-overhead quan- tum error correction codes, Nature Physics (2026)
11 Pith papers cite this work. Polarity classification is still indexing.
11
Pith papers citing it
hub tools
citation-role summary
background 2
method 1
citation-polarity summary
fields
quant-ph 11representative citing papers
A new Sparse Stabilizer Tensor cost function enables hyper-optimized contraction schedules for Quantum LEGO WEP calculations, delivering orders-of-magnitude improvements over dense tensor baselines for stabilizer codes.
Tricycle codes generalize bicycle codes to three homological dimensions, enabling constant-depth CCZ circuits and single-shot magic state generation with circuit-level thresholds above 0.5% and low error rates at block lengths of 50-100 qubits.
HAL heuristic produces explicit layouts for bivariate bicycle, tile, radial, and Tanner qLDPC codes on multilayer superconducting hardware, demonstrating that open-boundary designs reduce hardware demands with only moderate loss in logical efficiency.
Triage is an adaptive parallel window decoding scheduler that reduces average logical error rates by 52.6% compared to standard temporal parallelism while keeping stalls low under scarce classical resources.
A programmable 2D toric oscillator network enables efficient routing for bivariate bicycle LDPC codes, reducing long-range couplers to O(sqrt(n)) and achieving 3.06% logical error rate per cycle in simulations for the [[18,4,4]] code.
O3LS reduces space overhead by up to 46.7% and time overhead by up to 36% in lattice surgery while suppressing logical error rates by up to an order of magnitude compared with prior layout and scheduling approaches.
Geometry choices in bivariate-bicycle qLDPC syndrome extraction determine leading correlated error structure via weighted exposure, which correlates strongly with logical error rates and is reduced by biplanar layouts.
An exact positive-probability decomposition of thermal relaxation noise into Clifford gates and resets exists for T2 ≤ T1, with a negativity-free approximation that outperforms Pauli twirling for T2 > T1.
Canopus unifies qubit mapping and routing across quantum ISAs by modeling synthesis costs via canonical two-qubit gate forms, achieving 15-35% lower routing overhead than prior methods on varied backends and topologies.
A review summarizing spin qubit platforms, long-range coupling methods, and a proposal for topological linking toward scalable quantum information processing.
citing papers explorer
-
Analytical Theory of Greedy Peeling for Bivariate Bicycle Codes and Two-Shot Streaming Decoding
Derives parameter-free analytical expression for collision resolution in peeling decoding of BB codes, validated with R^2=0.86 and enabling low-latency two-shot decoding.
-
Hyper-optimized Quantum Lego Contraction Schedules
A new Sparse Stabilizer Tensor cost function enables hyper-optimized contraction schedules for Quantum LEGO WEP calculations, delivering orders-of-magnitude improvements over dense tensor baselines for stabilizer codes.
-
Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes
Tricycle codes generalize bicycle codes to three homological dimensions, enabling constant-depth CCZ circuits and single-shot magic state generation with circuit-level thresholds above 0.5% and low error rates at block lengths of 50-100 qubits.
-
Placing and routing quantum LDPC codes in multilayer superconducting hardware
HAL heuristic produces explicit layouts for bivariate bicycle, tile, radial, and Tanner qLDPC codes on multilayer superconducting hardware, demonstrating that open-boundary designs reduce hardware demands with only moderate loss in logical efficiency.
-
Triage: An Adaptive Parallel Window Decoding Scheduler for Real-time Fault-Tolerant Quantum Computation
Triage is an adaptive parallel window decoding scheduler that reduces average logical error rates by 52.6% compared to standard temporal parallelism while keeping stalls low under scarce classical resources.
-
Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures
A programmable 2D toric oscillator network enables efficient routing for bivariate bicycle LDPC codes, reducing long-range couplers to O(sqrt(n)) and achieving 3.06% logical error rate per cycle in simulations for the [[18,4,4]] code.
-
O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling
O3LS reduces space overhead by up to 46.7% and time overhead by up to 36% in lattice surgery while suppressing logical error rates by up to an order of magnitude compared with prior layout and scheduling approaches.
-
Geometry-induced correlated noise in qLDPC syndrome extraction
Geometry choices in bivariate-bicycle qLDPC syndrome extraction determine leading correlated error structure via weighted exposure, which correlates strongly with logical error rates and is reduced by biplanar layouts.
-
Exact and Efficient Stabilizer Simulation of Thermal-Relaxation Noise for Quantum Error Correction
An exact positive-probability decomposition of thermal relaxation noise into Clifford gates and resets exists for T2 ≤ T1, with a negativity-free approximation that outperforms Pauli twirling for T2 > T1.
-
Unifying Qubit Routing Across Diverse Quantum ISAs via Canonical Representation
Canopus unifies qubit mapping and routing across quantum ISAs by modeling synthesis costs via canonical two-qubit gate forms, achieving 15-35% lower routing overhead than prior methods on varied backends and topologies.
-
Theory of spin qubits and the path to scalability
A review summarizing spin qubit platforms, long-range coupling methods, and a proposal for topological linking toward scalable quantum information processing.