Methods and systems to find a solution to a maximum independent set problem of a graph
AssigneePasqal
InventorsConstantin DALYAC, Loïc HENRIET
Life of this patent
Estimating the term…
Loading patent…
AssigneePasqal
InventorsConstantin DALYAC, Loïc HENRIET
Estimating the term…
According to a first aspect, the present disclosure relates to a method to find an approximate or exact solution to a maximum independent set problem of a graph, the method comprising: rearrange said input graph (12) onto a 3D orthogonal grid; determining, in the rearranged graph (13), for each pair of main nodes (202, 204) that are connected by a main edge (214), an ancillary path arranged along grid edges, using a pathfinding algorithm; generating an augmented 3D graph (14) by adding, in each ancillary path of the rearranged graph (13), an even number of ancillary nodes (221-224); providing a 3D array of neutral atoms comprising main atoms and ancillary atoms arranged to reflect the augmented 3D graph; applying a light shift pulse to the ancillary atoms in order to introduce at least one predetermined detuning of the resonance frequency of the ancillary atoms; applying a driving light pulse to all main atoms and all ancillary atoms to drive the 3D array of neutral atoms towards a predetermined final state; detecting the excited main atoms in the predetermined final state in order to obtain an independent set of the input graph.
A method to find a solution to a maximum independent set problem of an input graph (12) comprising main nodes (201-205) and main edges (211-216) directly connecting said main nodes, the method comprising:
A quantum processing system to find a solution to a maximum independent set problem of an input graph (12) comprising main nodes (201-205) and main edges (211-216) directly connecting said main nodes, such system comprising:
Dependencies are inferred from the claim text.