Interpolating Parametrized Quantum Circuits using Blackbox Queries
Lars Simon, Holger Eble, Hagen-Henrik Kowalski, Manuel Radons

TL;DR
This paper introduces methods to create classical surrogate models for parametrized quantum circuits using blackbox interpolation, with performance guarantees and potential benefits for quantum algorithm approximation.
Contribution
It presents two novel algorithms for blackbox interpolation of quantum circuits and analyzes their theoretical performance guarantees.
Findings
Algorithms successfully interpolate quantum circuits from blackbox evaluations.
Performance guarantees are established for the proposed interpolation methods.
Potential applications include variational quantum algorithms and barren plateau mitigation.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Low-power high-performance VLSI design · Quantum Computing Algorithms and Architecture
