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

• Leveraging erasure errors in logical qubits with metastable $^{171}$Yb atoms [4.3374029437939114]
  We demonstrate quantum error correcting codes and logical qubit circuits in a metastable $171$Yb qubit with a noise bias towards erasure errors.<n>We show that dephasing errors on the nuclear spin qubit during coherent transport can be strongly suppressed.<n>We demonstrate logical qubit encoding in the $[[4,2,2]]$ code, with error correction during decoding based on mid-circuit erasure measurements.
  arXiv  Detail & Related papers  (2025-06-16T17:29:05Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements. We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate. In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• A Universal Circuit Set Using the $S_3$ Quantum Double [0.5231056284485742]
  We present a quantum double model $mathcalD(S_3)$ -- a specific non-Abelian topological code. We encode each physical degree of freedom of $mathcalD(S_3)$ into a novel, quantum, error-correcting code. Our proposal offers a promising path to realize universal topological quantum computation in the NISQ era.
  arXiv  Detail & Related papers  (2024-11-14T18:58:41Z)
• Error Crafting in Mixed Quantum Gate Synthesis [0.16777183511743468]
  We craft the remnant error of arbitrary single-qubit unitaries to be Pauli and depolarizing errors. For Pauli rotation gates, in particular, the crafting enables us to suppress the remnant error up to cubic order. Our work opens a novel avenue in quantum circuit design and architecture that orchestrates error countermeasures.
  arXiv  Detail & Related papers  (2024-05-24T13:54:11Z)
• 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)
• Error Correction of Quantum Algorithms: Arbitrarily Accurate Recovery Of Noisy Quantum Signal Processing [4.360680431298019]
  We present a first step in achieving error correction at the level of quantum algorithms by combining a unified perspective on modern quantum algorithms via quantum signal processing. Our algorithmic-level error correction method is applied to Grover's fixed-point search algorithm as a demonstration.
  arXiv  Detail & Related papers  (2023-01-20T12:56:20Z)
• Single-shot error mitigation by coherent Pauli checks [6.992823294269743]
  We show how to generate samples from the output distribution of a quantum circuit without full-blown error correction. Our approach is based on Coherent Pauli Checks that detect errors in a Clifford circuit.
  arXiv  Detail & Related papers  (2022-12-07T20:03:07Z)
• 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)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• 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)
• 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.