Extends n-dimensional topological stabilizer codes to Clifford hierarchy versions corresponding to non-Abelian gauge theories and constructs transversal gates at the (n+1)th Clifford level.
Fowler and Simon Devitt and
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 8verdicts
UNVERDICTED 8roles
background 1polarities
background 1representative citing papers
Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.
VarQEC uses a distinguishability loss as a machine-learning objective to variationally discover resource-efficient encoding circuits optimized for given noise models.
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
MCMit mitigates mid-circuit measurement errors via a new multi-control branch instruction, CNN and transformer discriminators, and software techniques, reporting up to 70% latency reduction and 80% lower logical error rates in QEC.
Three architectural types for fault-tolerant distributed quantum computing exhibit distinct scaling of Bell-pair consumption and generation attempts with code distance in planar surface and toric codes.
A two-level decoder scheduling framework reduces classical processing requirements for quantum error correction by 10-40% on fault-tolerant benchmarks by managing bursty workloads as shared resources.
A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.
citing papers explorer
-
Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic
Extends n-dimensional topological stabilizer codes to Clifford hierarchy versions corresponding to non-Abelian gauge theories and constructs transversal gates at the (n+1)th Clifford level.
-
Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice
Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.
-
Learning Encodings by Maximizing State Distinguishability: Variational Quantum Error Correction
VarQEC uses a distinguishability loss as a machine-learning objective to variationally discover resource-efficient encoding circuits optimized for given noise models.
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
-
MCMit: Mid-Circuit Measurement Error Mitigation
MCMit mitigates mid-circuit measurement errors via a new multi-control branch instruction, CNN and transformer discriminators, and software techniques, reporting up to 70% latency reduction and 80% lower logical error rates in QEC.
-
Architectural Approaches to Fault-Tolerant Distributed Quantum Computing and Their Entanglement Overheads
Three architectural types for fault-tolerant distributed quantum computing exhibit distinct scaling of Bell-pair consumption and generation attempts with code distance in planar surface and toric codes.
-
Managing Classical Processing Requirements for Quantum Error Correction
A two-level decoder scheduling framework reduces classical processing requirements for quantum error correction by 10-40% on fault-tolerant benchmarks by managing bursty workloads as shared resources.
-
Maximum Likelihood Decoding of Quantum Error Correction Codes
A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.