Solving a Linear System of Equations on a Quantum Computer by Measurement
Alain Giresse Tene, Thomas Konrad

TL;DR
The paper introduces a measurement-based variational quantum algorithm capable of solving dense linear systems efficiently, overcoming limitations of previous methods in accuracy, matrix density, and eigenvalue encoding.
Contribution
It presents a novel measurement test algorithm that directly maximizes target fidelity without relying on Pauli decomposition, suitable for dense matrices.
Findings
Successfully simulated dense 16x16 matrices with non-zero determinants.
Achieves target fidelity with accuracy scaling as 1/N per measurements.
Overcomes previous variational algorithms' limitations regarding matrix density and condition number.
Abstract
We present a variational algorithm for fault tolerant quantum computing to solve a system of linear equations which directly maximises the parameters of the target fidelity. This so-called measurement test algorithm can be applied to any computational task with a solution that is represented as eigenvector of a self-adjoint matrix. The solution is prepared as state of a register in the quantum computer by a von Neumann measurement of a corresponding observable, which is implemented using the phase estimation algorithm. The probability to project the system thus into the unknown target state, which equals the target fidelity, is measured in terms of relative frequencies and iteratively optimised to read out the target state. The new algorithm overcomes three issues of previous variational quantum algorithms: i) It does not rely on a decomposition in terms of Pauli strings and therefore…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
