Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation

Abstract

We report a resource estimation pipeline that explicitly compiles quantum circuits expressed using the Clifford+T gate set into a surface code lattice surgery instruction set. The cadence of magic state requests from the compiled circuit enables the optimization of magic state distillation and storage requirements in a post-hoc analysis. To compile logical circuits into lattice surgery operations, we build upon the open-source Lattice Surgery Compiler. The revised compiler operates in two stages: the first translates logical gates into an abstract, layout-independent instruction set; the second compiles these into local lattice surgery instructions that are allocated to hardware tiles according to a specified resource layout. The second stage retains logical parallelism while avoiding resource contention in the fault-tolerant layer, aiding realism. Additionally, users can specify dedicated tiles at which magic states are replenished, enabling resource costs from the logical computation to be considered independently from magic state distillation and storage. We demonstrate the applicability of our pipeline to large, practical quantum circuits by providing resource estimates for the ground state estimation of molecules. We find that variable magic state consumption rates in real circuits can cause the resource costs of magic state storage to dominate unless production is varied to suit.

28 pages, 10 figures

References in corpus (30)

• Surface codes: Towards practical large-scale quantum computation
• Quantum Error Correction for Quantum Memories
• Suppressing quantum errors by scaling a surface code logical qubit
• Roads towards fault-tolerant universal quantum computation
• Surface code quantum computing by lattice surgery
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Building a fault-tolerant quantum computer using concatenated cat codes
• Fault-tolerant operation of a logical qubit in a diamond quantum processor
• Magic State Distillation: Not as Costly as You Think
• High-Fidelity Bell-State Preparation with ${}^{40}$Ca${}^{+}$ Optical Qubits
• Poking holes and cutting corners to achieve Clifford gates with the surface code
• Factoring 2048-bit RSA Integers in 177 Days with 13436 Qubits and a Multimode Memory
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
• A magic state's fidelity can be superior to the operations that created it
• Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Assessing requirements to scale to practical quantum advantage
• Surface code compilation via edge-disjoint paths
• Low overhead quantum computation using lattice surgery
• High fidelity state preparation and measurement of ion hyperfine qubits with I > 1/2
• Code Deformation and Lattice Surgery Are Gauge Fixing
• Demonstration of logical qubits and repeated error correction with better-than-physical error rates
• Optimization of Lattice Surgery is NP-Hard
• A circuit-level protocol and analysis for twist-based lattice surgery
• Lattice Surgery Translation for Quantum Computation
• A High Performance Compiler for Very Large Scale Surface Code Computations
• Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections
• TISCC: A Surface Code Compiler and Resource Estimator for Trapped-Ion Processors
• An Architecture for Improved Surface Code Connectivity in Neutral Atoms
• Some improvements to product formula circuits for Hamiltonian simulation

Cited by in corpus (4)

• Synchronization for Fault-Tolerant Quantum Computers
• Locality-aware Pauli-based computation for local magic state preparation
• Logical Error Rates for the Surface Code Under a Mixed Coherent and Stochastic Circuit-Level Noise Model Inspired by Trapped Ions
• Quantum resource estimates for computing binary elliptic curve discrete logarithms