Toward Reliability in the NISQ Era: Robust Interval Guarantee for Quantum Measurements on Approximate States
arXiv:2110.09793 · doi:10.1103/PhysRevResearch.4.033217
Abstract
Near-term quantum computation holds potential across multiple application domains. However, imperfect preparation and evolution of states due to algorithmic and experimental shortcomings, characteristic in the near-term implementation, would typically result in measurement outcomes deviating from the ideal setting. It is thus crucial for any near-term application to quantify and bound these output errors. We address this need by deriving robustness intervals which are guaranteed to contain the output in the ideal setting. The first type of interval is based on formulating robustness bounds as semi-definite programs, and uses only the first moment and the fidelity to the ideal state. Furthermore, we consider higher statistical moments of the observable and generalize bounds for pure states based on the non-negativity of Gram matrices to mixed states, thus enabling their applicability in the NISQ era where noisy scenarios are prevalent. Finally, we demonstrate our results in the context of the variational quantum eigensolver (VQE) on noisy and noiseless simulations.
arXiv comment12 pages, 13 figures, 11 pages appendix. Open-source code available at https://github.com/DS3Lab/robustness-intervals-quantum-measurements
References in corpus (24)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- Barren plateaus in quantum neural network training landscapes
- The theory of variational hybrid quantum-classical algorithms
- Noisy intermediate-scale quantum (NISQ) algorithms
- Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
- Noise-Induced Barren Plateaus in Variational Quantum Algorithms
- Hartree-Fock on a superconducting qubit quantum computer
- Towards Practical Quantum Variational Algorithms
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Variational ansatz-based quantum simulation of imaginary time evolution
- Theory of variational quantum simulation
- Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
- Qulacs: a fast and versatile quantum circuit simulator for research purpose
- Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
- Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
- Expressibility of the alternating layered ansatz for quantum computation
- MADNESS: A Multiresolution, Adaptive Numerical Environment for Scientific Simulation
- A Feasible Approach for Automatically Differentiable Unitary Coupled-Cluster on Quantum Computers
- Tequila: A platform for rapid development of quantum algorithms
- Reducing qubit requirements while maintaining numerical precision for the Variational Quantum Eigensolver: A Basis-Set-Free Approach
- Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure using a Separable Pair Approximation
- Optimal Provable Robustness of Quantum Classification via Quantum Hypothesis Testing