Reproduce “The ZX calculus is a language for surface code lattice surgery” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Niel de Beaudrap, Dominic Horsman
Researchers established a formal correspondence between surface code lattice surgery operations and the ZX calculus, providing a graphical language for designing, verifying, and optimizing quantum protocols, including native representation of non-deterministic measurement outcomes and discovery of novel gate implementations. This work, from the University of Oxford and Durham University, addresses limitations of prior informal representations of lattice surgery.
Key insights
- The basic operations of lattice surgery are precisely modeled by specific graphical elements in the ZX calculus, where red spiders correspond to rough operations and green spiders to smooth operations.
- The ZX calculus provides a native and formal way to represent the intrinsically non-unitary and non-deterministic aspects of lattice surgery, including measurement outcomes and subsequent Pauli frame updates.
- Leveraging the established formal rewrite rules of the ZX calculus allows for systematic design, verification, and discovery of novel and optimized lattice surgery protocols.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.