Lightcone shading for classically accelerated quantum error mitigation

• URL: http://arxiv.org/abs/2409.04401v1
• Date: Fri, 6 Sep 2024 16:48:09 GMT
• Title: Lightcone shading for classically accelerated quantum error mitigation
• Authors: Andrew Eddins, Minh C. Tran, Patrick Rall,
• Abstract summary: Quantum error mitigation (QEM) can recover accurate expectation values from a noisy quantum computer by trading off bias for variance. Probabilistic error cancellation (PEC) stands out among QEM methods as an especially robust means of controllably eliminating bias. We present an algorithm providing a practical benefit for some problems even with modest classical resources.
• Score: 1.1801688624472007
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum error mitigation (QEM) can recover accurate expectation values from a noisy quantum computer by trading off bias for variance, such that an averaged result is more accurate but takes longer to converge. Probabilistic error cancellation (PEC) stands out among QEM methods as an especially robust means of controllably eliminating bias. However, PEC often exhibits a much larger variance than other methods, inhibiting application to large problems for a given error rate. Recent analyses have shown that the variance of PEC can be reduced by not mitigating errors lying outside the causal lightcone of the desired observable. Here, we improve the lightcone approach by classically computing tighter bounds on how much each error channel in the circuit can bias the final result. This set of bounds, which we refer to as a "shaded lightcone," enables a more targeted application of PEC, improving the tradespace of bias and variance, while illuminating how the structure of a circuit determines the difficulty of error-mitigated computation. Although a tight shaded lightcone is exponentially hard to compute, we present an algorithm providing a practical benefit for some problems even with modest classical resources, leveraging the ease of evolving an error instead of the state or the observable. The algorithm reduces the runtime that would be needed to apply PEC for a target accuracy in an example 127-qubit Trotter circuit by approximately two orders of magnitude compared to standard lightcone-PEC, expanding the domain of problems that can be computed via direct application of PEC on noisy hardware.

Related papers

• Low bit-flip rate probabilistic error cancellation [0.0]
  Noise remains one of the most significant challenges in the development of reliable and scalable quantum processors. In this work, we explore how the unique noise bias of cat-qubits can be harnessed to enhance error mitigation efficiency.
  arXiv  Detail & Related papers  (2024-11-10T11:04:16Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Quantum Error Mitigated Classical Shadows [0.0]
  We consider error mitigation techniques, such as Probabilistic Error Cancellation (PEC), Zero Noise Extrapolation (ZNE) and Symmetry Verification (SV) PEC shadows are an unbiased estimator for the ideal quantum state $rho_id$. The broad set of tools introduced in this work may be instrumental in exploiting near-term and early fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2023-05-08T18:00:09Z)
• Locality and Error Mitigation of Quantum Circuits [0.7366405857677226]
  We study and improve two leading error mitigation techniques, namely Probabilistic Error Cancellation (PEC) and Zero-Noise Extrapolation (ZNE) For PEC, we introduce a new estimator that takes into account the light cone of the unitary circuit with respect to a target local observable.
  arXiv  Detail & Related papers  (2023-03-11T20:43:36Z)
• 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)
• Automated quantum error mitigation based on probabilistic error reduction [0.9236074230806579]
  Current quantum computers suffer from a level of noise that prohibits extracting useful results directly from longer computations. We present an automated quantum error mitigation software framework that includes noise tomography and application of PER to user-specified circuits.
  arXiv  Detail & Related papers  (2022-10-16T19:09:41Z)
• Volumetric Benchmarking of Error Mitigation with Qermit [0.0]
  We develop a methodology to assess the performance of quantum error mitigation techniques. Our benchmarks are volumetric in design, and are performed on different superconducting hardware devices. Qermit is an open source python package for quantum error mitigation.
  arXiv  Detail & Related papers  (2022-04-20T18:13:04Z)
• 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)
• 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)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Accelerated Convergence for Counterfactual Learning to Rank [65.63997193915257]
  We show that convergence rate of SGD approaches with IPS-weighted gradients suffers from the large variance introduced by the IPS weights. We propose a novel learning algorithm, called CounterSample, that has provably better convergence than standard IPS-weighted gradient descent methods. We prove that CounterSample converges faster and complement our theoretical findings with empirical results.
  arXiv  Detail & Related papers  (2020-05-21T12:53:36Z)

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.