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.
Ryan-Anderson, N
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
fields
quant-ph 8representative citing papers
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.
New search algorithms over stabilizer tableaus and modular assembly techniques yield encoders with up to 43% fewer two-qubit gates and 70% lower depth than prior constructions on tested stabilizer codes including qLDPC and holographic families.
Micromotion enables high-fidelity fast entangling gates on radial modes of trapped-ion crystals with operation times of hundreds of nanoseconds.
Impulsive spin-dependent excitation enables high-fidelity non-local entangling gates between arbitrary ion pairs in chains of up to 40 trapped ions within 1.3-2 center-of-mass oscillation periods.
Experimental demonstration of logical |H_L> and |T_L> magic states with fidelities 0.8806 and 0.8665 on IBM superconducting hardware using a qubit-efficient surface code embedding, with reported error thresholds above prior values.
Constructions for universal quantum computation in the [[n,n-2,2]] error-detecting code detect single-gate errors at computation end, providing weak fault tolerance with reduced overhead versus full error correction.
A three-layer framework decouples application-level logical programs from hardware-level execution via a central Fault-Tolerance Layer that handles synthesis, resource management, decoding, and runtime control.
citing papers explorer
-
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.
-
Simplified circuit-level decoding using Knill error correction
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.
-
Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation
New search algorithms over stabilizer tableaus and modular assembly techniques yield encoders with up to 43% fewer two-qubit gates and 70% lower depth than prior constructions on tested stabilizer codes including qLDPC and holographic families.
-
Radial Fast Entangling Gates Under Micromotion in Trapped-Ion Quantum Computers
Micromotion enables high-fidelity fast entangling gates on radial modes of trapped-ion crystals with operation times of hundreds of nanoseconds.
-
High-speed and high-connectivity two-qubit gates in long chains of trapped ions
Impulsive spin-dependent excitation enables high-fidelity non-local entangling gates between arbitrary ion pairs in chains of up to 40 trapped ions within 1.3-2 center-of-mass oscillation periods.
-
Magic State Injection on IBM Quantum Processors Above the Distillation Threshold
Experimental demonstration of logical |H_L> and |T_L> magic states with fidelities 0.8806 and 0.8665 on IBM superconducting hardware using a qubit-efficient surface code embedding, with reported error thresholds above prior values.
-
Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
Constructions for universal quantum computation in the [[n,n-2,2]] error-detecting code detect single-gate errors at computation end, providing weak fault tolerance with reduced overhead versus full error correction.
-
A Three-Layer Architecture for Fault-Tolerant Quantum Computing
A three-layer framework decouples application-level logical programs from hardware-level execution via a central Fault-Tolerance Layer that handles synthesis, resource management, decoding, and runtime control.