Partitioning qubits in hypergraph product codes to implement logical gates
Open accessThe DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
The promise of high-rate low-density parity check (LDPC) codes to substantially reduce the overhead of fault-tolerant quantum computation depends on constructing efficient, fault-tolerant implementations of logical gates on such codes. Transversal gates are the simplest type of fault-tolerant gate, but the potential of transversal gates on LDPC codes has hitherto been largely neglected. We investigate the transversal gates that can be implemented in hypergraph product codes, a class of LDPC codes. Our analysis is aided by the construction of a symplectic canonical basis for the logical operators of hypergraph product codes, a result that may be of independent interest. We show that in these codes transversal gates can implement Hadamard (up to logical SWAP gates) and control-Z on all logical qubits. Moreover, we show that sequences of transversal operations, interleaved with error correction, allow implementation of entangling gates between arbitrary pairs of logical qubits in the same code block. We thereby demonstrate that transversal gates can be used as the basis for universal quantum computing on LDPC codes, when supplemented with state injection.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 1×
“Similarly, any pair of binary matrices Hx in Fmx×n 2 and Hz in Fmz×n 2 such that Hx · H z = 0 mod 2 defines a stabiliser CSS code [25, 26, 27].”
BackgroundGottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · cited 2×
“To complete a universal gate set, it is sufficient to implement the H, S and T gates, which can be done using state injection [38, 39, 40].”
MethodMultiple-particle interference and quantum error correction
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0136 · Cited by 1,284
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
Restrictions on Transversal Encoded Quantum Gate Sets
Eastin, B., & Knill, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110502 · Cited by 457 · cited 2×
“We take a different approach to fault-tolerance and explore transversal gates [12, 13, 14, 15, 16, 17].”
BackgroundQuantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
Degenerate Quantum LDPC Codes With Good Finite Length Performance
Panteleev, P., & Kalachev, G. (2021) · Quantum · doi:10.22331/q-2021-11-22-585 · Cited by 257
Asymptotically good Quantum and locally testable classical LDPC codes
Panteleev, P., & Kalachev, G. (2022) · Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3519935.3520017 · Cited by 222 · cited 4×
“They thereby preserve the essential benefits of the surface code for error-correction, while allowing much smaller qubit overheads [5, 7].”
BackgroundMethodInfluentialMagic State Distillation: Not as Costly as You Think
Litinski, D. (2019) · Quantum · doi:10.22331/q-2019-12-02-205 · Cited by 220
Cited by
Entangling Four Logical Qubits beyond Break-Even in a Nonlocal Code
Hong, Y., Durso-Sabina, E., Hayes, D., & Lucas, A. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.180601 · Cited by 29
Distance-preserving stabilizer measurements in hypergraph product codes
Manes, A. G., & Claes, J. (2025) · Quantum · doi:10.22331/q-2025-01-30-1618 · Cited by 17
“In addition, the HGP codes’ relatively tractable construction has led to further development of decoders [19–25], logical gates [26, 27], and low-depth stabilizer measurement circuits [28, 29], and it has been recently demonstrated that HGP codes can be designed to be compatible with modular…”
Code conversion with the quantum Golay code for a universal transversal gate set
Sullivan, M. (2024) · Physical Review A · doi:10.1103/physreva.109.042416 · Cited by 7
Metadata
- Authors
- Quintavalle, A. O., Webster, P., & Vasmer, M.
- Venue
- Quantum
- Published
- 2023-10-24
- Volume
- 7
- Pages
- 1153
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W4387909106
- Cited by
- 35
- References
- 13
- FWCI
- 3.07
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Partitioning qubits in hypergraph product codes to implement logical gates. https://app.cochat.ai/papers/10.22331/q-2023-10-24-1153
- The paper
- Quintavalle, A. O., Webster, P., & Vasmer, M. (2023). Partitioning qubits in hypergraph product codes to implement logical gates. Quantum. https://doi.org/10.22331/q-2023-10-24-1153
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.