Monte Carlo Markov chain based quantum program optimization
US11651232B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 1, 2018 |
| Grant date | May 16, 2023 |
| Priority date | — |
| Expiry date | Sep 6, 2041 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06N10/60
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
From a quantum program a first mutant is generated using a processor and a memory, where the first mutant is a randomly-generated transformation of the quantum program. A quality score, a correctness distance, and a probability of acceptance corresponding to the first mutant are computed. An acceptance corresponding to the first mutant is determined according to the probability of acceptance. Upon determining that an acceptance of the first mutant corresponding to the probability of acceptance exceeds an acceptance threshold, the quantum program is replaced with the first mutant. Upon determining that the quality score exceeds a storage threshold and that the correctness distance is zero, the first mutant is stored. These actions are iterated until reaching an iteration limit.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.