Optimized numerical gradient and Hessian estimation for variational quantum algorithms
arXiv:2206.12643 · doi:10.1103/PhysRevA.107.042421
Abstract
Sampling noisy intermediate-scale quantum devices is a fundamental step that converts coherent quantum-circuit outputs to measurement data for running variational quantum algorithms that utilize gradient and Hessian methods in cost-function optimization tasks. This step, however, introduces estimation errors in the resulting gradient or Hessian computations. To minimize these errors, we discuss tunable numerical estimators, which are the finite-difference (including their generalized versions) and scaled parameter-shift estimators [introduced in Phys. Rev. A 103, 012405 (2021)], and propose operational circuit-averaged methods to optimize them. We show that these optimized numerical estimators offer estimation errors that drop exponentially with the number of circuit qubits for a given sampling-copy number, revealing a direct compatibility with the barren-plateau phenomenon. In particular, there exists a critical sampling-copy number below which an optimized difference estimator gives a smaller average estimation error in contrast to the standard (analytical) parameter-shift estimator, which exactly computes gradient and Hessian components. Moreover, this critical number grows exponentially with the circuit-qubit number. Finally, by forsaking analyticity, we demonstrate that the scaled parameter-shift estimators beat the standard unscaled ones in estimation accuracy under any situation, with comparable performances to those of the difference estimators within significant copy-number ranges, and are the best ones if larger copy numbers are affordable.
24 pages, 7 figures (updated Fig. 4, new Fig. 6, new Secs. IV C, V C, VII and Appendix C5 since last version)
References in corpus (15)
- Quantum Computing
- Variational Quantum Algorithms
- Noisy intermediate-scale quantum (NISQ) algorithms
- An introduction to quantum machine learning
- Topological fault-tolerance in cluster state quantum computation
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- Hybrid quantum-classical algorithms and quantum error mitigation
- Effect of barren plateaus on gradient-free optimization
- Diluted maximum-likelihood algorithm for quantum tomography
- Knowledge and ignorance in incomplete quantum state tomography
- Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
- Quantum-classical hybrid algorithm using an error-mitigating -representability condition to compute the Mott metal-insulator transition
- Single-qubit universal classifier implemented on an ion-trap quantum device
- How to check universality of quantum gates?
- Test-State Approach to the Quantum Search Problem