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.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 4roles
background 1polarities
background 1representative citing papers
Wire codes are a construction that converts any stabilizer code into a local weight-3 subsystem code on an arbitrary graph via low-density Tanner-graph embedding, with overhead governed by the embedding quality.
A qubit-reduction method for hypergraph product codes preserves dimension, distance, and fault-tolerance properties, producing smaller codes such as [[441,64,6]] from [[610,64,6]] with comparable noise performance and compatibility with logical gates.
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.
-
Wire Codes
Wire codes are a construction that converts any stabilizer code into a local weight-3 subsystem code on an arbitrary graph via low-density Tanner-graph embedding, with overhead governed by the embedding quality.
-
Spatial overhead reduction for 2D hypergraph product codes
A qubit-reduction method for hypergraph product codes preserves dimension, distance, and fault-tolerance properties, producing smaller codes such as [[441,64,6]] from [[610,64,6]] with comparable noise performance and compatibility with logical gates.
- Low-overhead fault-tolerant quantum computation by gauging logical operators