Robustness of optimized numerical estimation schemes for noisy variational quantum algorithms

Abstract

With a finite amount of measurement data acquired in variational quantum algorithms, the statistical benefits of several optimized numerical estimation schemes, including the scaled parameter-shift (SPS) rule and finite-difference (FD) method, for estimating gradient and Hessian functions over analytical schemes~[unscaled parameter-shift (PS) rule] were reported by the present author in [Y. S. Teo, Phys. Rev. A 107, 042421 (2023)]. We continue the saga by exploring the extent to which these numerical schemes remain statistically more accurate for a given number of sampling copies in the presence of noise. For noise-channel error terms that are independent of the circuit parameters, we demonstrate that \emph{without any knowledge} about the noise channel, using the SPS and FD estimators optimized specifically for noiseless circuits can still give lower mean-squared errors than PS estimators for substantially wide sampling-copy number ranges -- specifically for SPS, closed-form mean-squared error expressions reveal that these ranges grow exponentially in the qubit number and reciprocally with a decreasing error rate. Simulations also demonstrate similar characteristics for the FD scheme. Lastly, if the error rate is known, we propose a noise-model-agnostic error-mitigation procedure to optimize the SPS estimators under the assumptions of two-design circuits and circuit-parameter-independent noise-channel error terms. We show that these heuristically-optimized SPS estimators can significantly reduce mean-squared-error biases that naive SPS estimators possess even with realistic circuits and noise channels, thereby improving their estimation qualities even further. The heuristically-optimized FD estimators possess as much mean-squared-error biases as the naively-optimized counterparts, and are thus not beneficial with noisy circuits.

arXiv comment13 pages, 6 figures

References in corpus (63)

• Quantum Computing in the NISQ era and beyond
• Fault-tolerant quantum computation by anyons
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A variational eigenvalue solver on a quantum processor
• Quantum Computing
• Variational Quantum Algorithms
• Quantum Simulation
• Machine learning and the physical sciences
• Quantum Annealing in the Transverse Ising Model
• Quantum computational advantage using photons
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum machine learning in feature Hilbert spaces
• Quantum computational chemistry
• Quantum Circuit Learning
• Quantum Chemistry in the Age of Quantum Computing
• An introduction to quantum machine learning
• Strong quantum computational advantage using a superconducting quantum processor
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Evaluating analytic gradients on quantum hardware
• Quantum algorithms: an overview
• Towards Practical Quantum Variational Algorithms
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Quantum Annealing: A New Method for Minimizing Multidimensional Functions
• Data re-uploading for a universal quantum classifier
• Topological fault-tolerance in cluster state quantum computation
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Roads towards fault-tolerant universal quantum computation
• Hybrid quantum-classical algorithms and quantum error mitigation
• Gaussian Boson Sampling
• Quantum Natural Gradient
• Random Quantum Circuits are Approximate 2-designs
• Blueprint for a microwave trapped-ion quantum computer
• Effect of barren plateaus on gradient-free optimization
• Diluted maximum-likelihood algorithm for quantum tomography
• Achieving quantum supremacy with sparse and noisy commuting quantum computations
• Maximum-likelihood estimation of quantum measurement
• Estimating the gradient and higher-order derivatives on quantum hardware
• Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer
• Computational advantage of quantum random sampling
• Applications of Near-Term Photonic Quantum Computers: Software and Algorithms
• Knowledge and ignorance in incomplete quantum state tomography
• Efficient classical simulation of noisy random quantum circuits in one dimension
• Universal Variational Quantum Computation
• Simulating boson sampling in lossy architectures
• A Linear-Optical Proof that the Permanent is #P-Hard
• Regimes of classical simulability for noisy Gaussian boson sampling
• Universal Approximation Property of Quantum Machine Learning Models in Quantum-Enhanced Feature Spaces
• Classical simulation of photonic linear optics with lost particles
• Symbolic integration with respect to the Haar measure on the unitary group
• Quantum-classical hybrid algorithm using an error-mitigating $N$-representability condition to compute the Mott metal-insulator transition
• Quantum natural gradient generalised to noisy and non-unitary circuits
• Tight bounds on the convergence of noisy random circuits to the uniform distribution
• Classical simulation of lossy boson sampling using matrix product operators
• Concentration of measure for quantum states with a fixed expectation value
• Exponential data encoding for quantum supervised learning
• Single-qubit universal classifier implemented on an ion-trap quantum device
• Virtual distillation with noise dilution
• Test-State Approach to the Quantum Search Problem
• Optimized numerical gradient and Hessian estimation for variational quantum algorithms