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

• URL: http://arxiv.org/abs/2311.10686v4
• Date: Thu, 24 Oct 2024 18:18:48 GMT
• Title: Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation
• Abstract summary: 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.
• Score: 0.618727087412292
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Transversal Fanout for Fault Tolerant Distributed Quantum Computing: Analysis and Application [2.720960618356385]
  We study a resource-efficient approach for implementing logical fanout operations in fault-tolerant distributed quantum computing.<n>We exploit the structure of encoded blocks and the availability of encoded logical operations to construct distributed fanout circuits.
  arXiv  Detail & Related papers  (2026-09-08T04:26:44Z)
• Harvest: Resource-Aware Quantum Compilation for Magic State Protocols [40.10865338207471]
  We present Harvest, a resource-aware compilation approach for lattice-surgery.<n>It co-optimizes magic-state consumption with circuit-aware placement and congestion-aware routing.<n>It achieves an average speedup of $4.83times$ (up to $17.8times$) over sequential execution.
  arXiv  Detail & Related papers  (2026-08-04T08:21:59Z)
• Surface code logical operations on a superconducting quantum processor [66.1042398805403]
  We experimentally realize key elements of patch-based surface-code logical processing on a 107-qubit superconducting quantum processor.<n>Our results advance superconducting surface-code experiments from protected logical memory to active, patch-based fault-tolerant logical operations.
  arXiv  Detail & Related papers  (2026-07-01T21:07:02Z)
• Optimized Compilation of Logical Clifford Circuits [41.67570087491999]
  Gate-by-gate compilation often yields deep circuits.<n>We focus on the compilation of primitives from quantum simulation as single blocks.<n>We introduce a methodology that lifts these primitives into size-invariant, depth-efficient compilation strategies.
  arXiv  Detail & Related papers  (2026-02-13T11:35:11Z)
• Weights to Code: Extracting Interpretable Algorithms from the Discrete Transformer [65.38883376379812]
  We propose the Discrete Transformer, an architecture engineered to bridge the gap between continuous representations and discrete symbolic logic.<n> Empirically, the Discrete Transformer not only achieves performance comparable to RNN-based baselines but crucially extends interpretability to continuous variable domains.
  arXiv  Detail & Related papers  (2026-01-09T12:49:41Z)
• Efficient simulation of logical magic state preparation protocols [0.0]
  We introduce a method for simulating logical magic state preparation protocols under the standard circuit-level noise model.<n>We provide a proof-of-principle numerical simulation that prepares a magic state using such logical Clifford measurements.
  arXiv  Detail & Related papers  (2025-12-29T19:00:05Z)
• Exploiting Movable Logical Qubits for Lattice Surgery Compilation [43.290156259065554]
  We introduce a paradigm shift by exploiting movable logical qubits via teleportation during the logical lattice surgery CNOT gate.<n> Numerical simulations show that the proposed approach can substantially reduce the routed circuit depth.<n>An open-source implementation of our method is available on GitHub.
  arXiv  Detail & Related papers  (2025-12-03T19:00:04Z)
• A Resource Allocating Compiler for Lattice Surgery [0.0]
  We offer a compiler that transforms a quantum circuit into a sequence of lattice surgery operations.<n>Our code is available on GitHub under a permissive software license and we welcome community contributions.
  arXiv  Detail & Related papers  (2025-06-05T04:27:21Z)
• Constant-Overhead Magic State Injection into qLDPC Codes with Error Independence Guarantees [5.090189387045667]
  We introduce a generic and scalable method for magic state injection into logical qubits encoded in qLDPC codes.<n>A central contribution of this work is a rigorous proof that errors affecting the injected magic states remain independent throughout the procedure.
  arXiv  Detail & Related papers  (2025-05-11T13:44:10Z)
• ReF Decompile: Relabeling and Function Call Enhanced Decompile [50.86228893636785]
  The goal of decompilation is to convert compiled low-level code (e.g., assembly code) back into high-level programming languages. This task supports various reverse engineering applications, such as vulnerability identification, malware analysis, and legacy software migration.
  arXiv  Detail & Related papers  (2025-02-17T12:38:57Z)
• Experimental Demonstration of Logical Magic State Distillation [62.77974948443222]
  We present the experimental realization of magic state distillation with logical qubits on a neutral-atom quantum computer. Our approach makes use of a dynamically reconfigurable architecture to encode and perform quantum operations on many logical qubits in parallel.
  arXiv  Detail & Related papers  (2024-12-19T18:38:46Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• A High Performance Compiler for Very Large Scale Surface Code Computations [38.26470870650882]
  We present the first high performance compiler for very large scale quantum error correction. It translates an arbitrary quantum circuit to surface code operations based on lattice surgery. The compiler can process millions of gates using a streaming pipeline at a speed geared towards real-time operation of a physical device.
  arXiv  Detail & Related papers  (2023-02-05T19:06:49Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Quantum algorithms for classical Boolean functions via adaptive measurements: Exponential reductions in space-time resources [0.0]
  We formulate computation of a variety of Boolean functions in the framework of adaptive measurement-based quantum computation. Our results constitute an alternative proof of an old theorem regarding an oracular separation between the power of constant-depth quantum circuits and constant-depth classical circuits.
  arXiv  Detail & Related papers  (2022-11-02T16:33:32Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Intermediate Qutrit-based Improved Quantum Arithmetic Operations with Application on Financial Derivative Pricing [8.69212898769542]
  In some quantum algorithms, arithmetic operations are of utmost importance for resource estimation. In this article, we have incorporated intermediate qutrit approach to realize efficient implementation of all the quantum arithmetic operations. We show that the percentage decrease in the probability of error is significant owing to the fact that we achieve circuit robustness compared to qubit-only works.
  arXiv  Detail & Related papers  (2022-05-31T14:25:51Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)
• Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding [58.720142291102135]
  We define a resource measure for magic, the sought-after property in most fault-tolerant quantum computers. Our formulation is based on bosonic codes, well-studied tools in continuous-variable quantum computation.
  arXiv  Detail & Related papers  (2021-09-27T12:56:01Z)
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules [1.4353812560047186]
  We simulate electrolyte molecules in Li-ion batteries on a fault-tolerant, photonic quantum computer. We focus on the molecules that can provide practical solutions to industrially relevant problems.
  arXiv  Detail & Related papers  (2021-04-21T17:31:22Z)
• On the realistic worst case analysis of quantum arithmetic circuits [69.43216268165402]
  We show that commonly held intuitions when designing quantum circuits can be misleading. We show that reducing the T-count can increase the total depth. We illustrate our method on addition and multiplication circuits using ripple-carry.
  arXiv  Detail & Related papers  (2021-01-12T21:36:16Z)
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits [1.2891210250935146]
  We introduce a new concept which we call redundant ancilla encoding. We show that our scheme can produce magic states using an order of magnitude fewer qubits and space-time overhead.
  arXiv  Detail & Related papers  (2020-03-06T06:24:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.