The Accuracy vs. Sampling Overhead Trade-off in Quantum Error Mitigation Using Monte Carlo-Based Channel Inversion

@article{Xiong2022TheAV,
  title={The Accuracy vs. Sampling Overhead Trade-off in Quantum Error Mitigation Using Monte Carlo-Based Channel Inversion},
  author={Yifeng Xiong and Soon Xin Ng and Lajos Hanzo Hanzo},
  journal={IEEE Transactions on Communications},
  year={2022},
  volume={70},
  pages={1943-1956}
}
Quantum error mitigation (QEM) is a class of promising techniques for reducing the computational error of variational quantum algorithms. In general, the computational error reduction comes at the cost of a sampling overhead due to the variance-boosting effect caused by the channel inversion operation, which ultimately limits the applicability of QEM. Existing sampling overhead analysis of QEM typically assumes exact channel inversion, which is unrealistic in practical scenarios. In this… 

References

SHOWING 1-10 OF 43 REFERENCES
Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems
TLDR
This treatise provides a comprehensive analysis of the sampling overhead imposed by QEM and shows that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels having the same average fidelity.
Practical Quantum Error Mitigation for Near-Future Applications
TLDR
This work describes a protocol for systematically measuring the effect of errors so as to design efficient QEM circuits and introduces an exponential variant of the extrapolation method to enable practical implementation of these ideas.
Decoding quantum errors with subspace expansions
TLDR
Existing quantum codes are exploited through only post-processing and random measurements in order to mitigate errors in NISQ devices, which greatly simplifies the experimental exploration of quantum codes on real, near-term devices.
Channel Decoding with Quantum Approximate Optimization Algorithm
TLDR
The excellent performance of higher-level QAOA decoding is verified when Pauli rotation angles are optimized through meta-heuristic variational quantum eigensolver (VQE).
Fault-Tolerant Quantum Computation with Constant Error Rate
TLDR
This paper provides a self-contained and complete proof of universal fault-tolerant quantum computation in the presence of local noise, and shows that local noise is in principle not an obstacle for scalable quantum computation.
Introduction to Quantum Gate Set Tomography
Quantum gate set tomography (GST) has emerged as a promising method for the full characterization of quantum logic gates. In contrast to quantum process tomography (QPT), GST self-consistently and
Stochastic gradient descent for hybrid quantum-classical optimization
TLDR
This work formalizes the notion that in many relevant cases, including VQE, QAOA and certain quantum classifiers, estimating expectation values withk$ measurement outcomes results in optimization algorithms whose convergence properties can be rigorously well understood, for any value of $k$.
Quantum computation with universal error mitigation on a superconducting quantum processor
TLDR
An error mitigation protocol based on gate set tomography and quasi-probability decomposition is demonstrated that is universal for digital quantum computers and algorithms computing expected values and suggests that error mitigation can be an essential component of near-future quantum computation.
The theory of variational hybrid quantum-classical algorithms
TLDR
A quantum variational error suppression that allows some errors to be suppressed naturally in this algorithmon a pre-threshold quantumdevice is introduced and the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders ofmagnitude over previously used optimization techniques.
Noise-induced barren plateaus in variational quantum algorithms
TLDR
This work rigorously proves a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau, and proves that the gradient vanishes exponentially in the number of qubits n if the depth of the ansatz grows linearly with n.
...
...