| Lattice surgery | |
|---|---|
| Name | Lattice surgery |
| Field | Quantum computing |
| Introduced | 2012 |
| Inventor | Hector Bombin? |
| Related | Surface code, Topological quantum error correction |
Lattice surgery
Lattice surgery is a set of techniques for performing logical operations on encoded qubits by dynamically changing the topology of surface code patches rather than by braiding pointlike defects. It enables fault-tolerant quantum gates, measurement, and state transfer between logical qubits in architectures that implement stabilizer codes. Lattice surgery matters because it reduces overheads and simplifies control in scalable quantum computer designs, and it is widely studied in both theoretical and experimental efforts toward fault-tolerant quantum computing.
Lattice surgery was developed as an alternative to defect braiding for manipulating logical information stored in two-dimensional topological codes such as the surface code and the planar code. The technique performs logical operations by merging and splitting neighbouring code patches through sequences of stabilizer measurements, effectively performing joint parity measurements of logical operators. Early formalizations and practical protocols were described in works by Daniel Gottesman-related stabilizer literature and later practical proposals around 2012–2014 that integrated ideas from Hector Bombin and others on topological operations. Lattice surgery is central to proposals by groups at institutions such as IBM, Google Quantum AI, Microsoft (stationary proposals), University of Sydney, and academic groups at MIT and University of Waterloo.
Lattice surgery is grounded in the stabilizer formalism introduced by Daniel Gottesman and in the surface code family first studied by Alexei Kitaev (toric code) and adapted to planar geometries by later authors. In a surface code, physical qubits occupy edges or vertices of a two-dimensional lattice and face- and vertex-type stabilizer operators enforce local parity constraints. Logical qubits are encoded in global degrees of freedom, typically as nontrivial strings of Pauli operators across a patch. The stabilizer description permits efficient classical simulation of syndrome processing via methods such as the minimum-weight perfect matching algorithm developed in contexts by researchers including Andrew Fowler and Austin G. Fowler. Lattice surgery manipulates these stabilizers to enact logical measurements and entangling gates without moving defects, relying on local stabilizer measurement circuits compatible with common superconducting qubit and trapped ion hardware operations.
Fundamental lattice surgery primitives include patch merging, splitting, and boundary reconfiguration. A merge involves measuring new stabilizers across the boundary between two patches to project onto a joint eigenstate (e.g., X-parity or Z-parity). A split applies measurements that restore independent stabilizers and thereby separate logical degrees of freedom. Repeating rounds of stabilizer measurements and classical decoding yield logical outcomes; protocols specify timing, measurement patterns, and syndrome processing. Protocols for implementing logical CNOTs, joint Pauli measurements, and parity checks typically reference canonical works and circulated papers in conferences such as QIP and IEEE International Conference on Quantum Computing and Engineering (QCE). Implementations often use ancilla patches and lattice rotations to implement transversal or measurement-based logical primitives.
Initialization of logical qubits in X- or Z-basis states is done by preparing physical qubits and measuring boundary stabilizers to project onto code states. Logical measurement of Pauli operators is implemented as large-weight stabilizer readouts or as lattice-surgery joins producing parity outcomes. Entangling gates such as the logical CNOT gate are realized by performing a sequence of merges and splits that effect the same logical map as an encoded CNOT; similarly, state injection and magic state distillation pipelines provide non-Clifford resources for universal computation. These processes are compatible with transversal Pauli frame updates and classical feedforward managed by real-time decoders developed by groups such as Delft University of Technology and Quantum Motion Technologies.
Lattice surgery is designed to be fault-tolerant: repeated local stabilizer measurements and error decoding confine physical errors and propagate only correctable logical errors. Thresholds for reliable operation depend on the noise model and decoder; reported threshold values for surface-code-based lattice-surgery architectures often lie near ~1% physical error rates under circuit-level noise, with improvements under biased-noise models studied by teams including Nicholas P. Breuckmann and Benjamin J. Brown. Decoders used include minimum-weight perfect matching, union-find decoders, and machine-learning-based approaches developed at institutions like Google and academic groups. Threshold analysis informs required code distance and qubit overhead for target logical error rates.
Experimental progress toward lattice surgery has been reported in superconducting qubit systems (e.g., work by IBM and Google), trapped ion arrays (e.g., groups at University of Innsbruck and University of Maryland), and emerging platforms such as silicon spin qubits and Majorana-based proposals studied at Microsoft Research. Demonstrations have included small-scale parity measurements, patch merges, and logical readout consistent with lattice-surgery primitives. Architectures envision two-dimensional nearest-neighbor layouts, modular networks, or networked patch arrays connecting via quantum links in projects such as Quantum Economic Development Consortium collaborations and proposals from Rigetti Computing and academic foundries.
Lattice surgery is a building block for scalable fault-tolerant quantum computing and architectures targeting error-corrected quantum processors for algorithms such as Shor's algorithm, quantum simulation, and quantum chemistry workloads. By reducing routing and ancilla overhead compared to braiding, lattice surgery aids resource estimates and hardware co-design for large-scale machines. It integrates with resource-reduction strategies including logical qubit compression, biased-noise tailoring, and optimized magic state distillation factories, informing roadmaps at industry and research labs such as IBM Research, Microsoft Quantum, and national quantum programs.
Category:Quantum error correction Category:Quantum computing