Q-CHOP: Quantum constrained Hamiltonian optimization
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909990003933184 |
|---|---|
| author | Perlin, Michael A. Shaydulin, Ruslan Hall, Benjamin P. Minssen, Pierre Li, Changhao Dubey, Kabir Rines, Rich Anschuetz, Eric R. Pistoia, Marco Gokhale, Pranav |
| author_facet | Perlin, Michael A. Shaydulin, Ruslan Hall, Benjamin P. Minssen, Pierre Li, Changhao Dubey, Kabir Rines, Rich Anschuetz, Eric R. Pistoia, Marco Gokhale, Pranav |
| contents | Combinatorial optimization problems that arise in science and industry typically have constraints. Yet the presence of constraints makes them challenging to tackle using both classical and quantum optimization algorithms. We propose a new quantum algorithm for constrained optimization, which we call quantum constrained Hamiltonian optimization (Q-CHOP). Our algorithm leverages the observation that for many problems, while the best solution is difficult to find, the worst feasible (constraint-satisfying) solution is known. The basic idea of Q-CHOP is to enforce a Hamiltonian constraint at all times, thereby restricting evolution to the subspace of feasible states, and slowly ``rotate'' an objective Hamiltonian to trace an adiabatic path from the worst feasible state to the best feasible state. Q-CHOP thereby assigns qualitatively distinct roles to the constraint and objective functions of a constrained optimization problem. We additionally propose a version of Q-CHOP that can start in any feasible state. Finally, we benchmark Q-CHOP against the commonly-used adiabatic algorithm of quantum annealing with an objective function that penalizes constraint violation, and find that Q-CHOP consistently performs significantly better on a wide range of problems, including textbook graph problems, knapsack problems, combinatorial auctions, and a real-world financial use case of bond exchange-traded fund basket optimization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_05653 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Q-CHOP: Quantum constrained Hamiltonian optimization Perlin, Michael A. Shaydulin, Ruslan Hall, Benjamin P. Minssen, Pierre Li, Changhao Dubey, Kabir Rines, Rich Anschuetz, Eric R. Pistoia, Marco Gokhale, Pranav Quantum Physics Emerging Technologies Combinatorial optimization problems that arise in science and industry typically have constraints. Yet the presence of constraints makes them challenging to tackle using both classical and quantum optimization algorithms. We propose a new quantum algorithm for constrained optimization, which we call quantum constrained Hamiltonian optimization (Q-CHOP). Our algorithm leverages the observation that for many problems, while the best solution is difficult to find, the worst feasible (constraint-satisfying) solution is known. The basic idea of Q-CHOP is to enforce a Hamiltonian constraint at all times, thereby restricting evolution to the subspace of feasible states, and slowly ``rotate'' an objective Hamiltonian to trace an adiabatic path from the worst feasible state to the best feasible state. Q-CHOP thereby assigns qualitatively distinct roles to the constraint and objective functions of a constrained optimization problem. We additionally propose a version of Q-CHOP that can start in any feasible state. Finally, we benchmark Q-CHOP against the commonly-used adiabatic algorithm of quantum annealing with an objective function that penalizes constraint violation, and find that Q-CHOP consistently performs significantly better on a wide range of problems, including textbook graph problems, knapsack problems, combinatorial auctions, and a real-world financial use case of bond exchange-traded fund basket optimization. |
| title | Q-CHOP: Quantum constrained Hamiltonian optimization |
| topic | Quantum Physics Emerging Technologies |
| url | https://arxiv.org/abs/2403.05653 |