Classically-boosted quantum optimization
US11681774B1 · kind B1 · utility
Assignee
Inventor
Key dates
| Filing date | Mar 23, 2022 |
| Grant date | Jun 20, 2023 |
| Priority date | — |
| Expiry date | Mar 23, 2042 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06N10/70
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method and system are provided for solving combinatorial optimization problems. A classical algorithm provides an approximate or “seed” solution which is then used by a quantum circuit to search its “neighborhood” for higher-quality feasible solutions. A continuous-time quantum walk (CTQW) is implemented on a weighted, undirected graph that connects the feasible solutions. An iterative optimizer tunes the quantum circuit parameters to maximize the probability of obtaining high-quality solutions from the final state. The ansatz circuit design ensures that only feasible solutions are obtained from the measurement. The disclosed method solves constrained problems without modifying their cost functions, confines the evolution of the quantum state to the feasible subspace, and does not rely on efficient indexing of the feasible solutions as some previous methods require.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.