In recent years, surface codes have become a leading method for quantum error correction in theoretical large scale computational and communications architecture designs. Their comparatively high fault-tolerant thresholds and their natural 2-dimensional nearest neighbour (2DNN) structure make them an obvious choice for large scale designs in experimentally realistic systems. While fundamentally based on the toric code of Kitaev, there are many variants, two of which are the planar- and defect- based codes. Planar codes require fewer qubits to implement (for the same strength of error correction), but are restricted to encoding a single qubit of information. Interactions between encoded qubits are achieved via transversal operations, thus destroying the inherent 2DNN nature of the code. In this paper we introduce a new technique enabling the coupling of two planar codes without transversal operations, maintaining the 2DNN of the encoded computer. Our lattice surgery technique comprises splitting and merging planar code surfaces, and enables us to perform universal quantum computation (including magic state injection) while removing the need for braided logic in a strictly 2DNN design, and hence reduces the overall qubit resources for logic operations. Those resources are further reduced by the use of a rotated lattice for the planar encoding. We show how lattice surgery allows us to distribute encoded GHZ states in a more direct (and overhead friendly) manner, and how a demonstration of an encoded CNOT between two distance 3 logical states is possible with 53 physical qubits, half of that required in any other known construction in 2D.
We demonstrate how to use lattice surgery to enact a universal set of fault-tolerant quantum operations with color codes. Along the way, we also improve existing surface-code lattice-surgery methods. Lattice-surgery methods use fewer qubits and the same time or less than associated defect-braiding methods. Furthermore, per code distance, color-code lattice surgery uses approximately half the qubits and the same time or less than surface-code lattice surgery. Color-code lattice surgery can also implement the Hadamard and phase gates in a single transversal step---much faster than surface-code l…
Lattice surgery is a method to perform quantum computation fault-tolerantly by using operations on boundary qubits between different patches of the planar code. This technique allows for universal planar-code computation without eliminating the intrinsic two-dimensional nearest-neighbor properties of the surface code that eases physical hardware implementations. Lattice-surgery approaches to algorithmic compilation and optimization have been demonstrated to be more resource efficient for resource-intensive components of a fault-tolerant algorithm, and consequently may be preferable over braid-…
In this paper we outline a method for a compiler to translate any non fault tolerant quantum circuit to the geometric representation of the lattice surgery error-correcting code using inherent merge and split operations. Since the efficiency of state distillation procedures has not yet been investigated in the lattice surgery model, their translation is given as an example using the proposed method. The resource requirements seem comparable to the defect-based state distillation process, but modularity and eventual implementability allow the lattice surgery model to be an interesting alternati…
Lattice surgery is a measurement-based technique for performing fault-tolerant quantum computation in two dimensions. When using the surface code, the most general lattice surgery operations require lattice irregularities called twist defects. However, implementing twist-based lattice surgery may require additional resources, such as extra device connectivity, and could lower the threshold and overall performance for the surface code. Here we provide an explicit twist-based lattice surgery protocol and its requisite connectivity layout. We also provide new stabilizer measurement circuits for m…
We observe that lattice surgery, a model of fault-tolerant qubit computation, generalises straightforwardly to arbitrary finite-dimensional qudits. The generalised model is based on the group algebras $\mathbb{C}\mathbb{Z}_d$ for $d \geq 2$. It still requires magic state injection for universal quantum computation. We relate the model to the ZX-calculus, a diagrammatic language based on Hopf-Frobenius algebras.
Lattice surgery protocols allow for the efficient implementation of universal gate sets with two-dimensional topological codes where qubits are constrained to interact with one another locally. In this work, we first introduce a decoder capable of correcting spacelike and timelike errors during lattice surgery protocols. Afterwards, we compute logical failure rates of a lattice surgery protocol for a biased circuit-level noise model. We then provide a new protocol for performing twist-free lattice surgery, where we avoid twist defects in the bulk of the lattice. Our twist-free protocol elimina…
Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice
The University of Tokyo（东京大学）；NTT Computer and Data Science Laboratories, NTT Corporation（日本电信电话公司计算机与数据科学实验室）；JST, PRESTO（日本科学技术振兴机构 PRESTO 项目）；Center for Quantum Computing, RIKEN（理化学研究所量子计算中心）；Faculty of Information Science and Technology, Hokkaido University（北海道大学信息科学技术学院）
Future quantum computers will require quantum error correction for faithful operation. The correction capabilities come with an overhead for performing fault-tolerant logical operations on the encoded qubits. One of the most resource efficient ways to implement logical operations is lattice surgery, where groups of physical qubits, arranged on lattices, can be merged and split to realize entangling gates and teleport logical information. Here, we report on the experimental realization of lattice surgery between two topologically encoded qubits in a 10-qubit ion trap quantum information process…
The traditional method for computation in either the surface code or in the Raussendorf model is the creation of holes or "defects" within the encoded lattice of qubits that are manipulated via topological braiding to enact logic gates. However, this is not the only way to achieve universal, fault-tolerant computation. In this work, we focus on the Lattice Surgery representation, which realizes transversal logic operations without destroying the intrinsic 2D nearest-neighbor properties of the braid-based surface code and achieves universality without defects and braid based logic. For both tec…
Fault-tolerant quantum computers, with error correction implemented using topological codes, will most likely require lattice surgery protocols in order to implement a universal gate set. Timelike failures during lattice surgery protocols can result in logical failures during the execution of an algorithm. In addition to the spacelike distance of the topological code used to protect the qubits from errors, there is also the timelike distance which is given by the number of syndrome measurement rounds during a lattice surgery protocol. As such, a larger timelike distance requirement will result…
When calculating the overhead of a quantum algorithm made fault-tolerant using the surface code, many previous works have used defects and braids for logical qubit storage and state distillation. In this work, we show that lattice surgery reduces the storage overhead by over a factor of 4, and the distillation overhead by nearly a factor of 5, making it possible to run algorithms with $10^8$ T gates using only $3.7\times 10^5$ physical qubits capable of executing gates with error $p\sim 10^{-3}$. These numbers strongly suggest that defects and braids in the surface code should be deprecated in…
The large-scale execution of quantum algorithms requires basic quantum operations to be implemented fault-tolerantly. The most popular technique for accomplishing this, using the devices that can be realised in the near term, uses stabilizer codes which can be embedded in a planar layout. The set of fault-tolerant operations which can be executed in these systems using unitary gates is typically very limited. This has driven the development of measurement-based schemes for performing logical operations in these codes, known as lattice surgery and code deformation. In parallel, gauge fixing has…
Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery
Universität Innsbruck（因斯布鲁克大学）；Technische Universität Wien（维也纳工业大学）；Institute for Theoretical Physics, University of Innsbruck（因斯布鲁克大学理论物理研究所）；neQxt GmbH（neQxt有限公司）；Alpine Quantum Technologies GmbH（阿尔卑斯量子技术有限公司）
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 …
Resource consumption of the conventional surface code is expensive, in part due to the need to separate the defects that create the logical qubit far apart on the physical qubit lattice. We propose that instantiating the deformation-based surface code using superstabilizers makes it possible to detect short error chains connecting the superstabilizers, allowing us to place logical qubits close together. Additionally, we demonstrate the process of conversion from the defect-based surface code, which works as arbitrary state injection, and a lattice surgery-like CNOT gate implementation that req…
Lattice surgery for near-term experimental logical qubit entanglement creation in planar architectures
Institute for Theoretical Nanoelectronics (PGI-2), Forschungszentrum Jülich（于利希研究中心理论纳米电子学研究所）；Institute for Quantum Information, RWTH Aachen University（亚琛工业大学量子信息研究所）；Department of Physics, ETH Zurich（苏黎世联邦理工学院物理系）；ETH Zurich - PSI Quantum Computing Hub, Paul Scherrer Institute（保罗谢勒研究所苏黎世联邦理工学院-PSI量子计算中心）；Quantum Center, ETH Zurich（苏黎世联邦理工学院量子中心）
Quantum error correction (QEC) and fault-tolerant (FT) mechanisms are essential for reliable quantum computing. However, QEC considerably increases the computation size up to four orders of magnitude. Moreover, FT implementation has specific requirements on qubit layouts, causing both resource and time overhead. Reducing spatial-temporal costs becomes critical since it is beneficial to decrease the failure rate of quantum computation. To this purpose, scalable qubit plane architectures and efficient mapping passes including placement and routing of qubits as well as scheduling of operations ar…
O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling
The Hong Kong University of Science and Technology (Guangzhou)（香港科技大学（广州））；College of Computer Science and Technology National University of Defense Technology（国防科技大学计算机学院）
Remote Entanglement in Lattice Surgery: To Distill, or Not to Distill
Duke University（杜克大学）；Lawrence Berkeley National Laboratory（劳伦斯伯克利国家实验室）；North Carolina State University（北卡罗来纳州立大学）；University of California, Berkeley（加州大学伯克利分校）
We present a planar surface-code-based scheme for fault-tolerant quantum computation which eliminates the time overhead of single-qubit Clifford gates, and implements long-range multi-target CNOT gates with a time overhead that scales only logarithmically with the control-target separation. This is done by replacing hardware operations for single-qubit Clifford gates with a classical tracking protocol. Inter-qubit communication is added via a modified lattice surgery protocol that employs twist defects of the surface code. The long-range multi-target CNOT gates facilitate magic state distillat…
Active quantum error correction has been identified as a crucial ingredient of future quantum computers, motivating the recent experimental efforts to encode logical quantum bits using small topological codes. In addition to the demonstration of the beneficial role of the encoding, a break-even point in the progress towards large-scale quantum computers will be the implementation of a universal set of gates. This mid-term challenge will soon be faced by various quantum technologies, which urges the need of realistic assessments of their prospects. In this work, we pursue this goal by assessing…
Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation
Graduate School of Information Science and Technology, The University of Tokyo（东京大学大学院信息理工学系研究科）；Center for Quantum Computing, RIKEN（理化学研究所量子计算中心）；Faculty of Information Science and Electrical Engineering, Kyushu University（九州大学情报理工学府）；International Center for Elementary Particle Physics, The University of Tokyo（东京大学国际基本粒子物理中心）
Scaling roadmap for modular trapped-ion QEC and lattice-surgery teleportation
Instituto de Física Teórica UAM-CSIC, Universidad Autónoma de Madrid（马德里自治大学理论物理研究所）；Institute for Quantum Electronics, ETH Zürich（苏黎世联邦理工学院量子电子学研究所）；School of Electrical and Computer Engineering, Cornell University（康奈尔大学电气与计算机工程学院）；Universität Innsbruck, Institut für Experimentalphysik（因斯布鲁克大学实验物理研究所）；Institute for Quantum Information, RWTH Aachen University（亚琛工业大学量子信息研究所）；Institute for Theoretical Nanoelectronics (PGI-2), Forschungszentrum Jülich（于利希研究中心理论纳米电子学研究所）
