eqc-models 0.11.1__py3-none-any.whl → 0.12.0__py3-none-any.whl

{eqc_models-0.11.1.data → eqc_models-0.12.0.data}/platlib/eqc_models/base/quadratic.py

@@ -245,6 +245,6 @@ class ConstrainedQuadraticModel(ConstraintsMixIn, QuadraticModel):
         return self.lhs, self.rhs
     
     def evaluateObjective(self, solution: np.ndarray) -> float:
-        J = self.quad_objective
-        C = self.linear_objective
+        J = np.array(self.quad_objective)
+        C = np.array(self.linear_objective)
         return np.squeeze(C.T @ solution + solution.T@J@solution)

eqc_models-0.12.0.data/platlib/eqc_models/graph/__init__.py

@@ -0,0 +1,9 @@
+# (C) Quantum Computing Inc., 2024.
+
+from .base import EdgeMixin, EdgeModel, GraphModel, NodeModel
+from .maxcut import MaxCutModel
+from .partition import GraphPartitionModel
+
+__all__ = ["MaxCutModel", "GraphPartitionModel",
+           "EdgeMixin", "EdgeModel", "GraphModel", 
+           "NodeModel"]

{eqc_models-0.11.1.data → eqc_models-0.12.0.data}/platlib/eqc_models/graph/base.py

@@ -7,7 +7,7 @@ class GraphModel(QuadraticModel):
     """ """
     def __init__(self, G : nx.Graph):
         self.G = G
-        super().__init__(*self.costFunction())
+        super(GraphModel, self).__init__(*self.costFunction())
 
     @property
     def linear_objective(self):
