A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery

By Daniel Litinski. Quantum, 2018

639 citations recorded by the source corpus.

Given a quantum gate circuit, how does one execute it in a fault-tolerant architecture with as little overhead as possible? In this paper, we discuss strategies for surface-code quantum computing on small, intermediate and large scales. They are strategies for space-time trade-offs, going from slow computations using few qubits to fast computations using many qubits. Our schemes are based on surface-code patches, which not only feature a low space cost compared to other surface-code schemes, but are also conceptually simple~--~simple enough that they can be described as a tile-based game with a small set of rules. Therefore, no knowledge of quantum error correction is necessary to understand the schemes in this paper, but only the concepts of qubits and measurements.

Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/f62ab3fcc45eb787f4eb3213a3ffcae97799e9e5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Atomic and Molecular Physics, and Optics

In Computational Theory and Mathematics

Citations in the corpus

Magic state cultivation: growing T states as cheap as CNOT gates (2024, background): “For example, [Lit18] is a commonly cited architecture that pays large routing overheads to ensure magic state factories can run continuously.”
Quantum information processing and quantum optics with circuit quantum electrodynamics (2020, background): “Such brute-force approaches are viable up to around 1,000 qubits — a loose estimate — limited primarily by packaging, signal routing and the size of dilution refrig-a”
Magic State Distillation: Not as Costly as You Think (2019, methodology): “Consider an nq-qubit quantum computation with nT T gates and a quantum computer consisting of a block of qubits used to distill magic states and a block of qubits used to store the nq data qubits and consume magic states [26].”
Fusion-based quantum computation (2021, methodology): “Pauli product measurements[67] are similarly unaffected by the presence of a Pauli frame.”
The XZZX surface code (2020, neutral): “Figure 6 Generalized lattice surgery [31, 47].”
Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer (2020, methodology): “Alternatively, the error correction can be performed during a subsequent patch deformation [128]; the latter is more resource-efficient, and is thus the approach we favour.”