The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jun. 20, 2023

Filed:

Mar. 23, 2022
Applicant:

Zapata Computing, Inc., Boston, MA (US);

Inventor:

Guoming Wang, North York, CA;

Assignee:

Zapata Computing, Inc., Boston, MA (US);

Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
G06F 17/11 (2006.01); G06N 10/60 (2022.01); G06F 17/18 (2006.01);
U.S. Cl.
CPC ...
G06F 17/11 (2013.01); G06F 17/18 (2013.01); G06N 10/60 (2022.01);
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.


Find Patent Forward Citations

Loading…