@@ -63,12 +63,16 @@ class TwoPartitionModel(NodeModel):
     
     """
 
-class EdgeModel(GraphModel):
-    """ Create a model where the variables are edge-based """
+class EdgeMixin:
 
     @property
     def variables(self) -> List[str]:
         """ Provide a variable name to index lookup; order enforced by sorting the list before returning """
-        names = [f"({u},{v})" for u, v in self.G.edges]
+        names = [(u, v) for u, v in self.G.edges]
         names.sort()
         return names
+
+class EdgeModel(EdgeMixin, GraphModel):
+    """ Create a model where the variables are edge-based """
+
+    

eqc_models-0.12.0.data/platlib/eqc_models/graph/shortestpath.py

@@ -0,0 +1,157 @@
+r"""
+MIP Shortest Path implementation
+
+Given a graph $G$ and nodes $s$ and $t$, find the shortest path
+by edge weight between $s$ and $t$. 
+
+$$
+\min sum_ij w_ij x_ij
+$$
+subject to
+$$
+\sum_{(u,v)\in E} x_{u,v} - \sum{(v,u)\in E} x_{v,u} = 0 \forall u\in N\\{s,t}
+$$
+and
+$$
+\sum_{(s,v)\in E} x_{s,v} = 1
+$$
+and
+$$
+\sum_{(u,t)\in E} x_{u,t} = 1
+$$
+
+"""
+
+from typing import Any, Dict, Tuple
+import logging
+import numpy as np
+import networkx as nx
+from eqc_models.graph import EdgeMixin
+from eqc_models.base.quadratic import ConstrainedQuadraticModel
+
+log = logging.getLogger(name=__name__)
+
+class ShortestPathModel(EdgeMixin, ConstrainedQuadraticModel):
+    """
+    ShortestPathModel describes the MIP formulation for the 
+    shortest path problem.
+
+    Parameters
+    -------------
+
+    G : nx.DiGraph
+        A directed graph which is assumed to be connected. A graph
+        with disconnected subgraphs may reveal a solution if $s$ and $t$
+        are in the same subgraph, but testing for the existence of a path
+        between s and t using this model is not recommended. This is 
+        due to the difficulty posed by selecting a penalty multiplier 
+        large enough to enforce the panalties, which DNE in the infeasible 
+        case.
+    s : Any
+        This is the label for the start node.
+    t : Any
+        This is the label for the end node.
+
+
+    """
+
+    def __init__(self, G: nx.DiGraph, s : Any, t : Any):
+        self.G = G
+        self.s = s
+        self.t = t
+        self.lhs, self.rhs = self.buildConstraints()
+        C, J = self.buildObjective()
+        super(ShortestPathModel, self).__init__(C, J, self.lhs, self.rhs)
+
+    def buildConstraints(self) -> Tuple[np.ndarray,np.ndarray]:
+        """
+        Constraints: 
+        $$
+        sum_j x[i,l] - sum_j x[j,l] = c for all l
+        $$
+        $c$ is -1, 1 or 0 for $i=t$, $s$ or all others
+        
+        """
+        log.info("Building constraints to find path from %s to %s", self.s, self.t)
+        variables = self.variables
+        nodes = [n for n in self.G.nodes]
+        m = len(nodes)
+        n = len(variables)
+        _cons = np.zeros((m, n), dtype=np.int8)
+        _rhs = np.zeros((m, 1), dtype=np.int8)
+        for node_index, k in enumerate(nodes):
+            if k == self.s:
+                _rhs[node_index, 0] = 1
+            elif k == self.t:
+                _rhs[node_index, 0] = -1
+        for l, (i, j) in enumerate(variables):
+            if i == j:
+                # self loops are not allowed
+                raise ValueError("Self loops are not allowed in ShortestPathModel")
+            # # ignore these edges because we can't go back to s or leave t
+            elif j == self.s:
+                continue
+            elif i == self.t:
+                continue
+            i_index = nodes.index(i)
+            j_index = nodes.index(j)
+            _cons[i_index, l] = 1
+            _cons[j_index, l] = -1
+        log.info("LHS shape %s RHS shape %s", _cons.shape, _rhs.shape)
+        log.info("checksum %f min %f", np.sum(_cons), np.min(_cons))
+        assert np.sum(_rhs) == 0
+        return _cons, np.squeeze(_rhs)
+
+    def buildObjective(self) -> Tuple[np.ndarray, np.ndarray]:
+        r"""
+        Objective:
+        $\min sum_ij w_ij x_ij$
+
+        """
+        variables = self.variables
+        G = self.G
+        nodes = G.nodes
+        m, n = len(nodes), len(variables)
+        _obj = [0 for i in range(n)]
+        for index, name in enumerate(variables):
+            i, j = name
+            _obj[index] = v = G.get_edge_data(i, j)["weight"]
+            assert not np.isnan(v), f"Got a NaN at {i, j}"
+        J = np.zeros((n, n))
+        return np.array(_obj), J
+
+    def decode(self, solution : np.ndarray) -> Dict:
+        """ 
+        Convert a solution to this model into a path, which is
+        a dictionary with each edge described by key, value pairs.
+
+        """
+        variables = self.variables
+
+        lhs, rhs = self.constraints
+        upper_thresh = max(solution)
+        lower_thresh = 0
+        while upper_thresh - lower_thresh > 1e-6:
+            log.info("Lower Value: %f Upper Value %f", lower_thresh, upper_thresh)
+            thresh = (lower_thresh + upper_thresh) / 2
+            nx_path = None
+            G = nx.DiGraph()
+            for (i, j), value in zip(variables, solution):
+                if value > thresh:
+                    G.add_edge(i, j)
+            path = {}
+            try:
+                nx_path = nx.shortest_path(G, self.s, self.t)
+                upper_thresh = thresh
+                lower_thresh = thresh
+            except (nx.exception.NodeNotFound, nx.NetworkXAlgorithmError) as err:
+                lower_thresh = thresh
+        if nx_path is None:
+            raise RuntimeError(f"Solution does not describe path from {self.s} to {self.t}")
+        path = {}
+        for i, v in enumerate(nx_path):
+            path[nx_path[i-1]] = v
+        if self.t in path:
+            del path[self.t]
+        return path
+

{eqc_models-0.11.1.data → eqc_models-0.12.0.data}/platlib/eqc_models/ml/classifierbase.py

@@ -11,6 +11,7 @@ import numpy as np
 
 from eqc_models import QuadraticModel
 from eqc_models.solvers.qciclient import Dirac3CloudSolver
+from eqc_models.solvers.eqcdirect import Dirac3DirectSolver
 
 
 class ClassifierBase(QuadraticModel):
@@ -18,12 +19,25 @@ class ClassifierBase(QuadraticModel):
         self,
         relaxation_schedule=2,
         num_samples=1,
+        solver_access="cloud",
+        ip_addr=None,
+        port=None,
     ):
 
         super(self).__init__(None, None, None)
         
         self.relaxation_schedule = relaxation_schedule
         self.num_samples = num_samples
+
+        assert solver_access in ["cloud", "direct"]
+
+        if solver_access == "direct":
+            assert ip_addr is not None, "ip_addr should be set when using direct solver!"
+            assert port is not None,"port should be set when using direct solver!"
+            
+        self.solver_access = solver_access
+        self.ip_addr = ip_addr
+        self.port = port
         self.params = None
         self.X_train = None
         self.y_train = None
@@ -53,18 +67,30 @@ class ClassifierBase(QuadraticModel):
         return
 
     def solve(self):
-        solver = Dirac3CloudSolver()
+
+        if self.solver_access == "direct":
+            solver = Dirac3DirectSolver()
+            solver.connect(self.ip_addr, self.port)
+        else:
+            solver = Dirac3CloudSolver()
+            
         response = solver.solve(
             self,
             sum_constraint=self._sum_constraint,
             relaxation_schedule=self.relaxation_schedule,
-            solution_precision=1,
+            solution_precision=None,
             num_samples=self.num_samples,
         )
 
-        min_id = np.argmin(response["results"]["energies"])
-
-        sol = response["results"]["solutions"][min_id]
+        if self.solver_access == "cloud":
+            energies = response["results"]["energies"]
+            solutions = response["results"]["solutions"]
+        elif self.solver_access == "direct":
+            energies = response["energy"]
+            solutions = response["solution"]
+            
+        min_id = np.argmin(energies)
+        sol = solutions[min_id]
 
         print(response)
         

{eqc_models-0.11.1.data → eqc_models-0.12.0.data}/platlib/eqc_models/ml/classifierqboost.py

@@ -94,6 +94,12 @@ class QBoostClassifier(ClassifierBase):
 
     num_samples: Number of samples used by Dirac-3; default: 1.
 
+    solver_access: Solver access type: cloud or direct; default: cloud.
+
+    ip_addr: IP address of the device when direct access is used; default: None.
+    
+    port: Port number of the device when direct access is used; default: None.    
+    
     lambda_coef: A penalty multiplier; default: 0.
 
     weak_cls_schedule: Weak classifier schedule. Is either 1, 2,
@@ -155,6 +161,9 @@ class QBoostClassifier(ClassifierBase):
         self,
         relaxation_schedule=2,
         num_samples=1,
+        solver_access="cloud",
+        ip_addr=None,
+        port=None,
         lambda_coef=0,
         weak_cls_schedule=2,
         weak_cls_type="lg",
@@ -172,9 +181,13 @@ class QBoostClassifier(ClassifierBase):
             "multi_processing_shm",
             "sequential",
         ]
-
+        assert solver_access in ["cloud", "direct"]
+        
         self.relaxation_schedule = relaxation_schedule
         self.num_samples = num_samples
+        self.solver_access = solver_access
+        self.ip_addr = ip_addr
+        self.port = port
         self.lambda_coef = lambda_coef
         self.weak_cls_schedule = weak_cls_schedule
         self.weak_cls_type = weak_cls_type

{eqc_models-0.11.1.data → eqc_models-0.12.0.data}/platlib/eqc_models/ml/classifierqsvm.py

@@ -24,6 +24,12 @@ class QSVMClassifier(ClassifierBase):
 
     num_samples: Number of samples used by Dirac-3; default: 1.
 
+    solver_access: Solver access type: cloud or direct; default: cloud.
+
+    ip_addr: IP address of the device when direct access is used; default: None.
+    
+    port: Port number of the device when direct access is used; default: None.    
+    
     lambda_coef: The penalty multipler
 
     Examples
@@ -67,12 +73,20 @@ class QSVMClassifier(ClassifierBase):
         self,
         relaxation_schedule=1,
         num_samples=1,
+        solver_access="cloud",
+        ip_addr=None,
+        port=None,            
         lambda_coef=1.0,
     ):
         super(QSVMClassifier).__init__()
 
+        assert solver_access in ["cloud", "direct"]
+        
         self.relaxation_schedule = relaxation_schedule
         self.num_samples = num_samples
+        self.solver_access = solver_access
+        self.ip_addr = ip_addr
+        self.port = port        
         self.lambda_coef = lambda_coef
         self.fea_scaler = MinMaxScaler(feature_range=(-1, 1))
 
@@ -199,6 +213,12 @@ class QSVMClassifierDual(ClassifierBase):
 
     num_samples: Number of samples used by Dirac-3; default: 1.
 
+    solver_access: Solver access type: cloud or direct; default: cloud.
+
+    ip_addr: IP address of the device when direct access is used; default: None.
+    
+    port: Port number of the device when direct access is used; default: None.    
+    
     upper_limit: Coefficient upper limit; a regularization parameter;
     default: 1.0.
 
@@ -253,6 +273,9 @@ class QSVMClassifierDual(ClassifierBase):
         self,
         relaxation_schedule=2,
         num_samples=1,
+        solver_access="cloud",
+        ip_addr=None,
+        port=None,            
         upper_limit=1.0,
         gamma=1.0,
         eta=1.0,
@@ -260,8 +283,13 @@ class QSVMClassifierDual(ClassifierBase):
     ):
         super(QSVMClassifierDual).__init__()
 
+        assert solver_access in ["cloud", "direct"]
+        
         self.relaxation_schedule = relaxation_schedule
         self.num_samples = num_samples
+        self.solver_access = solver_access
+        self.ip_addr = ip_addr
+        self.port = port        
         self.upper_limit = upper_limit
         self.gamma = gamma
         self.eta = eta

{eqc_models-0.11.1.data → eqc_models-0.12.0.data}/platlib/eqc_models/ml/clustering.py

@@ -140,14 +140,14 @@ class GraphClustering(ClusteringBase):
 
         self.set_model(J, C, sum_constraint)
 
-        sol = self.solve()
-
+        sol, response = self.solve()
+        
         assert len(sol) == C.shape[0], "Inconsistent solution size!"
         assert len(sol) == self.num_clusters * self.num_nodes
 
         self.labels = self.get_labels(sol)
 
-        return self
+        return response
 
     def fit_predict(self):
         """
