Hybrid Quantum Computation Architecture for Solving Quadratic Unconstrained Binary Optimization Problems
AssigneeTerra Quantum AG
InventorsAlexey Pakhomchik, Mikhail Perelshtein
Life of this patent
Estimating the term…
Loading patent…
AssigneeTerra Quantum AG
InventorsAlexey Pakhomchik, Mikhail Perelshtein
Estimating the term…
The disclosure relates to a method of driving a quantum computational network for determining an extremal value of a cost function for solutions of a quadratic unconstrained binary optimization problem, the method comprising: initializing qubits, sequentially applying layers of quantum gates to the qubits, wherein each layer comprises multi-qubit quantum gates acting on a plurality of qubits and a plurality of variational quantum gates with two eigenvalues and variable actions onto the qubits, wherein the variable actions of the variational quantum gates of the layers of quantum gates form a set of variational parameters {right arrow over (θ)}, and determining an output state of the quantum computational network for obtaining a solution associated with the set of variational parameters {right arrow over (θ)}, wherein each binary variable of the quadratic unconstrained binary optimization problem is associated with a computational basis state of the register qubits, and the solution is obtained by evaluating the probabilities of measuring the computational basis states corresponding to the binary variables, and wherein the solution is iteratively improved by, determining an output state for shifted variational parameters {right arrow over (θ)}* to evaluate a partial derivative with respect to the subset of the variational parameters {right arrow over (θ)} for determining a gradient of the cost function based on the output state for the shifted variational parameters {right arrow over (θ)}*, and by updating the variational parameters {right arrow over (θ)}based on an update function of a moving average over the gradient of the cost function and of a moving average over the squared gradient of the cost function.
A method of driving a quantum computational network for determining an extremal value of a cost function for solutions of a quadratic unconstrained binary optimization problem, the quantum computational network comprising a plurality of qubits, including a plurality of register qubits and at least one ancilla qubit in a qubit register, and further comprises a plurality of layers of quantum gates acting on the qubits, the method comprising:
The method of any one of the preceding claims, wherein the layers of quantum gates comprise the same arrangement of quantum gates in each layer and wherein the quantum gates in each layer in particular comprise a plurality of multi-qubit quantum gates which together act on all qubits of the qubit register.
The method of any one of the preceding claims, wherein each layer of quantum gates comprises a set of variational qubit gates acting on each qubit of the qubit register, wherein the set of variational qubit gates is in particular a set of variational single qubit gates.
The method of any one of the preceding claims, wherein the number of variational qubit gates in each layer is substantially equal to the number of qubits in the qubit register.
The method of any one of the preceding claims, wherein the computational basis state of the register qubits is a tensor product of the computational basis of a plurality of the register qubits, in particular a tensor product of the computational basis of all register qubits.
The method of any of the preceding claims, wherein the qubits of the quantum computational network are arranged into log (Nc) register qubits and a number of Na ancilla qubits for solving a quadratic unconstrained binary optimization problem with Nc classical binary variables.
The method of any of the preceding claims, wherein the solution is obtained by evaluating the conditional probabilities of measuring an ancilla state of the at least one ancilla qubit and of measuring one of the computational basis states of the register qubits corresponding to the binary variable.
The method of any of the preceding claims, wherein the update function is substantially proportional to the moving average over the gradient of the cost function and substantially inversely proportional to the square root of the moving average over the squared gradient of the cost function, wherein the moving average over the gradient of the cost function and of a moving average over the squared gradient of the cost function are in particular exponentially decaying moving averages.
The method of any one of the preceding claims, wherein the update function at an iterative step t is mathematically equivalent to:
The method according to claim 10, wherein
The method according to any one of the preceding claims, wherein the method comprises sequentially applying the layers of quantum gates with shifted variational parameters {right arrow over (θ)}* twice for each variational gate, the shifted variational parameters {right arrow over (θ)}* comprising a subset of the variational parameters {right arrow over (θ)} shifted by symmetric shifts for each variational gate, to evaluate a partial derivative with respect to each variable action of the variational parameters {right arrow over (θ)} for determining the gradient before updating the variational parameters {right arrow over (θ)}.
The method of any one of the preceding claims, wherein the two eigenvalues of the variational quantum gates are ±½ and the shift is ±π/2.
A method of driving a quantum computational network for determining an extremal value of a cost function for solutions of a quadratic unconstrained binary optimization problem, the quantum computational network comprising a plurality of qubits and further comprises a plurality of layers of quantum gates acting on the qubits, the method comprising:
A hybrid quantum computation system for determining an extremal value of a cost function for solutions of a quadratic unconstrained binary optimization problem, the system comprising:
Dependencies are inferred from the claim text.