Computational Supremacy of Quantum Eigensolver by Extension of Optimized Binary Configurations
Hayun Park, Hunpyo Lee

TL;DR
This paper introduces a quantum eigensolver that leverages quantum annealing on a D-Wave system to efficiently compute eigenstates and eigenvalues of Hamiltonians, demonstrating potential computational supremacy over classical methods.
Contribution
The paper presents a novel quantum eigensolver based on optimized binary configurations measured by quantum annealing, reducing computational costs compared to classical diagonalization methods.
Findings
Provides exact solutions within small errors for tested Hamiltonians.
Shows computational cost is not significantly affected by Hamiltonian size.
Demonstrates potential for wide application in material and drug design.
Abstract
We developed a quantum eigensolver (QE) which is based on an extension of optimized binary configurations measured by quantum annealing (QA) on a D-Wave Quantum Annealer (D-Wave QA). This approach performs iterative QA measurements to optimize the eigenstates without the derivation of a classical computer. The computational cost is for full eigenvalues and of the Hamiltonian of size , where and are the number of QA measurements required to reach the converged and the total annealing time of many QA shots, respectively. Unlike the exact diagonalized (ED) algorithm with iterations on a classical computer, the computation cost is not significantly affected by and because represents a very short time within seconds on the D-Wave QA. We selected the…
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
TopicsPhotonic and Optical Devices · Neural Networks and Reservoir Computing
