Abstract: A processor can control quantum hardware to transform qubit states associated with a plurality of pairs of data points in a training dataset using a circuit parameter representing a rotation angle. Inner products of transformed qubit states associated with the plurality of pairs of data points can be computed. The processor can minimize an objective function based on the inner products, where the minimizing finds a target circuit parameter representing a target rotation angle that minimizes the objective function. A processor can build a kernel matrix based on the inner products computed for a sample dataset and the target circuit parameter passed to the quantum hardware. A classification algorithm can use the kernel matrix to classify the sample dataset.

Abstract: A method and system of generating a route includes receiving information regarding a set of nodes to be serviced. One or more parameters of each node are determined. A capacity of each of the one or more vehicles is determined. A classical computer is used to generate a set of feasible routes based on the one or more parameters of each node and the capacity of each of the one or more vehicles. A number of bags N to divide the set of feasible routes is determined. The feasible routes are distributed into the N bags. The N bags are sent to a quantum computer to calculate a most efficient combination of feasible routes that cover all nodes to be serviced.

Abstract: A method and system of generating a route includes receiving information regarding a set of nodes to be serviced. One or more parameters of each node are determined. A capacity of each of the one or more vehicles is determined. A classical computer is used to generate a set of feasible routes based on the one or more parameters of each node and the capacity of each of the one or more vehicles. A number of bags N to divide the set of feasible routes is determined. The feasible routes are distributed into the N bags. The N bags are sent to a quantum computer to calculate a most efficient combination of feasible routes that cover all nodes to be serviced.