A Resource Allocating Compiler for Lattice Surgery
- URL: http://arxiv.org/abs/2506.04620v1
- Date: Thu, 05 Jun 2025 04:27:21 GMT
- Title: A Resource Allocating Compiler for Lattice Surgery
- Authors: Alan Robertson, Haowen Gao, Yuval R. Sanders,
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The emerging field of quantum resource estimation is aimed at providing estimates of the hardware requirements (`quantum resources') needed to execute a useful, fault-tolerant quantum computation. Given that quantum computers are intended to compete with supercomputers, useful quantum computations are likely to involve the use of millions of qubits and error correction clock cycles. The compilation and benchmarking of these circuits depends on placement and routing algorithms, which are infeasible to construct at scale by hand. We offer a compiler that transforms a quantum circuit into a sequence of lattice surgery operations. The compiler manages memory in terms of surface code patches and costs the space-time volume and cycle counts of the input circuits. These compiled lattice surgery objects are then recursively repurposed as gates for larger scale compilations. Our code is available on GitHub under a permissive software license and we welcome community contributions.
Related papers
- Optimization and Synthesis of Quantum Circuits with Global Gates [44.99833362998488]
We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
arXiv Detail & Related papers (2025-07-28T10:25:31Z) - Constant-time hybrid compilation of Shor's algorithm with quantum just-in-time compilation [0.0]
This work provides an implementation of Shor's factoring algorithm, compiled to elementary quantum gates using PennyLane and Catalyst.<n>We demonstrate that with QJIT compilation, the algorithm is compiled once per bit width of $N$, even when $N$-specific optimizations are applied to circuit generation.<n>The implementation is benchmarked up to 32-bit $N$, and both the size of the compiled program and the pure compilation time are found to be constant.
arXiv Detail & Related papers (2025-04-16T19:30:10Z) - Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - 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) - The Basis of Design Tools for Quantum Computing: Arrays, Decision
Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
Quantum computers promise to efficiently solve important problems classical computers never will.
A fully automated quantum software stack needs to be developed.
This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
arXiv Detail & Related papers (2023-01-10T19:00:00Z) - 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) - Quantum Circuit Compiler for a Shuttling-Based Trapped-Ion Quantum
Computer [26.47874938214435]
We present a compiler capable of transforming and optimizing a quantum circuit targeting a shuttling-based trapped-ion quantum processor.
The results show that the gate counts can be reduced by factors up to 5.1 compared to standard Pytket and up to 2.2 compared to standard Qiskit compilation.
arXiv Detail & Related papers (2022-07-05T11:21:09Z) - Arline Benchmarks: Automated Benchmarking Platform for Quantum Compilers [0.0]
Open-source software package, Arline Benchmarks, is designed to perform automated benchmarking of quantum compilers.
We compare several quantum compilation frameworks based on a set of important metrics.
We propose a concept of composite compilation pipeline that combines compiler-specific circuit optimizations in a single compilation stack.
arXiv Detail & Related papers (2022-02-28T18:48:01Z) - Extending C++ for Heterogeneous Quantum-Classical Computing [56.782064931823015]
qcor is a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context.
Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language manner.
arXiv Detail & Related papers (2020-10-08T12:49:07Z) - Efficient simulatability of continuous-variable circuits with large
Wigner negativity [62.997667081978825]
Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures.
We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable.
We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
arXiv Detail & Related papers (2020-05-25T11:03:42Z)
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.