Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
Logical quantum pro- cessor based on reconfigurable atom arrays
9 Pith papers cite this work. Polarity classification is still indexing.
9
Pith papers citing it
citation-role summary
background 3
citation-polarity summary
fields
quant-ph 9roles
background 3polarities
background 3representative citing papers
Radial codes from lifted products of quasi-cyclic codes give [[2r²s, 2(r-1)², ≤2s]] quantum LDPC codes whose simulations show comparable circuit-level performance to surface codes at roughly 1/5 the qubit count with single-shot decoding.
Logical error rates in [[7,1,3]] and [[12,2,4]] codes are suppressed 9.8-800 times below physical rates on trapped-ion hardware, with repeated correction cycles approaching the error rate of two physical CNOTs.
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
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.
Generalizes stat-mech mapping from toric code memories to transversal Clifford circuits, mapping tCNOT to random Ashkin-Teller and 4-body Ising models and estimating reduced thresholds of p=0.080 and p>=0.028.
A flat-top beam profile created via analytical superposition of Gaussian modes provides spatial selectivity for Rydberg excitation, confirmed by differing Rabi oscillation visibilities between targeted and neighboring atoms in experiment.
Logical quantum kernels outperform physical ones when solving differential equations on a neutral-atom processor, with gains traced to noise error detection in the logical encoding.
A review of how quantum information science is expected to provide new tools and insights for nuclear and high-energy physics phenomenology and quantum simulations.
citing papers explorer
-
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.
-
High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory
Radial codes from lifted products of quasi-cyclic codes give [[2r²s, 2(r-1)², ≤2s]] quantum LDPC codes whose simulations show comparable circuit-level performance to surface codes at roughly 1/5 the qubit count with single-shot decoding.
-
Demonstration of logical qubits and repeated error correction with better-than-physical error rates
Logical error rates in [[7,1,3]] and [[12,2,4]] codes are suppressed 9.8-800 times below physical rates on trapped-ion hardware, with repeated correction cycles approaching the error rate of two physical CNOTs.
-
Bridging Krylov Complexity and Universal Analog Quantum Simulator
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
-
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.
-
Rigorous estimation of error thresholds of transversal Clifford logical circuits
Generalizes stat-mech mapping from toric code memories to transversal Clifford circuits, mapping tCNOT to random Ashkin-Teller and 4-body Ising models and estimating reduced thresholds of p=0.080 and p>=0.028.
-
Addressable Rydberg excitation in arrays of single neutral atoms with a strongly focused flat-top beam
A flat-top beam profile created via analytical superposition of Gaussian modes provides spatial selectivity for Rydberg excitation, confirmed by differing Rabi oscillation visibilities between targeted and neighboring atoms in experiment.
-
Benchmarking a machine-learning differential equations solver on a neutral-atom logical processor
Logical quantum kernels outperform physical ones when solving differential equations on a neutral-atom processor, with gains traced to noise error detection in the logical encoding.
-
Quantum Complexity and New Directions in Nuclear Physics and High-Energy Physics Phenomenology
A review of how quantum information science is expected to provide new tools and insights for nuclear and high-energy physics phenomenology and quantum simulations.