TL;DR
This paper introduces a variational quantum circuit method for power iteration to find eigenpairs of matrices, enabling efficient solutions to combinatorial optimization problems on near-term quantum computers.
Contribution
It presents a novel variational quantum approach for power iteration applicable to Hamiltonians and combinatorial optimization, with demonstrated polynomial complexity and simulation feasibility.
Findings
Method can solve optimization problems with few iterations.
Number of iterations grows polynomially with problem size.
Simulations show effectiveness on problems with up to 21 parameters.
Abstract
The power method (or iteration) is a well-known classical technique that can be used to find the dominant eigenpair of a matrix. Here, we present a variational quantum circuit method for the power iteration, which can be used to find the eigenpairs of unitary matrices and so their associated Hamiltonians. We discuss how to apply the circuit to combinatorial optimization problems formulated as a quadratic unconstrained binary optimization and discuss its complexity. In addition, we run numerical simulations for random problem instances with up to 21 parameters and observe that the method can generate solutions to the optimization problems with only a few number of iterations and the growth in the number of iterations is polynomial in the number of parameters. Therefore, the circuit can be simulated on the near term quantum computers with ease.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
