arXiv:2101.09349 · Quantum

A graph-based formalism for surface codes and twists

Rahul Sarkar, Theodore J. Yoder

Published Jul 18, 2024• 6 citations

Abstract

Twist defects in surface codes can be used to encode more logical qubits, improve the code rate, and implement logical gates. In this work we provide a rigorous formalism for constructing surface codes with twists generalizing the well-defined homological formalism introduced by Kitaev for describing CSS surface codes. In particular, we associate a surface code to any graph G embedded on any 2D-manifold, in such a way that (1) qubits are associated to the vertices of the graph, (2) stabilizers are associated to faces, (3) twist defects are associated to odd-degree vertices. In this way, we are able to reproduce the variety of surface codes, with and without twists, in the literature and produce new examples. We also calculate and bound various code properties such as the rate and distance in terms of topological graph properties such as genus, systole, and face-width.

DOI: 10.22331/q-2024-07-18-1416

Related papers

The surface code with a twist

Theodore J. Yoder, Isaac H. Kim

The surface code is one of the most successful approaches to topological quantum error-correction. It boasts the smallest known syndrome extraction circuits and correspondingly largest thresholds. Defect-based logical encodings of a new variety called twists have made it possible to implement the full Clifford group without state distillation. Here we investigate a patch-based encoding involving a modified twist. In our modified formulation, the resulting codes, called triangle codes for the shape of their planar layout, have only weight-four checks and relatively simple syndrome extraction circuits that maintain a high, near surface-code-level threshold. They also use 25% fewer physical qubits per logical qubit than the surface code. Moreover, benefiting from the twist, we can implement all Clifford gates by lattice surgery without the need for state distillation. By a surgical transformation to the surface code, we also develop a scheme of doing all Clifford gates on surface code patches in an atypical planar layout, though with less qubit efficiency than the triangle code. Finally, we remark that logical qubits encoded in triangle codes are naturally amenable to logical tomography, and the smallest triangle code can demonstrate high-pseudothreshold fault-tolerance to depolarizing noise using just 13 physical qubits.

arXiv:1612.04795QuantumApr 25, 2017120 citations

A Hierarchy of Anyon Models Realised by Twists in Stacked Surface Codes

Scruby, TR, Dan E. Browne

Braiding defects in topological stabiliser codes can be used to fault-tolerantly implement logical operations. Twists are defects corresponding to the end-points of domain walls and are associated with symmetries of the anyon model of the code. We consider twists in multiple copies of the 2d surface code and identify necessary and sufficient conditions for considering these twists as anyons: namely that they must be self-inverse and that all charges which can be localised by the twist must be invariant under its associated symmetry. If both of these conditions are satisfied the twist and its set of localisable anyonic charges reproduce the behaviour of an anyonic model belonging to a hierarchy which generalises the Ising anyons. We show that the braiding of these twists results in either (tensor products of) the S gate or (tensor products of) the CZ gate. We also show that for any number of copies of the 2d surface code the application of H gates within a copy and CNOT gates between copies is sufficient to generate all possible twists.

Apr 6, 20205 citations

A Hierarchy of Anyon Models Realised by Twists in Stacked Surface Codes

Thomas R. Scruby, Dan E. Browne

arXiv:1908.07353QuantumApr 6, 20205 citations

Topological quantum codes on compact surfaces with genus g≥2

Clarice Dias de Albuquerque, Reginaldo Palazzo, E.B. Da Silva

In this paper we propose a construction procedure of a class of topological quantum error-correcting codes on surfaces with genus g≥2. This generalizes the toric codes construction. We also tabulate all possible surface codes with genus 2–5. In particular, this construction reproduces the class of codes obtained when considering the embedding of complete graphs Ks, for s≡1 mod 4, on surfaces with appropriate genus. We also show a table comparing the rate of different codes when fixing the distance to 3–5.

Journal of Mathematical PhysicsFeb 1, 200942 citations

A new twist on the Majorana surface code: Bosonic and fermionic defects for fault-tolerant quantum computation

Campbell McLauchlan, Benjámin Béri

Majorana zero modes (MZMs) are promising candidates for topologically-protected quantum computing hardware, however their large-scale use will likely require quantum error correction. Majorana surface codes (MSCs) have been proposed to achieve this. However, many MSC properties remain unexplored. We present a unified framework for MSC "twist defects" – anyon-like objects encoding quantum information. We show that twist defects in MSCs can encode twice the amount of topologically protected information as in qubit-based codes or other MSC encoding schemes. This is due to twists encoding both logical qubits and "logical MZMs," with the latter enhancing the protection microscopic MZMs can offer. We explain how to perform universal computation with logical qubits and logical MZMs while potentially using far fewer resources than in other MSC schemes. All Clifford gates can be implemented on logical qubits by braiding twist defects. We introduce lattice-surgery-based techniques for computing with logical MZMs and logical qubits, achieving the effect of Clifford gates with zero time overhead. We also show that logical MZMs may result in improved spatial overheads for sufficiently low rates of quasi-particle poisoning. Finally, we introduce a novel MSC analogue of transversal gates that achieves encoded Clifford gates in small codes by braiding microscopic MZMs. MSC twist defects thus open new paths towards fault-tolerant quantum computation.

arXiv:2211.11777QuantumJul 10, 20245 citations

Surface codes, the 2D classical Ising model, and non-interacting fermions

Leonard Goff

In this thesis, we consider the task of simulating measurement-based quantum computation (MBQC) on surface code states: the generalization of Kitaev's toric code to graphs embedded on a surface of higher genus. We define a family of higher genus graphs and a simple ordering of single qubit measurements, and find that simulating MBQC on any of the associated surface code states is equivalent to evaluating the inner-product between a product state and a surface code state on another graph. We further find that such an inner-product can always be written as a sum of one or more 2D classical Ising model partition functions, with appropriate couplings. For certain higher genus square lattices, we develop a means to evaluate this partition function in a number of steps that scales polynomially in the number of qubits, but exponentially in the genus of the embedded graph. The method makes use of the transfer matrix formalism for the Ising partition function, and a subsequent mapping to fermion operators. We synthesize these results to relate the simulation of MBQC on certain surface code states to a system of fermions interacting with the encoded qubits of the surface code. We identify a family of states in the code space of the surface code on our higher genus graphs for which MBQC can be simulated efficiently in all parameters, including the genus of the embedded graph. Finally, we identify two connections between the complexity of this task and entanglement.

Jan 1, 20110 citations