A High Performance Compiler for Very Large Scale Surface Code Computations
- URL: http://arxiv.org/abs/2302.02459v3
- Date: Thu, 16 May 2024 08:11:41 GMT
- Title: A High Performance Compiler for Very Large Scale Surface Code Computations
- Authors: George Watkins, Hoang Minh Nguyen, Keelan Watkins, Steven Pearce, Hoi-Kwan Lau, Alexandru Paler,
- Abstract summary: 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.
- Score: 38.26470870650882
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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. Our compiler offers an end to end error correction workflow implemented by a pluggable architecture centered around an intermediate representation of lattice surgery instructions. Moreover, the compiler supports customizable circuit layouts, can be used for quantum benchmarking and includes a quantum resource estimator. The compiler can process millions of gates using a streaming pipeline at a speed geared towards real-time operation of a physical device. We compiled within seconds 80 million logical surface code instructions, corresponding to a high precision Clifford+T implementation of the 128-qubit Quantum Fourier Transform (QFT). Our code is open-sourced at \url{https://github.com/latticesurgery-com}.
Related papers
- 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.
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.
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) - Distributed Architecture for FPGA-based Superconducting Qubit Control [7.804530685405802]
Quantum circuits utilizing real time feedback techniques are a powerful tool for NISQ-era quantum computing.
We have developed a custom FPGA-based processor architecture for QubiC, an open source platform for superconducting qubit control.
We will detail the design of both the processor and compiler stack, and demonstrate its capabilities with a quantum state teleportation experiment.
arXiv Detail & Related papers (2024-04-23T17:47:31Z) - Dependency-Aware Compilation for Surface Code Quantum Architectures [7.543907169342984]
We study the problem of compiling quantum circuits for quantum computers implementing surface codes.
We solve this problem efficiently and near-optimally with a novel algorithm.
Our evaluation shows that our approach is powerful and flexible for compiling realistic workloads.
arXiv Detail & Related papers (2023-11-29T19:36:19Z) - Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance.
Here we report on a strategy that can overcome such problems.
We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
arXiv Detail & Related papers (2023-08-04T13:39:46Z) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes.
We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code.
We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
arXiv Detail & Related papers (2020-12-07T23:22:40Z) - 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) - Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP.
The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth.
We present empiric evidence for the feasibility of learning the layout method using approximation.
arXiv Detail & Related papers (2020-07-29T05:26:19Z)
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.