The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.
The ZX calculus is a language for surface code lattice surgery
Open accessAbstract
A leading choice of error correction for scalable quantum computing is the surface code with lattice surgery. The basic lattice surgery operations, the merging and splitting of logical qubits, act non-unitarily on the logical states and are not easily captured by standard circuit notation. This raises the question of how best to design, verify, and optimise protocols that use lattice surgery, in particular in architectures with complex resource management issues. In this paper we demonstrate that the operations of the ZX calculus --- a form of quantum diagrammatic reasoning based on bialgebras --- match exactly the operations of lattice surgery. Red and green ``spider'' nodes match rough and smooth merges and splits, and follow the axioms of a dagger special associative Frobenius algebra. Some lattice surgery operations require non-trivial correction operations, which are captured natively in the use of the ZX calculus in the form of ensembles of diagrams. We give a first taste of the power of the calculus as a language for lattice surgery by considering two operations (T gates and producing a CNOT) and show how ZX diagram re-write rules give lattice surgery procedures for these operations that are novel, efficient, and highly configurable.
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
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
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
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Class of quantum error-correcting codes saturating the quantum Hamming bound
Gottesman, D. (1996) · Physical Review A · doi:10.1103/physreva.54.1862 · Cited by 1,227 · cited 1×
“stabilizer notation [27]).”
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Surface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598
Self-citation
Research works printed but not linked: 1
- Aleks Kissinger and John van de Wetering. Reducing T-count with the ZX-calculus. Preprint, arXiv:1903.10477, 2019a. · arXiv
Cited by
PyZX: Large Scale Automated Diagrammatic Reasoning
Kissinger, A., & van de Wetering, J. (2020) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.318.14 · Cited by 315
A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
Jeandel, E., Perdrix, S., & Vilmart, R. (2017) · HAL · Cited by 147
Phase Gadget Synthesis for Shallow Circuits
Cowtan, A., Dilkes, S., Duncan, R., Simmons, W., & Sivarajah, S. (2020) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.318.13 · Cited by 222
Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
Zhao, C., & Gao, X.-S. (2021) · Quantum · doi:10.22331/q-2021-06-04-466 · Cited by 130
Phase gadget synthesis for shallow circuits
Cowtan, A., Dilkes, S., Duncan, R., Simmons, W., & Sivarajah, S. (2019) · Strathprints: The University of Strathclyde institutional repository (University of Strathclyde) · Cited by 92
Metadata
- Authors
- de Beaudrap, N., & Horsman, D.
- Affiliations
- Department of Computer Science, University of Oxford, Parks Road, Oxford, OX1 3QD
- Durham University (GB)
- Venue
- Quantum
- Published
- 2020-01-09
- Volume
- 4
- Pages
- 218
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W2610243179
- Cited by
- 83
- References
- 57
- Citations by year
- 2026: 6 · 2025: 12 · 2024: 10 · 2023: 15 · 2022: 4 · 2021: 11 · 2020: 11
- FWCI
- 4.03
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Quantum (publishedVersion, cc-by)
- Durham Research Online (Durham University) (acceptedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- Durham Research Online (Durham University) (submittedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University) (cc-by)
- Funders
- Engineering and Physical Sciences Research Council (EP/L022303/1, EP/M013243/1)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- ZX-calculus, surface code, lattice surgery, T-gate, CNOT gate, quantum error correction, quantum circuit optimization, resource management
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: The ZX calculus is a language for surface code lattice surgery. https://app.cochat.ai/papers/10.22331/q-2020-01-09-218
- The paper
- de Beaudrap, N., & Horsman, D. (2020). The ZX calculus is a language for surface code lattice surgery. Quantum. https://doi.org/10.22331/q-2020-01-09-218
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.