A new family of magic state distillation protocols based on logical Clifford error checking achieves near-linear asymptotic rate despite overhead exponent exceeding one, showing the quantities are not tightly coupled in the sublinear regime.
1997.Stabilizer codes and quantum error correc- tion
9 Pith papers cite this work. Polarity classification is still indexing.
9
Pith papers citing it
citation-role summary
background 3
citation-polarity summary
years
2026 9verdicts
UNVERDICTED 9roles
background 3polarities
background 3representative citing papers
Extends ZX-calculus to dynamical stabilizer codes via gauge fixing to construct measurement-based logical automorphisms, shown with a distance-preserving phase gate on the seven-qubit code.
Quantum contextuality from intraparticle entanglement directly quantifies and enables the advantage in n-bit random access code protocols via a Bell-type inequality.
Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.
Surface code logical qubits in continuous baths have a true thermodynamic error threshold only for short-range interactions, as their decoherence maps exactly to the anisotropic Kondo model.
Numerical evidence that non-stoquastic terms in quantum annealing maintain or increase entanglement and non-stabilizerness, aligning quantum performance gains with classical intractability for tensor networks and stabilizer methods.
Identifies conditions and explicit constructions allowing polynomial-size quantum circuits to implement geometry oracles for pseudorandom textured materials, in contrast to Grover-hard unstructured cases.
GeneCS compiler reduces ancillary qubits and checks by over 85% on average for single- and cross-code logical operations on stabilizer codes while preserving error rates and scaling to over 10,000 qubits.
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.
citing papers explorer
-
Asymptotic magic state distillation with almost linear rate
A new family of magic state distillation protocols based on logical Clifford error checking achieves near-linear asymptotic rate despite overhead exponent exceeding one, showing the quantities are not tightly coupled in the sublinear regime.
-
Chutes and Ladders: Dynamical Automorphisms via the ZX-Calculus
Extends ZX-calculus to dynamical stabilizer codes via gauge fixing to construct measurement-based logical automorphisms, shown with a distance-preserving phase gate on the seven-qubit code.
-
Intraparticle entanglement-based Random Access Code protocols: Contextuality-enabled quantum advantage and implications
Quantum contextuality from intraparticle entanglement directly quantifies and enables the advantage in n-bit random access code protocols via a Bell-type inequality.
-
Hybrid Path-Sums for Hybrid Quantum Programs
Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.
-
Quantum Decoherence of the Surface Code: A Generalized Caldeira-Leggett Approach
Surface code logical qubits in continuous baths have a true thermodynamic error threshold only for short-range interactions, as their decoherence maps exactly to the anisotropic Kondo model.
-
Quantum resources in non-stoquastic quantum annealing
Numerical evidence that non-stoquastic terms in quantum annealing maintain or increase entanglement and non-stabilizerness, aligning quantum performance gains with classical intractability for tensor networks and stabilizer methods.
-
How to make quantum cheese: efficient geometry oracles for exponentially many pseudorandom microstructures
Identifies conditions and explicit constructions allowing polynomial-size quantum circuits to implement geometry oracles for pseudorandom textured materials, in contrast to Grover-hard unstructured cases.
-
GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes
GeneCS compiler reduces ancillary qubits and checks by over 85% on average for single- and cross-code logical operations on stabilizer codes while preserving error rates and scaling to over 10,000 qubits.
-
Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.