Reducing PEC Overhead by Pauli Error Propagation

• URL: http://arxiv.org/abs/2412.01311v1
• Date: Mon, 02 Dec 2024 09:25:40 GMT
• Title: Reducing PEC Overhead by Pauli Error Propagation
• Authors: Timon Scheiber, Paul Haubenwallner, Matthias Heller,
• Abstract summary: Quantum error mitigation is regarded as a path to near-term quantum utility.<n>We present a method for reducing the sampling overhead of PEC on Clifford circuits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum error mitigation is regarded as a possible path to near-term quantum utility. The methods under the quantum error mitigation umbrella term, such as probabilistic error cancellation, zero-noise extrapolation or Clifford data regression are able to significantly reduce the error for the estimation of expectation values, although at an exponentially scaling cost, i.e., in the sampling overhead. In this work, we present a straightforward method for reducing the sampling overhead of PEC on Clifford circuits (and Clifford subcircuits) via Pauli error propagation alongside some classical preprocessing. While the methods presented in this work are restricted to Clifford circuits, we argue that Clifford sub circuits often occur in relevant calculations as for example the resource state generation in measurement based quantum computing.

Related papers

• Clifford and Non-Clifford Splitting in Quantum Circuits: Applications and ZX-Calculus Detection Procedure [49.1574468325115]
  We propose and analyze use cases that come from quantum circuits that can be written as product between a Clifford and a Non-Clifford unitary. We make use of ZX-Calculus and its assets to detect a limiting border of these circuits that would allow for a separation between a Clifford section and a Non-Clifford section.
  arXiv  Detail & Related papers  (2025-04-22T16:10:34Z)
• When Clifford benchmarks are sufficient; estimating application performance with scalable proxy circuits [0.0]
  We show that for a broad class of error models these concerns are unwarranted. We show that for error models that admit noise tailoring by Pauli twirling, the diamond norm and fidelity of any generic circuit is well approximated by the fidelities of proxy circuits composed only of Clifford gates.
  arXiv  Detail & Related papers  (2025-03-07T21:18:59Z)
• Clifford Perturbation Approximation for Quantum Error Mitigation [6.8335953981503454]
  Quantum error mitigation (QEM) is critical for harnessing the potential of near-term quantum devices. We propose a learning-based error mitigation framework called Clifford Perturbation Data Regression (CPDR) CPDR constructs training sets by Clifford circuits with small perturbations.
  arXiv  Detail & Related papers  (2024-12-12T18:01:54Z)
• Over-rotation coherent error induced by pseudo-twirling of quantum gates [0.0]
  Coherence errors are a significant challenge to the scalability of quantum computing. A framework called pseudo-twirling (PST) for treating coherent error in multi-qubit non-Clifford gates has been introduced. We show analytically that a higher order correction to the existing PST theory yields an over-rotation coherent error.
  arXiv  Detail & Related papers  (2024-07-08T15:56:09Z)
• Readout Error Mitigation for Mid-Circuit Measurements and Feedforward [0.0]
  Current-day quantum computing platforms are subject to readout errors. We present a general method for readout error mitigation for expectation values on circuits with mid-circuit measurements and feedforward. We demonstrate the effectiveness of our method, obtaining up to a $sim 60%$ reduction in error on superconducting quantum processors.
  arXiv  Detail & Related papers  (2024-06-11T18:00:01Z)
• Simulating quantum circuit expectation values by Clifford perturbation theory [0.0]
  We consider the expectation value problem for circuits composed of Clifford gates and non-Clifford Pauli rotations. We introduce a perturbative approach based on the truncation of the exponentially growing sum of Pauli terms in the Heisenberg picture. Results indicate that this systematically improvable perturbative method offers a viable alternative to exact methods for approxing expectation values of large near-Clifford circuits.
  arXiv  Detail & Related papers  (2023-06-07T21:42:10Z)
• Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era [0.0]
  Fault-tolerant quantum computation (FTQC) is essential to implement quantum algorithms in a noise-resilient way. In FTQC, a quantum circuit is decomposed into universal gates that can be fault-tolerantly implemented. In this paper, we propose that the Clifford+$T$ decomposition error for a given quantum circuit can be modeled as the depolarizing noise.
  arXiv  Detail & Related papers  (2023-01-10T19:00:01Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• Quantum Bayesian Error Mitigation Employing Poisson Modelling over the Hamming Spectrum for Quantum Error Mitigation [16.130519404795407]
  In situ error mitigation and post induction error mitigation are promising fields of research within the quantum algorithm scene. We show that such a correlation structure is not only local but extends certain non local clustering patterns. We develop an iterative algorithm over the generated Bayesian network state graph for post induction error mitigation.
  arXiv  Detail & Related papers  (2022-07-14T23:57:35Z)
• 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)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Simulating quench dynamics on a digital quantum computer with data-driven error mitigation [62.997667081978825]
  We present one of the first implementations of several Clifford data regression based methods which are used to mitigate the effect of noise in real quantum data. We find in general Clifford data regression based techniques are advantageous in comparison with zero-noise extrapolation. This is the largest systems investigated so far in a study of this type.
  arXiv  Detail & Related papers  (2021-03-23T16:56:14Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.