Quantum-walk-based algorithm for classical optimization problems
US11694103B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 2, 2019 |
| Grant date | Jul 4, 2023 |
| Priority date | — |
| Expiry date | Jan 13, 2042 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06N3/047
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Example circuit implementations of Szegedy's quantization of the Metropolis-Hastings walk are presented. In certain disclosed embodiments, a quantum walk procedure of a Markov chain Monte Carlo simulation is implemented in which a quantum move register is reset at every step in the quantum walk. In further embodiments, a quantum walk procedure of a Markov chain Monte Carlo simulation is implemented in which an underlying classical walk is obtained using a Metropolis-Hastings rotation or a Glauber dynamics rotation. In some embodiments, a quantum walk procedure is performed in the quantum computing device to implement a Markov Chain Monte Carlo method; during the quantum walk procedure, an intermediate measurement is obtained; and a rewinding procedure of one or more but not all steps of the quantum walk procedure is performed if the intermediate measurement produces an incorrect outcome.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.