NISQ+: Boosting quantum computing power by approximating quantum error
correction
- URL: http://arxiv.org/abs/2004.04794v2
- Date: Tue, 14 Apr 2020 14:24:31 GMT
- Title: NISQ+: Boosting quantum computing power by approximating quantum error
correction
- Authors: Adam Holmes, Mohammad Reza Jokar, Ghasem Pasandi, Yongshan Ding,
Massoud Pedram, Frederic T. Chong
- Abstract summary: We design a method to boost the computational power of near-term quantum computers.
By approximating fully-fledged error correction mechanisms, we can increase the compute volume.
We demonstrate a proof-of-concept that approximate error decoding can be accomplished online in near-term quantum systems.
- Score: 6.638758213186185
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum computers are growing in size, and design decisions are being made
now that attempt to squeeze more computation out of these machines. In this
spirit, we design a method to boost the computational power of near-term
quantum computers by adapting protocols used in quantum error correction to
implement "Approximate Quantum Error Correction (AQEC)." By approximating
fully-fledged error correction mechanisms, we can increase the compute volume
(qubits $\times$ gates, or "Simple Quantum Volume (SQV)") of near-term
machines. The crux of our design is a fast hardware decoder that can
approximately decode detected error syndromes rapidly. Specifically, we
demonstrate a proof-of-concept that approximate error decoding can be
accomplished online in near-term quantum systems by designing and implementing
a novel algorithm in Single-Flux Quantum (SFQ) superconducting logic
technology. This avoids a critical decoding backlog, hidden in all offline
decoding schemes, that leads to idle time exponential in the number of T gates
in a program.
Our design utilizes one SFQ processing module per physical qubit. Employing
state-of-the-art SFQ synthesis tools, we show that the circuit area, power, and
latency are within the constraints of contemporary quantum system designs.
Under pure dephasing error models, the proposed accelerator and AQEC solution
is able to expand SQV by factors between 3,402 and 11,163 on expected near-term
machines. The decoder achieves a $5\%$ accuracy-threshold and pseudo-thresholds
of $\sim$ $5\%, 4.75\%, 4.5\%,$ and $3.5\%$ physical error-rates for code
distances $3, 5, 7,$ and $9$. Decoding solutions are achieved in a maximum of
$\sim 20$ nanoseconds on the largest code distances studied. By avoiding the
exponential idle time in offline decoders, we achieve a $10$x reduction in
required code distances to achieve the same logical performance as alternative
designs.
Related papers
- Demonstrating real-time and low-latency quantum error correction with superconducting qubits [52.08698178354922]
We demonstrate low-latency feedback with a scalable FPGA decoder integrated into a superconducting quantum processor.
We observe logical error suppression as the number of decoding rounds is increased.
The decoder throughput and latency developed in this work, combined with continued device improvements, unlock the next generation of experiments.
arXiv Detail & Related papers (2024-10-07T17:07:18Z) - 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) - Fast Flux-Activated Leakage Reduction for Superconducting Quantum
Circuits [84.60542868688235]
leakage out of the computational subspace arising from the multi-level structure of qubit implementations.
We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation.
We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
arXiv Detail & Related papers (2023-09-13T16:21:32Z) - A Scalable, Fast and Programmable Neural Decoder for Fault-Tolerant
Quantum Computation Using Surface Codes [12.687083899824314]
Quantum error-correcting codes (QECCs) can eliminate the negative effects of quantum noise, the major obstacle to the execution of quantum algorithms.
We propose a scalable, fast, and programmable neural decoding system to meet the requirements of FTQEC for rotated surface codes (RSC)
Our system achieves an extremely low decoding latency of 197 ns, and the accuracy results of our system are close to minimum weight perfect matching (MWPM)
arXiv Detail & Related papers (2023-05-25T06:23:32Z) - The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
We introduce a data efficient neural decoder that exploits the symmetries of the problem.
We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
arXiv Detail & Related papers (2023-04-14T19:46:39Z) - Partially Fault-tolerant Quantum Computing Architecture with
Error-corrected Clifford Gates and Space-time Efficient Analog Rotations [0.5658123802733283]
We propose a quantum computing architecture to close the gap between NISQ and FTQC.
For early-FTQC devices, we can perform roughly $1.72 times 107$ Clifford operations and $3.75 times 104$ arbitrary rotations on 64 logical qubits.
arXiv Detail & Related papers (2023-03-23T11:21:41Z) - 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) - Neural-Network Decoders for Quantum Error Correction using Surface
Codes:A Space Exploration of the Hardware Cost-Performance Trade-Offs [0.07734726150561086]
This work presents a space exploration of fully-connected feed-forward NN decoders for small distance surface codes.
The goal is to optimize the neural network for high decoding performance, while keeping a minimalistic hardware implementation.
We demonstrate that hardware based NN-decoders can achieve high decoding performance comparable to other state-of-the-art decoding algorithms.
arXiv Detail & Related papers (2022-02-11T16:27:14Z) - QECOOL: On-Line Quantum Error Correction with a Superconducting Decoder
for Surface Code [2.2749157557381245]
Surface code (SC) associated with its decoding algorithm is one of the most promising quantum error correction (QEC) methods.
In this paper, we propose an online-QEC algorithm and its hardware implementation with superconducting digital circuits.
Our decoder is simulated on a quantum error simulator for code 5 to 13 and achieves a 1.0% accuracy threshold.
arXiv Detail & Related papers (2021-03-26T01:51:15Z) - Quantum error mitigation as a universal error-minimization technique:
applications from NISQ to FTQC eras [0.9622115055919379]
In the early years of fault-tolerant quantum computing (FTQC), the available code distance and the number of magic states will be restricted.
Here, we integrate quantum error correction and quantum error mitigation into an efficient FTQC architecture.
This scheme will dramatically alleviate the required computational overheads and hasten the arrival of the FTQC era.
arXiv Detail & Related papers (2020-10-08T10:27:29Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z)
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.