US 11,983,604 B2
Quantum-inspired algorithms to solve intractable problems using classical computers
Suhas Kumar, Milpitas, CA (US); John Paul Strachan, Milpitas, CA (US); and Thomas Van Vaerenbergh, Diegem (BE)
Assigned to Hewlett Packard Enterprise Development LP, Spring, TX (US)
Filed by HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP, Houston, TX (US)
Filed on Jul. 16, 2021, as Appl. No. 17/378,650.
Prior Publication US 2023/0019942 A1, Jan. 19, 2023
Int. Cl. G06N 10/00 (2022.01); G06F 9/455 (2018.01)
CPC G06N 10/00 (2019.01) [G06F 9/455 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A computer-implemented method comprising:
providing, to a network of memristors, a first problem to be solved, the first problem corresponding with a curve for which a global minimum is previously determined;
gradually providing, to the network of memristors, a second problem to be solved that comprises incrementally solving for individual ones of a set of local minima to find the global minimum that is previously determined, wherein controlled noise is applied to the network of memristors for at least a portion of time during which the second problem is provided to the network of memristors,
wherein the second problem is gradually introduced to the first problem according to an adiabatic annealing process that reduces a compute time on the network of memristors for solving the second problem; and
determining a solution to the second problem.