Exact Pauli-detecting codes form continuous connected families in a variance geometry parameterized by λ* from Knill-Laflamme conditions, with stabilizer codes occupying only discrete measure-zero subsets.
Title resolution pending
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
fields
quant-ph 8years
2026 8representative citing papers
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.
Transmon qutrits serve as erasure qubits achieving logical T1 over 500 μs with mid-circuit detection, ten times the physical qubit lifetime, plus low-error gates and heralded Bell states.
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.
Compactification of a single higher-dimensional hypergraph-product fracton model yields a broad family of translation-invariant quantum LDPC codes that includes fracton models and all A2BGA codes such as BB codes.
A trapped-ion architecture based on LDPC codes and cat-state factories achieves 110 logical qubits and one million T gates per day using 2514 physical qubits, with estimates for Heisenberg model simulation on 100 sites in one month using 10000 qubits.
A family of quantum LDPC codes with encoding rates exceeding 1/2 achieves logical error rates of 10^{-13} per round on atom arrays under 0.1% circuit noise using hierarchical decoding.
citing papers explorer
-
Variance Geometry of Exact Pauli-Detecting Codes: Continuous Landscapes Beyond Stabilizers
Exact Pauli-detecting codes form continuous connected families in a variance geometry parameterized by λ* from Knill-Laflamme conditions, with stabilizer codes occupying only discrete measure-zero subsets.
-
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.
-
Hardware-Efficient Erasure Qubits With Superconducting Transmon Qutrits
Transmon qutrits serve as erasure qubits achieving logical T1 over 500 μs with mid-circuit detection, ten times the physical qubit lifetime, plus low-error gates and heralded Bell states.
-
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.
-
Translation-invariant quantum low-density parity-check codes from compactified fracton models
Compactification of a single higher-dimensional hypergraph-product fracton model yields a broad family of translation-invariant quantum LDPC codes that includes fracton models and all A2BGA codes such as BB codes.
-
Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture
A trapped-ion architecture based on LDPC codes and cat-state factories achieves 110 logical qubits and one million T gates per day using 2514 physical qubits, with estimates for Heisenberg model simulation on 100 sites in one month using 10000 qubits.
-
Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays
A family of quantum LDPC codes with encoding rates exceeding 1/2 achieves logical error rates of 10^{-13} per round on atom arrays under 0.1% circuit noise using hierarchical decoding.
- AI-Enabled Decoding of Qubit Loss for Quantum Error-Correcting Codes