Lattice Surgery Translation for Quantum Computation

Abstract

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 alternative to braiding.

code repository: https://github.com/herr-d/LS_translation

References in corpus (34)

• Fault-tolerant quantum computation by anyons
• Surface codes: Towards practical large-scale quantum computation
• Good Quantum Error-Correcting Codes Exist
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Topological quantum memory
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Measurement-based quantum computation
• Resource-efficient linear optical quantum computation
• Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
• Topological fault-tolerance in cluster state quantum computation
• Surface code quantum computing by lattice surgery
• High threshold universal quantum computation on the surface code
• Magic state distillation with low overhead
• Cryogenic Control Architecture for Large-Scale Quantum Computing
• Fast Decoders for Topological Quantum Codes
• Experimental demonstration of topological error correction
• Photonic architecture for scalable quantum information processing in NV-diamond
• Layered architecture for quantum computing
• Charge detection enables free-electron quantum computation
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Exact synthesis of multiqubit Clifford+T circuits
• Strong Resilience of Topological Codes to Depolarization
• Fault-tolerant thresholds for quantum error correction with the surface code
• Multilevel distillation of magic states for quantum computing
• Resource costs for fault-tolerant linear optical quantum computing
• Surface code implementation of block code state distillation
• Fault tolerant architectures for superconducting qubits
• Requirements for fault-tolerant factoring on an atom-optics quantum computer
• Efficient synthesis of probabilistic quantum circuits with fallback
• Towards practical classical processing for the surface code: timing analysis
• An efficient magic state approach to small angle rotations
• Synthesis of Arbitrary Quantum Circuits to Topological Assembly
• Classical Processing Requirements for a Topological Quantum Computing System
• Simple scheme for encoding and decoding a qubit in unknown state for various topological codes

Cited by in corpus (17)

• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Quantum computation with realistic magic state factories
• The ZX calculus is a language for surface code lattice surgery
• Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
• Transversality and lattice surgery: exploring realistic routes towards coupled logical qubits with trapped-ion quantum processors
• Optimization of Lattice Surgery is NP-Hard
• Pseudo-2D superconducting quantum computing circuit for the surface code: the proposal and preliminary tests
• A High Performance Compiler for Very Large Scale Surface Code Computations
• Data centers with quantum random access memory and quantum networks
• Compilation of algorithm-specific graph states for quantum circuits
• Lattice Surgery on the Raussendorf Lattice
• Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation
• A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing
• A Specification Format and a Verification Method of Fault-Tolerant Quantum Circuits
• Leveraging Zero-Level Distillation to Generate High-Fidelity Magic States
• Optimal Scheduling of Graph States via Path Decompositions
• Lattice Surgery Compilation Beyond the Surface Code