Certified variational quantum algorithms for eigenstate preparation
Andrey Kardashin, Alexey Uvarov, Dmitry Yudin, Jacob Biamonte

TL;DR
This paper introduces a certification method for variational quantum algorithms that improves the reliability of eigenstate preparation, especially near critical points in complex quantum models.
Contribution
It develops a certification approach for variational quantum algorithms, enhancing their reliability and applicability in simulating complex quantum systems.
Findings
Better performance near critical points in tested models
Effective certification of variational algorithms
Applicable to multiple quantum models
Abstract
Solutions to many-body problem instances often involve an intractable number of degrees of freedom and admit no known approximations in general form. In practice, representing quantum-mechanical states of a given Hamiltonian using available numerical methods, in particular those based on variational Monte Carlo simulations, become exponentially more challenging with increasing system size. Recently quantum algorithms implemented as variational models have been proposed to accelerate such simulations. The variational ansatz states are characterized by a polynomial number of parameters devised in a way to minimize the expectation value of a given Hamiltonian, which is emulated by local measurements. In this study, we develop a means to certify the termination of variational algorithms. We demonstrate our approach by applying it to three models: the transverse field Ising model, the model…
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.