@@ -300,14 +300,14 @@ class Clustering(ClusteringBase):
 
         self.set_model(J, C, sum_constraint)
 
-        sol = self.solve()
+        sol, response = self.solve()
 
         assert len(sol) == C.shape[0], "Inconsistent solution size!"
         assert len(sol) == self.num_clusters * num_items
 
         self.labels = self.get_labels(sol, num_items)
 
-        return self
+        return response
 
     def fit_predict(self, X: np.array):
         """

{eqc_models-0.11.1.data → eqc_models-0.12.0.data}/platlib/eqc_models/ml/clusteringbase.py

@@ -78,7 +78,7 @@ class ClusteringBase(QuadraticModel):
 
         print(response)
 
-        return sol
+        return sol, response
 
     def get_labels(self, sol):
         pass

{eqc_models-0.11.1.data → eqc_models-0.12.0.data}/platlib/eqc_models/process/base.py

@@ -2,6 +2,11 @@ import networkx as nx
 from eqc_models.base import ConstrainedPolynomialModel
 
 class ProcessModel:
+    """
+    Given a directed graph $G$ that describes a process flow, optimize the 
+    flow.
+
+    """
     def __init__(self, G : nx.DiGraph):
         self.G = G
 
@@ -10,4 +15,4 @@ class ProcessModel:
         """ Build process constraints from the graph """
 
     def constraints(self) -> Tuple[np.ndarray]:
-        """ """
+        pass

{eqc_models-0.11.1.data → eqc_models-0.12.0.data}/platlib/eqc_models/process/mpc.py

@@ -14,4 +14,4 @@ class ModelPredictiveControl(ProcessModel):
         raise NotImplementedError("subclass must implement processArgs")
 
     def constraints(self) -> Tuple[np.ndarray]:
-        
+        pass

{eqc_models-0.11.1.data → eqc_models-0.12.0.data}/platlib/eqc_models/solvers/__init__.py

@@ -1,9 +1,5 @@
 # (C) Quantum Computing Inc., 2024.
-try:
-    from .eqcdirect import Dirac3DirectSolver, EqcDirectSolver
-except ImportError:
-    # eqc-direct is not available
-    Dirac3DirectSolver = None
+from .eqcdirect import Dirac3DirectSolver
 from .qciclient import (Dirac1CloudSolver, Dirac3CloudSolver, QciClientSolver,
                         Dirac3IntegerCloudSolver, Dirac3ContinuousCloudSolver)
 

eqc_models-0.12.0.data/platlib/eqc_models/solvers/eqcdirect.py

@@ -0,0 +1,71 @@
+# (C) Quantum Computing Inc., 2025.
+import logging
+import numpy as np
+from eqc_direct.client import EqcClient
+from eqc_models.base.base import ModelSolver
+from eqc_models.base.results import SolutionResults
+
+log = logging.getLogger(name=__name__)
+
+
+class Dirac3DirectSolver(ModelSolver):
+    ip_addr: str = "localhost"
+    port: str = "50051"
+    cert_file: str = None
+
+    def solve(
+        self,
+        model,
+        sum_constraint,
+        relaxation_schedule=1,
+        num_samples=1,
+        solution_precision=None,
+        mean_photon_number=None,
+        quantum_fluctuation_coefficient=None,
+    ):
+        polynomial = model.polynomial
+        coefficients = polynomial.coefficients
+        indices = polynomial.indices
+        num_variables = 0
+        for i in range(len(indices)):
+            if max(indices[i]) > num_variables:
+                num_variables = max(indices[i])
+
+        print("Num variables:", num_variables)
+
+        client = self.client
+        lock_id, startts, endts = client.wait_for_lock()
+
+        # assert lock["status_code"] == 0
+
+        # lock_id = lock["lock_id"]
+        response = None
+        try:
+            response = client.solve_sum_constrained(
+                coefficients,
+                indices,
+                num_variables,
+                num_samples=num_samples,
+                lock_id=lock_id,
+                relaxation_schedule=relaxation_schedule,
+                sum_constraint=sum_constraint,
+                solution_precision=solution_precision,
+                mean_photon_number=mean_photon_number,
+                quantum_fluctuation_coefficient=quantum_fluctuation_coefficient,
+            )
+        finally:
+            client.release_lock(lock_id=lock_id)
+
+        return response
+
+    def connect(self, ip_addr: str, port: str, cert_file: str = None):
+        self.ip_addr = ip_addr
+        self.port = port
+        self.cert_file = cert_file
+        client = self.client
+
+        return client.system_status()
+
+    @property
+    def client(self) -> EqcClient:
+        return EqcClient(self.ip_addr, self.port, cert_file=self.cert_file)

{eqc_models-0.11.1.dist-info → eqc_models-0.12.0.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: eqc-models
-Version: 0.11.1
+Version: 0.12.0
 Summary: Optimization and ML modeling package targeting EQC devices
 Author: Quantum Computing Inc.
 Author-email: support@quantumcomputinginc.com
@@ -16,8 +16,7 @@ Requires-Dist: pandas>=2.1.0
 Requires-Dist: scikit-learn>=1.2.1
 Requires-Dist: qci-client<5,>=4.3.0
 Requires-Dist: emucore-direct==1.0.6
-Provides-Extra: direct
-Requires-Dist: eqc-direct<2,>=1.3.0; extra == "direct"
+Requires-Dist: eqc-direct<3,>=2.0.1
 Provides-Extra: dev
 Requires-Dist: pytest<8,>=7.1.0; extra == "dev"
 Requires-Dist: pytest-cov; extra == "dev"

eqc_models-0.12.0.dist-info/RECORD

@@ -0,0 +1,65 @@
+eqc_models-0.12.0.data/platlib/compile_extensions.py,sha256=ivFZ87WFzBITU7IwK_72C41MDNMortJIF8tKevm2aW4,1946
+eqc_models-0.12.0.data/platlib/eqc_models/__init__.py,sha256=WPUijJz2-4UZU-ZTqBofDc-Yaah24geHdmF16SkwIj4,683
+eqc_models-0.12.0.data/platlib/eqc_models/decoding.py,sha256=G3JgbIFzvZ3DIKW0kZ1JeTMIZmrc8hy9kzdbX2Xv5Og,637
+eqc_models-0.12.0.data/platlib/eqc_models/algorithms/__init__.py,sha256=lzQoMMSs2QTqp5suEYNvcQaSEN16d0LwIsZ1mRstumU,135
+eqc_models-0.12.0.data/platlib/eqc_models/algorithms/base.py,sha256=qfQQTwuVyewn7Qpg1_SVoD_7TsdA8vdwSKGqOeZSmNI,204
+eqc_models-0.12.0.data/platlib/eqc_models/algorithms/penaltymultiplier.py,sha256=SndGxCZDS3JTaxFOPJpTBumFdIKcB0dKwSHwfl_BI6o,7845
+eqc_models-0.12.0.data/platlib/eqc_models/allocation/__init__.py,sha256=op_udrapTlWrakTuQId3M0ggo-Y1w4nGJLPcYKOQ-8I,239
+eqc_models-0.12.0.data/platlib/eqc_models/allocation/allocation.py,sha256=PAQn4M75Zegeoy0i6r3hycWs4TKeRglHk05TvwZOoLk,15506
+eqc_models-0.12.0.data/platlib/eqc_models/allocation/portbase.py,sha256=BTnYYduHydPbrE2yQr_Sgv3XJACH_GpIJstuMrfGqCU,3269
+eqc_models-0.12.0.data/platlib/eqc_models/allocation/portmomentum.py,sha256=oMod63rNDC-01dLZjmhUb24SN3_GVgfc6CItgQL_obI,3756
+eqc_models-0.12.0.data/platlib/eqc_models/assignment/__init__.py,sha256=WDlTjWGu75UTxuNUPGNVGoMaYvYILWzZOuS-o72n054,160
+eqc_models-0.12.0.data/platlib/eqc_models/assignment/qap.py,sha256=WMiQQmTORsgi2w7kbmMA1xo-93dESLECWqYTF-zkmTs,2963
+eqc_models-0.12.0.data/platlib/eqc_models/assignment/resource.py,sha256=Ux9e3Badty6bFMqRaLKAGbVRUtb1k1r1_E_2ajOhgb4,6883
+eqc_models-0.12.0.data/platlib/eqc_models/assignment/setpartition.py,sha256=5SQxF_ZlQk4ubWf5_3TgL83k01hAakUP-5AydlD-BvE,161
+eqc_models-0.12.0.data/platlib/eqc_models/base/__init__.py,sha256=wKBppDk1lBiDvGOFnNpzu4lh7n4dQiyd_x3lNQJumTw,2952
+eqc_models-0.12.0.data/platlib/eqc_models/base/base.py,sha256=tL6z0MW4ffMKWlozZ0CH4soTiKxSlMXqyVDctaA110U,6405
+eqc_models-0.12.0.data/platlib/eqc_models/base/constraints.py,sha256=KMPyCdt_8GMWLnVEdpzw1T1WqXm2f7Lh629ClUH7XDY,8271
+eqc_models-0.12.0.data/platlib/eqc_models/base/operators.py,sha256=9nCeN6fRP-_YBfs-Gm57D-O_376qcOQiqGDuVlSlf00,7392
+eqc_models-0.12.0.data/platlib/eqc_models/base/polyeval.c,sha256=bocwtLflgApAjP2W67qZSJAXusFfeCANi3aj486rcPA,476034
+eqc_models-0.12.0.data/platlib/eqc_models/base/polyeval.cpython-310-darwin.so,sha256=nguZ04tigmotFBAmsz1DXha7X7G97pBSGoGDIXMOL5I,108736
+eqc_models-0.12.0.data/platlib/eqc_models/base/polyeval.pyx,sha256=76Bf99Jt1_rLh5byrZxAjavE2F4_yCysirViqOBFIXw,2547
+eqc_models-0.12.0.data/platlib/eqc_models/base/polynomial.py,sha256=FQA26ihFlwfHz9k9XP3qDM0hl5Ko4rtUxiXloj3ail4,13056
+eqc_models-0.12.0.data/platlib/eqc_models/base/quadratic.py,sha256=IKjd-tL6pQosl217knS_ul2BXpk5a8ZZiSUzvKPg8S8,8082
+eqc_models-0.12.0.data/platlib/eqc_models/base/results.py,sha256=P7m88UBA1xir8BOYvA51Cnftrdu7hnWuFqt3lUIEVO8,5831
+eqc_models-0.12.0.data/platlib/eqc_models/combinatorics/__init__.py,sha256=BhzcVxwpWu2b4jIe0bmPzD5VmSyzwp0oW2q9iYx2IUs,167
+eqc_models-0.12.0.data/platlib/eqc_models/combinatorics/setcover.py,sha256=T5hXoE9Ecw3mTHPLmifBwTzpF_4MhoCUgo2rkSOWt5s,3396
+eqc_models-0.12.0.data/platlib/eqc_models/combinatorics/setpartition.py,sha256=ZD69kgEYSU3KWnx0b4MVCP8XSxbA_VCXOW22_Yssl_M,6254
+eqc_models-0.12.0.data/platlib/eqc_models/graph/__init__.py,sha256=PUSoVwzyZSHAbTEBfdakeRxWlkPeeGD1xfyY8OmMxYE,300
+eqc_models-0.12.0.data/platlib/eqc_models/graph/base.py,sha256=K9d7hLgLuBtywEdK9Rz1dUV70Xtf-oVrwqtHyzXK7k4,2117
+eqc_models-0.12.0.data/platlib/eqc_models/graph/hypergraph.py,sha256=ABvutT0NOdIEpUF4TjUzboE4Y_J5iUZyj6-AzKr4R28,13268
+eqc_models-0.12.0.data/platlib/eqc_models/graph/maxcut.py,sha256=o8xVsAwTa9jcpmsIoCQ5z7HSstVdraT8TENomdT519o,4132
+eqc_models-0.12.0.data/platlib/eqc_models/graph/maxkcut.py,sha256=rEDBjto2MbuPh4c0RwTOZoVffKgcriqHNOZAIuBlclQ,4654
+eqc_models-0.12.0.data/platlib/eqc_models/graph/partition.py,sha256=HMpRRipLp14x8pHucY-g6fU7v0PGoy1pf_KpzbanfD0,5800
+eqc_models-0.12.0.data/platlib/eqc_models/graph/shortestpath.py,sha256=5BIvPmYW43juxEDVtIAAlvK6hMP5Kj-fCB7SBKgY124,4988
+eqc_models-0.12.0.data/platlib/eqc_models/ml/__init__.py,sha256=CLfraacr0FrD5ynxlNB6cyNy0lpbavcQT45TvkDrNvY,369
+eqc_models-0.12.0.data/platlib/eqc_models/ml/classifierbase.py,sha256=6W1iMlcorNtOPLS7ui8ED9UQ-xgFBK1yh_besy4swyM,3117
+eqc_models-0.12.0.data/platlib/eqc_models/ml/classifierqboost.py,sha256=oxYnex7Z_iXglupqmMN9bK6gU1DxKcHOo03fLCmELfQ,19456
+eqc_models-0.12.0.data/platlib/eqc_models/ml/classifierqsvm.py,sha256=ELKAdOMExeNjJIJCHd28bf7xQYBI2TpQDGkifldThkU,12120
+eqc_models-0.12.0.data/platlib/eqc_models/ml/clustering.py,sha256=KD8mv_xY9-pRGKDRgeLDO3e38cjftzca4SUBvN4__-I,9522
+eqc_models-0.12.0.data/platlib/eqc_models/ml/clusteringbase.py,sha256=NSoOS_MJpiDrblJ3nQPSFXthJHsBWmTx8RJGhMexNUE,2642
+eqc_models-0.12.0.data/platlib/eqc_models/ml/cvqboost_hamiltonian.pyx,sha256=3PMmEJ_xfmmWXGfire0t-WASnmKj6-CblufgQ2NTARo,2111
+eqc_models-0.12.0.data/platlib/eqc_models/ml/cvqboost_hamiltonian_c_func.c,sha256=ZoKgm_uGjTewhk4W6s-x8QoFuZO0KVkxILIFh6JKsoI,1851
+eqc_models-0.12.0.data/platlib/eqc_models/ml/cvqboost_hamiltonian_c_func.h,sha256=aOImMG5pziUnZxGpDXyWjLrvcY7ZdsczwwSQ2ay4T88,272
+eqc_models-0.12.0.data/platlib/eqc_models/ml/decomposition.py,sha256=Cmw9P-Xv_lzbyD0f-zNjJFX9H0ah--ZLyXUSRYXdfw0,9509
+eqc_models-0.12.0.data/platlib/eqc_models/ml/forecast.py,sha256=fFcBxQK9ZryfEuyvlr9HXicHoZRzLFybimYYttzhI9E,7403
+eqc_models-0.12.0.data/platlib/eqc_models/ml/forecastbase.py,sha256=s-6nUMvtYqG07r7MmmkFVj8_QqgeGkD-HVoEEDTE2bk,3654
+eqc_models-0.12.0.data/platlib/eqc_models/ml/regressor.py,sha256=LA1woXCnefG0wfoOxilX1kszgCUmfNcbQgs_WZ4Ai0o,5683
+eqc_models-0.12.0.data/platlib/eqc_models/ml/regressorbase.py,sha256=H5E8-8pUji1oH5JRdS37LJQoHuKt2JU8eXCZp-ZaEM4,2109
+eqc_models-0.12.0.data/platlib/eqc_models/ml/reservoir.py,sha256=cPRvpCaWLYTBkui35jCssHcOPQgSQZallrG6Ac9djVI,2827
+eqc_models-0.12.0.data/platlib/eqc_models/process/base.py,sha256=QmwbPRc9w9Yr7cwPvdnV6LBdgajif_8WGYGfwApvO34,443
+eqc_models-0.12.0.data/platlib/eqc_models/process/mpc.py,sha256=V7RlA6t08IayV-VKkpK4mC01Lvk3ZTD-HlFYk60snks,645
+eqc_models-0.12.0.data/platlib/eqc_models/sequence/__init__.py,sha256=VXlYufO3GYFsM00oii9Cite2WsQEF8XTwRcjLPH_Zlg,92
+eqc_models-0.12.0.data/platlib/eqc_models/sequence/tsp.py,sha256=YM641FTyK5NkgRGxHrU1QmMkEU0gf77nEmIElTqa6Qw,7680
+eqc_models-0.12.0.data/platlib/eqc_models/solvers/__init__.py,sha256=OLwg3lxMh2rali4lovIxnR-CA1CISNnD5LRgCv48cck,432
+eqc_models-0.12.0.data/platlib/eqc_models/solvers/eqcdirect.py,sha256=VMMQzcW2VmalJ8__c_8hbygL0Kx0NDsL6HCi9l2T5-o,2115
+eqc_models-0.12.0.data/platlib/eqc_models/solvers/qciclient.py,sha256=73m6TNqwxvtgeVHKcym87UXqkSAAj4UrVeDRKlr7ys0,27362
+eqc_models-0.12.0.data/platlib/eqc_models/utilities/__init__.py,sha256=SI2U7JKmPWSiq-F1WcSyfd7l9V6nbOZv_p8quMAZaT0,340
+eqc_models-0.12.0.data/platlib/eqc_models/utilities/fileio.py,sha256=alWPTfjGFx6Iio9HZAAWtYcLmZsBBifg6S6_YbFMQhk,1088
+eqc_models-0.12.0.data/platlib/eqc_models/utilities/polynomial.py,sha256=blXfu7Ehz9lT4nEmIinRzJOL27_qUHSbQ57zxmwDJCA,4735
+eqc_models-0.12.0.data/platlib/eqc_models/utilities/qplib.py,sha256=Do-MjmCFdI5HyDOAjfoz4_5lugySLMBlMAWDLUWx2OA,15796
+eqc_models-0.12.0.dist-info/licenses/LICENSE.txt,sha256=8eh0oqsNNVR1Jk-13gkqRRSo2axtUU5kp2KzH4f9u3U,11354
+eqc_models-0.12.0.dist-info/METADATA,sha256=LlwLohomCtAUlHu7eVM5ZicCPxrgu0YI4r8NWfmGT2Q,7087
+eqc_models-0.12.0.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
+eqc_models-0.12.0.dist-info/top_level.txt,sha256=9ZfFeKNEvkRlKWoUnfcZ9TzmTdgdsuPEnTPy11Hqf4Q,30
+eqc_models-0.12.0.dist-info/RECORD,,

{eqc_models-0.11.1.dist-info → eqc_models-0.12.0.dist-info}/WHEEL

@@ -1,5 +1,5 @@
 Wheel-Version: 1.0
-Generator: setuptools (80.1.0)
+Generator: setuptools (80.9.0)
 Root-Is-Purelib: true
 Tag: py3-none-any
 

eqc_models-0.11.1.data/platlib/eqc_models/graph/__init__.py

@@ -1,6 +0,0 @@
-# (C) Quantum Computing Inc., 2024.
-
-from .maxcut import MaxCutModel
-from .partition import GraphPartitionModel
-
-__all__ = ["MaxCutModel", "GraphPartitionModel"]