A high-rate non-LDPC CSS code family with parameters [[n, √n, Θ(n^β)]] (β≈0.2823) is constructed from a base [[n0,2,d0]] code and provably admits a constant-depth complete transversal logical Clifford ISA of targeted S̄, √X̄, and CZ̄ gates.
Relaxing hardware requirements for surface code circuits using time-dynamics
8 Pith papers cite this work, alongside 73 external citations. Polarity classification is still indexing.
8
Pith papers citing it
73
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 8roles
background 1polarities
background 1representative citing papers
A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.
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.
Bunny codes are qLDPC codes found via exhaustive search that achieve ~3x higher code rate than toric codes (periodic) and ~2x over rotated surface codes (open) when using CNOT+CXSWAP on nearest-neighbor connectivity, with some showing 10x lower logical error rates in simulation.
Barbell codes are a family of qLDPC codes with a matching superconducting chip layout enabling constant hardware complexity, simulated to preserve logical information over trillions of QEC cycles at 10^{-4} physical noise with under 30 data qubits per logical qubit.
Morphing circuits optimize syndrome extraction for Abelian 2BGA and other QEC codes, yielding new circuits with improved parameters, connectivity, and stability against measurement errors.
A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.
citing papers explorer
-
Quantum Logic Codes: Complete Transversal Logical Clifford Instruction Sets for High-Rate Stabilizer Quantum Error Correcting Codes
A high-rate non-LDPC CSS code family with parameters [[n, √n, Θ(n^β)]] (β≈0.2823) is constructed from a base [[n0,2,d0]] code and provably admits a constant-depth complete transversal logical Clifford ISA of targeted S̄, √X̄, and CZ̄ gates.
-
Fault-tolerant quantum computation with a neutral atom processor
A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.
-
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.
-
Bunny Codes: Broadening Superconducting Quantum Error Correction Capability through Advanced Control Engineering
Bunny codes are qLDPC codes found via exhaustive search that achieve ~3x higher code rate than toric codes (periodic) and ~2x over rotated surface codes (open) when using CNOT+CXSWAP on nearest-neighbor connectivity, with some showing 10x lower logical error rates in simulation.
-
Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware
Barbell codes are a family of qLDPC codes with a matching superconducting chip layout enabling constant hardware complexity, simulated to preserve logical information over trillions of QEC cycles at 10^{-4} physical noise with under 30 data qubits per logical qubit.
-
Optimising Quantum Error Correction Using Morphing Circuits
Morphing circuits optimize syndrome extraction for Abelian 2BGA and other QEC codes, yielding new circuits with improved parameters, connectivity, and stability against measurement errors.
-
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.
- Low-overhead fault-tolerant quantum computation by gauging logical operators