US 11,704,586 B2
Systems and methods for analog processing of problem graphs having arbitrary size and/or connectivity
Murray C. Thom, Vancouver (CA); Aidan P. Roy, Surrey (CA); Fabian A. Chudak, Vancouver (CA); Zhengbing Bian, Burnaby (CA); William G. Macready, West Vancouver (CA); Robert B. Israel, Richmond (CA); Kelly T. R. Boothby, Vancouver (CA); Sheir Yarkoni, Vancouver (CA); Yanbo Xue, Toronto (CA); and Dmytro Korenkevych, Burnaby (CA)
Assigned to D-WAVE SYSTEMS INC., Burnaby (CA)
Filed by D-WAVE SYSTEMS INC., Burnaby (CA)
Filed on May 9, 2022, as Appl. No. 17/739,411.
Application 17/739,411 is a continuation of application No. 16/778,295, filed on Jan. 31, 2020, granted, now 11,348,026.
Application 16/778,295 is a continuation of application No. 15/448,361, filed on Mar. 2, 2017, granted, now 10,599,988, issued on Mar. 27, 2020.
Claims priority of provisional application 62/375,785, filed on Aug. 16, 2016.
Claims priority of provisional application 62/302,544, filed on Mar. 2, 2016.
Prior Publication US 2022/0335320 A1, Oct. 20, 2022
This patent is subject to a terminal disclaimer.
Int. Cl. G06N 10/00 (2022.01)
CPC G06N 10/00 (2019.01) 12 Claims
OG exemplary drawing
 
1. A method of operation in a computational system, the computational system comprising a quantum processor comprising a plurality of qubits and one or more coupling devices arranged to form a working graph for embedding a problem graph, the computational system further comprising at least one non-quantum processor-based device, the method comprising:
receiving a plurality of problems, each problem representable as a problem graph having a number of decision variables;
selecting, from the plurality of problems, a first problem based on one of more properties of the first problem;
selecting, from the plurality of problems, a second problem based on at least one of the one or more properties of the first problem and one or more properties of the second problem;
determining, for each of the first and the second problems, a placement of the problem graph representing the problem in a placement graph;
determining an executable representation of the placement graph together with the placements of the first and the second problems, the representation executable by the quantum processor in one or more executions;
providing the executable representation to the quantum processor for execution;
receiving, from the quantum processor, an output based on at least one execution of the executable representation by the quantum processor; and
generating a first solution to the first problem and a second solution to the second problem by disaggregating representations of the first and the second solutions from the output.