| CPC G06N 10/00 (2019.01) [G06F 17/18 (2013.01)] | 19 Claims |

|
1. A method comprising:
obtaining, by a computing apparatus or a computing system, an equation with a cost function for minimization related to an optimization problem thereby yielding a cost function equation, the cost function including two or more binary variables;
converting, by the computing apparatus or the computing system, an integer programming formulation of the cost function equation into a Boolean formula in Conjunctive Normal Form comprising a clause for each term of the cost function that includes at least one binary variable;
obtaining, by the computing apparatus or the computing system, a Max-Clique problem by processing the Boolean formula;
providing, from the computing apparatus or the computing system, the Max-Clique problem to a Gaussian Boson Sampling, GBS, quantum device by converting the Max-Clique problem into quantum state of light received as input by the GBS quantum device;
outputting, by the GBS quantum device, light resulting from the quantum state of light received as input by the GBS quantum device, the light output having a distribution corresponding to dense subgraphs in a graph of the Max-Clique problem;
transforming the light output into light output data; and
processing, by the computing apparatus or the computing system, the light output data by finding one or more cliques of the subgraphs so as to find values of the two or more binary variables of the cost function; the one or more cliques having the values of the two or more binary variables of the cost function.
|