Robust Error Accumulation Suppression
- URL: http://arxiv.org/abs/2401.16884v1
- Date: Tue, 30 Jan 2024 10:38:53 GMT
- Title: Robust Error Accumulation Suppression
- Authors: Tatsuki Odake, Philip Taranto, Nobuyuki Yoshioka, Toshinari Itoko,
Kunal Sharma, Antonio Mezzacapo, and Mio Murao
- Abstract summary: We present an advanced quantum error suppression technique, which we dub robust error accumulation suppression (REAS)
Our results apply to a strictly larger class of circuits than those comprising only Clifford gates.
REAS makes no assumption on the cleanness of the error-suppressing protocol itself.
- Score: 0.6282171844772421
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We present an advanced quantum error suppression technique, which we dub
robust error accumulation suppression (REAS). Our method reduces the
accumulation of errors in any circuit composed of single- or two-qubit gates
expressed as $e^{-i \sigma\theta }$ for Pauli operators $\sigma$ and $\theta
\in [0,\pi)$; since such gates form a universal gate set, our results apply to
a strictly larger class of circuits than those comprising only Clifford gates,
thereby generalizing previous results. In the case of coherent errors -- which
include crosstalk -- we demonstrate a reduction of the error scaling in an
$L$-depth circuit from $O(L)$ to $O(\sqrt{L})$. Crucially, REAS makes no
assumption on the cleanness of the error-suppressing protocol itself and is,
therefore, truly robust, applying to situations in which the newly inserted
gates have non-negligible coherent noise. Furthermore, we show that REAS can
also suppress certain types of decoherence noise by transforming some gates to
be robust against such noise, which is verified by the demonstration of the
quadratic suppression of error scaling in the numerical simulation. Our
results, therefore, present an advanced, robust method of error suppression
that can be used in conjunction with error correction as a viable path toward
fault-tolerant quantum computation.
Related papers
- Fault-tolerant quantum computation using large spin cat-codes [0.8640652806228457]
We construct a fault-tolerant quantum error-correcting protocol based on a qubit encoded in a large spin qudit using a spin-cat code.
We show how to generate a universal gate set, including the rank-preserving CNOT gate, using quantum control and the Rydberg blockade.
These findings pave the way for encoding a qubit in a large spin with the potential to achieve fault tolerance, high threshold, and reduced resource overhead in quantum information processing.
arXiv Detail & Related papers (2024-01-08T22:56:05Z) - 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) - Demonstrating a long-coherence dual-rail erasure qubit using tunable transmons [59.63080344946083]
We show that a "dual-rail qubit" consisting of a pair of resonantly coupled transmons can form a highly coherent erasure qubit.
We demonstrate mid-circuit detection of erasure errors while introducing $ 0.1%$ dephasing error per check.
This work establishes transmon-based dual-rail qubits as an attractive building block for hardware-efficient quantum error correction.
arXiv Detail & Related papers (2023-07-17T18:00:01Z) - Benchmarking quantum logic operations relative to thresholds for fault
tolerance [0.02171671840172762]
We use gate set tomography to perform precision characterization of a set of two-qubit logic gates to study RC on a superconducting quantum processor.
We show that the average and worst-case error rates are equal for randomly compiled gates, and measure a maximum worst-case error of 0.0197(3) for our gate set.
arXiv Detail & Related papers (2022-07-18T17:41:58Z) - The Accuracy vs. Sampling Overhead Trade-off in Quantum Error Mitigation
Using Monte Carlo-Based Channel Inversion [84.66087478797475]
Quantum error mitigation (QEM) is a class of promising techniques for reducing the computational error of variational quantum algorithms.
We consider a practical channel inversion strategy based on Monte Carlo sampling, which introduces additional computational error.
We show that when the computational error is small compared to the dynamic range of the error-free results, it scales with the square root of the number of gates.
arXiv Detail & Related papers (2022-01-20T00:05:01Z) - Experimental Characterization of Fault-Tolerant Circuits in Small-Scale
Quantum Processors [67.47400131519277]
A code's logical gate set may be deemed fault-tolerant for gate sequences larger than 10 gates.
Some circuits did not satisfy the fault tolerance criterion.
It is most accurate to assess the fault tolerance criterion when the circuits tested are restricted to those that give rise to an output state with a low dimension.
arXiv Detail & Related papers (2021-12-08T01:52:36Z) - Software mitigation of coherent two-qubit gate errors [55.878249096379804]
Two-qubit gates are important components of quantum computing.
But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications.
We present two software methods to mitigate parasitic two-qubit gate errors.
arXiv Detail & Related papers (2021-11-08T17:37:27Z) - Engineering fast bias-preserving gates on stabilized cat qubits [64.20602234702581]
bias-preserving gates can significantly reduce resource overhead for fault-tolerant quantum computing.
In this work, we apply a derivative-based leakage suppression technique to overcome non-adiabatic errors.
arXiv Detail & Related papers (2021-05-28T15:20:21Z) - Hidden Inverses: Coherent Error Cancellation at the Circuit Level [3.3012851255362494]
Coherent gate errors are a concern in many proposed quantum computing architectures.
We benchmark our coherent errors by comparing the actual performance of composite single-qubit gates to the predicted performance.
We propose a compilation technique, which we refer to as hidden inverses, that creates circuits robust to these coherent errors.
arXiv Detail & Related papers (2021-04-02T15:57:48Z) - Exponential Error Suppression for Near-Term Quantum Devices [0.0]
In NISQ era, complexity and scale required to adopt even the smallest QEC is prohibitive.
We show that for the crucial case of estimating expectation values of observables one can indeed achieve an effective exponential suppression.
arXiv Detail & Related papers (2020-11-11T18:00:38Z)
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.