Quantum optimization algorithms

Quantum optimization algorithms are quantum algorithms that are used to solve optimization problems. Mathematical optimization deals with finding the best solution to a problem (according to some criteria) from a set of possible solutions. Mostly, the optimization problem is formulated as a minimization problem, where one tries to minimize an error which depends on the solution: the optimal solution has the minimal error. Different optimization techniques are applied in various fields such as mechanics, economics and engineering, and as the complexity and amount of data involved rise, more efficient ways of solving optimization problems are needed. The power of quantum computing may allow problems which are not practically feasible on classical computers to be solved, or suggest a considerable speed up with respect to the best known classical algorithm.

Quantum data fitting

Data fitting is a process of constructing a mathematical function that best fits a set of data points. The fit's quality is measured by some criteria, usually the distance between the function and the data points.

Quantum least squares fitting

One of the most common types of data fitting is solving the least squares problem, minimizing the sum of the squares of differences between the data points and the fitted function.

The algorithm is given as input $N$ data points $(x_1, y_1), (x_2, y_2), ... , (x_N, y_N)$ and $M$ continuous functions $f_, f_, ... , f_$. The algorithm finds and gives as output a continuous function $f_$ that is a linear combination of $f_j$:

:$f_(x) = \sum_^M f_(x)\lambda_$

In other words, the algorithm finds the complex coefficients $\lambda_j$, and thus finds the vector $\vec = (\lambda_1, \lambda_2, ..., \lambda_M)$.

The algorithm is aimed at minimizing the error, which is given by:
:$E=\sum_^N \left\vert f_(x_i)-y_i \right\vert^2 = \sum_^N \left\vert \sum_^M f_(x_i)\lambda_-y_i \right\vert^2 = \left\vert F\vec-\vec \right\vert^2$
where we define $F$ to be the following matrix:

:$= \begin f_(x_1) & \cdots & f_(x_1) \\ f_(x_2) & \cdots & f_(x_2) \\ \vdots & \ddots & \vdots \\ f_(x_N) & \cdots & f_(x_N) \\ \end$

The quantum least-squares fitting algorithm makes use of a version of Harrow, Hassidim, and Lloyd's quantum algorithm for linear systems of equations (HHL), and outputs the coefficients $\lambda_j$ and the fit quality estimation $E$. It consists of three subroutines: an algorithm for performing a pseudo- inverse operation, one routine for the fit quality estimation, and an algorithm for learning the fit parameters.

Because the quantum algorithm is mainly based on the HHL algorithm, it suggests an exponential improvement in the case where $F$ is sparse and the condition number (namely, the ratio between the largest and the smallest eigenvalues) of both $F F^\dagger$ and $F^\dagger F$ is small.

Quantum semidefinite programming

Semidefinite programming (SDP) is an optimization subfield dealing with the optimization of a linear objective function (a user-specified function to be minimized or maximized), over the intersection of the cone of positive semidefinite matrices with an affine space. The objective function is an inner product of a matrix $C$ (given as an input) with the variable $X$. Denote by $\mathbb^n$ the space of all $n \times n$ symmetric matrices. The variable $X$ must lie in the (closed convex) cone of positive semidefinite symmetric matrices $\mathbb^_+$. The inner product of two matrices is defined as:

$\langle A,B\rangle_ = (A^T B) = \sum_^n A_B_.$

The problem may have additional constraints (given as inputs), also usually formulated as inner products. Each constraint forces the inner product of the matrices $A_k$ (given as an input) with the optimization variable $X$ to be smaller than a specified value $b_k$ (given as an input). Finally, the SDP problem can be written as:
:$\begin & \langle C, X \rangle_ \\ \text & \langle A_k, X \rangle_ \leq b_k, \quad k = 1,\ldots,m \\ & X \succeq 0 \end$

The best classical algorithm is not known to unconditionally run in polynomial time. The corresponding feasibility problem is known to either lie outside of the union of the complexity classes NP and co-NP, or in the intersection of NP and co-NP.

The quantum algorithm

The algorithm inputs are $A_1 ... A_m, C , b_1 ... b_m$ and parameters regarding the solution's trace, precision and optimal value (the objective function's value at the optimal point).

The quantum algorithm consists of several iterations. In each iteration, it solves a feasibility problem, namely, finds any solution satisfying the following conditions (giving a threshold $t$):

:$\begin \langle C, X \rangle_ \leq t \\ \langle A_k, X \rangle_ \leq b_k, \quad k = 1,\ldots,m \\ X \succeq 0 \end$

In each iteration, a different threshold $t$ is chosen, and the algorithm outputs either a solution $X$ such that $\langle C, X\rangle_ \leq t$ (and the other constraints are satisfied, too) or an indication that no such solution exists. The algorithm performs a binary search to find the minimal threshold $t$ for which a solution $X$ still exists: this gives the minimal solution to the SDP problem.

The quantum algorithm provides a quadratic improvement over the best classical algorithm in the general case, and an exponential improvement when the input matrices are of low rank.

Quantum combinatorial optimization

The combinatorial optimization problem is aimed at finding an optimal object from a finite set of objects. The problem can be phrased as a maximization of an objective function which is a sum of boolean functions. Each boolean function $\,C_\alpha \colon \lbrace ^n \rightarrow \lbrace \rbrace$ gets as input the $n$-bit string $z = z_1 z_2 \ldots z_n$ and gives as output one bit (0 or 1). The combinatorial optimization problem of $n$ bits and $m$ clauses is finding an $n$-bit string $z$ that maximizes the function
:$C(z) = \sum_^m C_\alpha(z)$

Approximate optimization is a way of finding an approximate solution to an optimization problem, which is often NP-hard. The approximated solution of the combinatorial optimization problem is a string $z$ that is close to maximizing $C(z)$.

Quantum approximate optimization algorithm

For combinatorial optimization, the quantum approximate optimization algorithm (QAOA) briefly had a better approximation ratio than any known polynomial time classical algorithm (for a certain problem), until a more effective classical algorithm was proposed. The relative speed-up of the quantum algorithm is an open research question.

The heart of QAOA relies on the use of unitary operators dependent on $2p$ angles, where $p>1$ is an input integer. These operators are iteratively applied on a state that is an equal-weighted quantum superposition of all the possible states in the computational basis. In each iteration, the state is measured in the computational basis and $C(z)$ is estimated. The angles are then updated classically to increase $C(z)$. After this procedure is repeated a sufficient number of times, the value of $C(z)$ is almost optimal, and the state being measured is close to being optimal as well.

In 2020, it was shown that QAOA exhibits a strong dependence on the ratio of a problem's constraint to variables (problem density) placing a limiting restriction on the algorithm's capacity to minimize a corresponding objective function.

It was soon recognized that a generalization of the QAOA process is essentially an alternating application of a continuous-time quantum walk on an underlying graph followed by a quality-dependent phase shift applied to each solution state. This generalized QAOA was termed as QWOA (Quantum Walk-based Optimisation Algorithm).

In the paper ''How many qubits are needed for quantum computational supremacy'' submitted to arXiv, the authors conclude that a QAOA circuit with 420 qubits and 500 constraints would require at least one century to be simulated using a classical simulation algorithm running on state-of-the-art supercomputers so that would be sufficient for quantum computational supremacy.

A rigorous comparison of QAOA with classical algorithms can give estimates on depth $p$ and number of qubits required for quantum advantage. A study of QAOA and MaxCut algorithm shows that $p>11$ is required for scalable advantage.

See also

*Adiabatic quantum computation
*Quantum annealing

References

{{Quantum information

Quantum algorithms