A new code surgery protocol measures t logically disjoint Pauli products on any LDPC code using O(t ω (log t + log³ω)) ancillas in O(d) time while preserving LDPC property and fault distance.
Williamson, and Theodore J
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
citation-role summary
background 3
citation-polarity summary
fields
quant-ph 7roles
background 3polarities
background 3representative citing papers
Concatenating quantum Reed-Solomon outer codes over the gross code using Galois qudits reaches teraquop regime at 10^{-3} physical noise with lower overhead than prior two-gross-code constructions.
Forced-gap post-selection on bivariate bicycle codes and surgery gadgets improves logical error rates by a factor of more than 4 using Relay-BP decoding at fixed post-selection rate.
A modular atomic processor with 500,000 qubits factors 2048-bit RSA numbers in roughly the same time as a single large module when inter-module Bell-pair communication runs at 10^5 per second.
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.
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.
Tensor and balanced product codes arise from a coupled-layer construction via anyon condensation on stacked constituent codes.
citing papers explorer
-
Parallel Logical Measurements via Quantum Code Surgery
A new code surgery protocol measures t logically disjoint Pauli products on any LDPC code using O(t ω (log t + log³ω)) ancillas in O(d) time while preserving LDPC property and fault distance.
-
Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes
Concatenating quantum Reed-Solomon outer codes over the gross code using Galois qudits reaches teraquop regime at 10^{-3} physical noise with lower overhead than prior two-gross-code constructions.
-
Forced Gap Post-Selection for Quantum LDPC Codes and their Operations
Forced-gap post-selection on bivariate bicycle codes and surgery gadgets improves logical error rates by a factor of more than 4 using Relay-BP decoding at fixed post-selection rate.
-
Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor
A modular atomic processor with 500,000 qubits factors 2048-bit RSA numbers in roughly the same time as a single large module when inter-module Bell-pair communication runs at 10^5 per second.
-
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
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.
-
Coupled-Layer Construction of Quantum Product Codes
Tensor and balanced product codes arise from a coupled-layer construction via anyon condensation on stacked constituent codes.