A new in-situ scheme prepares logical magic states inside arbitrary CSS qLDPC codes using only syndrome-extraction ancillas, with simulations on the [[144,12,12]] BB code and [[225,9,4]] hypergraph-product code showing injection error rates around 10^{-3} or lower under depolarizing and asymmetric噪声
Title resolution pending
15 Pith papers cite this work. Polarity classification is still indexing.
15
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 15roles
background 1polarities
background 1representative citing papers
Pauli Envelope framework enables optimal loss-distance correction (d_loss ~ d) for rotated surface codes via Mid-SWAP circuits and Envelope-MLE decoder, with simulations showing up to 40% higher thresholds.
Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
A two-dimensional dissipative quantum cellular automaton achieves passive quantum error correction with a nonzero noise threshold and supports fault-tolerant universal computation.
Routed tile codes on a 2D nearest-neighbor grid achieve circuit-level thresholds of 0.11%-0.13% under SI1000 noise and become more qubit-efficient than the surface code below a physical error rate of 0.08%.
A donor-cluster array architecture in silicon uses shared electrons and natural hyperfine distributions for individual spin addressability, tunable inter-cluster exchange, and high-fidelity gates to enable scalable quantum computing.
A symmetry-leveraging framework for fault-tolerant ancilla preparation in quantum BCH codes yields lower spatial overhead and logical error rates than standard distillation in simulations up to 127 qubits.
Syn@fac optimization reduces estimated circuit failure probability by a factor of 9 on average across non-Clifford benchmarks for bivariate bicycle code modular FTQC architectures, with additional gains from transvection deferral and Clifford insertion.
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 programmable 2D toric oscillator network enables efficient routing for bivariate bicycle LDPC codes, reducing long-range couplers to O(sqrt(n)) and achieving 3.06% logical error rate per cycle in simulations for the [[18,4,4]] code.
New structural conditions on affine permutation matrices yield ultra-high-rate quantum LDPC codes (rate >1/2) with near-teraquop logical error rates under circuit-level noise on reconfigurable atom arrays.
A superconducting quantum router enables programmable multi-qubit entangling operations, demonstrated with faster preparation of entangled states and RL-trained 2- and 3-qubit gates like Toffoli and Fredkin.
Evolutionary BP+OSD achieves higher decoding performance and lower complexity than standard BP+OSD on surface and QLDPC codes, especially under low-latency constraints.
Superconducting circuit hosts fractional fluxon states (fraxons) in a tailored Josephson potential to realize protected qudits with a STIRAP gate protocol.
On small stabilizer-code and Grover circuits, coherent Gaussian noise and Pauli noise rank differently under entropy-matched comparison, and a simplified variance-propagation model matches full simulation only in uncorrected circuits.
citing papers explorer
-
In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes
A new in-situ scheme prepares logical magic states inside arbitrary CSS qLDPC codes using only syndrome-extraction ancillas, with simulations on the [[144,12,12]] BB code and [[225,9,4]] hypergraph-product code showing injection error rates around 10^{-3} or lower under depolarizing and asymmetric噪声
-
Achieving Optimal-Distance Atom-Loss Correction via Pauli Envelope
Pauli Envelope framework enables optimal loss-distance correction (d_loss ~ d) for rotated surface codes via Mid-SWAP circuits and Envelope-MLE decoder, with simulations showing up to 40% higher thresholds.
-
Proof of a finite threshold for the union-find decoder
Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
-
Quantum Memory and Autonomous Computation in Two Dimensions
A two-dimensional dissipative quantum cellular automaton achieves passive quantum error correction with a nonzero noise threshold and supports fault-tolerant universal computation.
-
Strictly Local Tile-Code Architectures on Two-Dimensional Planar Lattices
Routed tile codes on a 2D nearest-neighbor grid achieve circuit-level thresholds of 0.11%-0.13% under SI1000 noise and become more qubit-efficient than the surface code below a physical error rate of 0.08%.
-
Scalable Spin Qubit Architecture with Donor-Cluster Arrays in Silicon
A donor-cluster array architecture in silicon uses shared electrons and natural hyperfine distributions for individual spin addressability, tunable inter-cluster exchange, and high-fidelity gates to enable scalable quantum computing.
-
Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry
A symmetry-leveraging framework for fault-tolerant ancilla preparation in quantum BCH codes yields lower spatial overhead and logical error rates than standard distillation in simulations up to 127 qubits.
-
Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture
Syn@fac optimization reduces estimated circuit failure probability by a factor of 9 on average across non-Clifford benchmarks for bivariate bicycle code modular FTQC architectures, with additional gains from transvection deferral and Clifford insertion.
-
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.
-
Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures
A programmable 2D toric oscillator network enables efficient routing for bivariate bicycle LDPC codes, reducing long-range couplers to O(sqrt(n)) and achieving 3.06% logical error rate per cycle in simulations for the [[18,4,4]] code.
-
Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays
New structural conditions on affine permutation matrices yield ultra-high-rate quantum LDPC codes (rate >1/2) with near-teraquop logical error rates under circuit-level noise on reconfigurable atom arrays.
-
Efficient $n$-qubit entangling operations via a superconducting quantum router
A superconducting quantum router enables programmable multi-qubit entangling operations, demonstrated with faster preparation of entangled states and RL-trained 2- and 3-qubit gates like Toffoli and Fredkin.
-
Evolutionary BP+OSD Decoding for Low-Latency Quantum Error Correction
Evolutionary BP+OSD achieves higher decoding performance and lower complexity than standard BP+OSD on surface and QLDPC codes, especially under low-latency constraints.
-
Fraxonium: Fractional fluxon states for qudit encoding
Superconducting circuit hosts fractional fluxon states (fraxons) in a tailored Josephson potential to realize protected qudits with a STIRAP gate protocol.
-
Continuous Noise Model for Quantum Circuits
On small stabilizer-code and Grover circuits, coherent Gaussian noise and Pauli noise rank differently under entropy-matched comparison, and a simplified variance-propagation model matches full simulation only in uncorrected circuits.