Qubit-efficient exponential suppression of errors

• URL: http://arxiv.org/abs/2102.06056v2
• Date: Wed, 24 Mar 2021 20:48:01 GMT
• Title: Qubit-efficient exponential suppression of errors
• Authors: Piotr Czarnik, Andrew Arrasmith, Lukasz Cincio, Patrick J. Coles
• Abstract summary: Recent breakthroughs have introduced methods capable of exponentially suppressing errors. We present an alternative method that adapts this breakthrough to much fewer qubits by making use of active qubit resets. We find that REQUEST can reproduce the exponential suppression of errors of the virtual distillation approach, while out-performing virtual distillation when fewer than $3N+1$ qubits are available.
• Score: 0.8258451067861933
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Achieving a practical advantage with near-term quantum computers hinges on having effective methods to suppress errors. Recent breakthroughs have introduced methods capable of exponentially suppressing errors by preparing multiple noisy copies of a state and virtually distilling a more purified version. Here we present an alternative method, the Resource-Efficient Quantum Error Suppression Technique (REQUEST), that adapts this breakthrough to much fewer qubits by making use of active qubit resets, a feature now available on commercial platforms. Our approach exploits a space/time trade-off to achieve a similar error reduction using only $2N+1$ qubits as opposed to $MN+1$ qubits, for $M$ copies of an $N$ qubit state. Additionally, we propose a method using near-Clifford circuits to find the optimal number of these copies in the presence of realistic noise, which limits this error suppression. We perform a numerical comparison between the original method and our qubit-efficient version with a realistic trapped-ion noise model. We find that REQUEST can reproduce the exponential suppression of errors of the virtual distillation approach, while out-performing virtual distillation when fewer than $3N+1$ qubits are available. Finally, we examine the scaling of the number of shots $N_S$ required for REQUEST to achieve useful corrections. We find that $N_S$ remains reasonable well into the quantum advantage regime where $N$ is hundreds of qubits.

Related papers

• Quantum error correction below the surface code threshold [107.92016014248976]
  Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-24T23:08:50Z)
• Scalable 3D Registration via Truncated Entry-wise Absolute Residuals [65.04922801371363]
  A $3$D registration approach can process more than ten million ($107$) point pairs with over $99%$ random outliers. We call our method TEAR, as it involves minimizing an outlier-robust loss that computes Truncated Entry-wise Absolute Residuals.
  arXiv  Detail & Related papers  (2024-04-01T04:43:39Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• 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)
• Development and Demonstration of an Efficient Readout Error Mitigation Technique for use in NISQ Algorithms [2.1279211992135068]
  We consider the approximate state estimation of readout-mitigated expectation values on the Rigetti quantum computing hardware. We show that we can suppress the effect of correlated errors and accurately mitigate the readout errors. This development opens the way for practical uses of methods with this type of randomisation.
  arXiv  Detail & Related papers  (2023-03-30T23:29:13Z)
• Logical shadow tomography: Efficient estimation of error-mitigated observables [11.659279774157255]
  We introduce a technique to estimate error-mitigated expectation values on noisy quantum computers. Our technique performs shadow tomography on a logical state to produce a memory-efficient classical reconstruction of the noisy density matrix. Relative to virtual distillation, our technique can compute powers of the density matrix without additional copies of quantum states or quantum memory.
  arXiv  Detail & Related papers  (2022-03-14T16:42:22Z)
• Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Verification [151.62491805851107]
  We develop $beta$-CROWN, a bound propagation based verifier that can fully encode per-neuron splits. $beta$-CROWN is close to three orders of magnitude faster than LP-based BaB methods for robustness verification. By terminating BaB early, our method can also be used for incomplete verification.
  arXiv  Detail & Related papers  (2021-03-11T11:56:54Z)
• Virtual Distillation for Quantum Error Mitigation [0.6745502291821955]
  Quantum computers have relatively high levels of noise, making it difficult to use them to perform useful calculations. We propose a near-term friendly strategy to mitigate errors by entangling and measuring $M$ copies of a noisy state. We demonstrate that virtual distillation is capable of suppressing errors by multiple orders of magnitude and explain how this effect is enhanced as the system size grows.
  arXiv  Detail & Related papers  (2020-11-13T18:58:31Z)
• 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)
• Eliminating Leakage Errors in Hyperfine Qubits [0.0]
  Population leakage outside the qubit subspace presents a particularly harmful source of error. We show an optical pumping scheme to suppress leakage errors in atomic hyperfine qubits.
  arXiv  Detail & Related papers  (2019-12-31T00:55:43Z)

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.