US 11,995,515 B2
DAG-Based CSP quantum circuit modeling
Yehuda Naveh, Tel Aviv-Jaffa (IL); Amir Naveh, Haifa (IL); Nir Minerbi, Haifa (IL); Ofek Kirzner, Haifa (IL); Adam Goldfeld, Kiryat Motzkin (IL); and Shmuel Ur, Shorashim (IL)
Assigned to CLASSIQ TECHNOLOGIES LTD., Tel Aviv (IL)
Filed by Classiq Technologies LTD., Tel Aviv (IL)
Filed on Feb. 21, 2023, as Appl. No. 18/171,785.
Application 18/171,785 is a continuation of application No. 17/650,290, filed on Feb. 8, 2022, granted, now 11,620,564.
Application 17/650,290 is a continuation of application No. 17/149,326, filed on Jan. 14, 2021, granted, now 11,288,589, issued on Mar. 29, 2022.
Prior Publication US 2023/0196153 A1, Jun. 22, 2023
Int. Cl. G06F 30/327 (2020.01); G06F 30/337 (2020.01); G06N 10/00 (2022.01); G06N 10/20 (2022.01)
CPC G06N 10/00 (2019.01) [G06F 30/337 (2020.01)] 20 Claims
OG exemplary drawing
 
1. A method comprising:
creating a Constraint Satisfaction Problem (CSP) model of a directed cycle graph (DAG) representation of a quantum circuit, the quantum circuit having up to N gates, the DAG representation comprises vertices and edges, the vertices representing gates in the quantum circuit, edges representing qubit dependencies, the CSP model comprises decision variables, domains thereof and constraint on the values of the decision variables, the decision variables comprise:
N gate assignment variables (xi) having a domain including a set of one or more alternative types of gates; and
M pairs of assignment variables defining the edges (edge_ini, edge_outi) each of which having a domain of the N gate assignment variables ({x0 . . . xN−1});
automatically solving the CSP model using a CSP solver, wherein said automatically solving comprises determining a set of values for the set of decision variables that hold the constraints of the CSP model, wherein the set of values are selected for each decision variable from the corresponding domain of the decision variable; and
synthesizing the quantum circuit based on the set of values.