Solving Linear Equations via VQE (Variational Quantum Eigensolver)
We consider the following linear equation:
\begin{align*}
Ax=b, \tag{1}
\end{align*}
where an invertible matrix , a vector , and an unknown variable .
For calculation on quantum computers, let be a power of 2 and assume , where represents the norm of induced by the usual inner product of .
We note that is antilinear with respect to the right side in our notation.
We now put
\begin{align*}
H = A^*(I - b\hat{\otimes}b)A,
\end{align*}
where represents the Schatten form; that is, for ,
\begin{align*}
x\hat{\otimes}y\colon \mathbb{C}^n\ni z\mapsto \langle z,y\rangle x \in \mathbb{C}^n,
\end{align*}
which corresponds to the "ket-bra" in the quantum mechanics/information.
Proposition. defined as above is Hermitian and positive semidefinite, and has a minimal eigenvalue 0. Furthermore, the solution to equation (1) is an eigenvector corresponding to eigenvalue 0 of .
Proof. It is obvious that is Hermitian. We see the remaining assertion since is a projection to the orthogonal complement of the subspace spanned by .
Let be an initial quantum state and , be a parametrized unitary operator called "ansatz" and denote .
Then, by minimizing
\begin{align*}
L(\theta):= \langle Hu(\theta),u(\theta)\rangle
\end{align*}
with respect to , we get an approximated solution to (1) on a quantum computer.
References
[1] X. Xu et al., Variational algorithms for linear algebra, arXiv:1909.03898, 2019.