Solving a Linear System of Equations on a Quantum Computer by Measurement

• URL: http://arxiv.org/abs/2604.26098v1
• Date: Tue, 28 Apr 2026 20:28:28 GMT
• Title: Solving a Linear System of Equations on a Quantum Computer by Measurement
• Abstract summary: We present a variational algorithm for fault tolerant quantum computing.<n>It can be applied to any computational task with a solution that is represented as eigenvector of a self-adjoint matrix.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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 can compute eigenvectors of dense matrices. ii) The accuracy is not limited by the condition number $κ$ of the matrix, provided a logarithmic number ($O(\logκ)$) of qubits is used to encode the eigenvalues and iii) the target fidelity $F_T = 1-ε$ can be reached with an accuracy $ε$ that scales with $1/N$ for $N$ measurements per iteration. We demonstrate this by numerical simulations for dense random real-valued $16\times 16$ matrices with non-vanishing determinant.

Related papers

• Matrix encoding method in variational algorithm of calculating eigenvalues and generalized eigenvalues [51.97380440677861]
  We propose a variational method for constructing the eigenvalues and generalized eigenvalues for an arbitrary $Ntimes N$ complex matrix.<n>The quantum part of our algorithm is based on encoding the matrix elements into the pure state of a quantum system.
  arXiv  Detail & Related papers  (2026-05-07T12:52:34Z)
• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• A probabilistic quantum algorithm for Lyapunov equations and matrix inversion [0.0]
  We present a probabilistic quantum algorithm for preparing mixed states proportional to the solutions of Lyapunov equations.<n>At each step the algorithm either returns the current state, applies a trace non-increasing completely positive map, or restarts depending on the outcomes of a biased coin flip and an ancilla measurement.<n>In its most general form, the algorithm generates mixed states which approximate matrix-valued weighted sums and integrals.
  arXiv  Detail & Related papers  (2025-08-06T17:52:06Z)
• Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
  We propose the variational quantum singular value decomposition based on encoding the elements of the considered $Ntimes N$ matrix into the state of a quantum system of appropriate dimension.<n> Controlled measurement is involved to avoid small success in ancilla measurement.
  arXiv  Detail & Related papers  (2025-03-19T07:01:38Z)
• Quantum Eigensolver for Non-Normal Matrices via Ground State Energy Estimation [0.4511923587827302]
  Large-scale eigenvalue problems pose a significant challenge to classical computers.<n>We propose a quantum algorithm that outputs an estimate of an eigenvalue to within additive error $epsilon$ with probability at least $1-p_rm fail$.<n>Our algorithm is the first general eigenvalue algorithm that achieves this scaling.
  arXiv  Detail & Related papers  (2025-02-25T11:43:47Z)
• Quantum algorithms for calculating determinant and inverse of matrix and solving linear algebraic systems [43.53835128052666]
  We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)times (N-1)$ matrix.<n>The basic idea is to encode each row of the matrix into a pure state of some quantum system.
  arXiv  Detail & Related papers  (2024-01-29T23:23:27Z)
• A square-root speedup for finding the smallest eigenvalue [0.6597195879147555]
  We describe a quantum algorithm for finding the smallest eigenvalue of a Hermitian matrix. This algorithm combines Quantum Phase Estimation and Quantum Amplitude Estimation to achieve a quadratic speedup. We also provide a similar algorithm with the same runtime that allows us to prepare a quantum state lying mostly in the matrix's low-energy subspace.
  arXiv  Detail & Related papers  (2023-11-07T22:52:56Z)
• Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra [3.4137115855910767]
  We propose a class of randomized quantum algorithms for the task of sampling from matrix functions. Our use of qubits is purely algorithmic, and no additional qubits are required for quantum data structures.
  arXiv  Detail & Related papers  (2023-02-03T17:22:49Z)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• Quantum algorithms for spectral sums [50.045011844765185]
  We propose new quantum algorithms for estimating spectral sums of positive semi-definite (PSD) matrices. We show how the algorithms and techniques used in this work can be applied to three problems in spectral graph theory.
  arXiv  Detail & Related papers  (2020-11-12T16:29:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.