Interpolating Parametrized Quantum Circuits using Blackbox Queries (2310.04396v4)
Abstract: This article focuses on developing classical surrogates for parametrized quantum circuits using interpolation via (trigonometric) polynomials. We develop two algorithms for the construction of such surrogates and prove performance guarantees. The constructions are based on circuit evaluations which are blackbox in the sense that no structural specifics of the circuits are exploited. While acknowledging the limitations of the blackbox approach compared to whitebox evaluations, which exploit specific circuit properties, we demonstrate scenarios in which the blackbox approach might prove beneficial. Sample applications include but are not restricted to the approximation of VQEs and the alleviaton of the barren plateau problem.
- Tomislav Begušić and Garnet Kin-Lic Chan. Fast classical simulation of evidence for the utility of quantum computing before fault tolerance, 2023.
- Simulating quantum circuit expectation values by clifford perturbation theory, 2023.
- The Solovay-Kitaev Algorithm. Quantum Info. Comput., 6(1):81–95, Jan 2006.
- Classical simulations of noisy variational quantum circuits, 2023.
- Daniel Gottesman. The Heisenberg Representation of Quantum Computers. arXiv:quant-ph/9807006, 1998.
- Supervised learning with quantum-enhanced feature spaces. Nature, 567(7747):209–212, mar 2019.
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus. PRX Quantum, 3(1), jan 2022.
- Shadows of quantum machine learning, 2023.
- Evidence for the utility of quantum computing before fault tolerance. Nature, 618(7965):500–505, Jun 2023.
- A Yu Kitaev. Quantum computations: algorithms and error correction. Russian Mathematical Surveys, 52(6):1191, Dec 1997.
- Classically approximating variational quantum machine learning with random fourier features, 2022.
- Estimating the gradient and higher-order derivatives on quantum hardware. Physical Review A, 103(1), jan 2021.
- Quantum circuit learning. Physical Review A, 98(3), sep 2018.
- Quadratic Clifford expansion for efficient benchmarking and initialization of variational quantum algorithms. Phys. Rev. Res., 4:033012, Jul 2022.
- Fourier expansion in variational quantum algorithms. Physical Review A, 108(3), sep 2023.
- Classical surrogate simulation of quantum systems with lowesa, 2023.
- Random features for large-scale kernel machines. In J. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems, volume 20. Curran Associates, Inc., 2007.
- Evaluating analytic gradients on quantum hardware. Physical Review A, 99(3), mar 2019.
- Denoising gradient descent in variational quantum algorithms, 2024.
- Classical surrogates for quantum learning models. Physical Review Letters, 131(10), sep 2023.
- Effect of data encoding on the expressive power of variational quantum-machine-learning models. Physical Review A, 103(3), mar 2021.
- Maarten Van Den Nes. Classical Simulation of Quantum Computation, the Gottesman-Knill Theorem, and Slightly Beyond. Quantum Info. Comput., 10(3):258–271, Mar 2010.
- General parameter-shift rules for quantum gradients. Quantum, 6:677, March 2022.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.