Error convergence of quantum linear system solvers

• URL: http://arxiv.org/abs/2410.18736v1
• Date: Thu, 24 Oct 2024 13:41:29 GMT
• Title: Error convergence of quantum linear system solvers
• Authors: Matias Ginzburg, Ugo Marzolino,
• Abstract summary: We analyze the performance of the Harrow-Hassidim-Lloyd algorithm (HHL algorithm) for solving linear problems. We prove that the computational error of the variant algorithm does not always converge to zero when the number of qubits is increased.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We analyze the performance of the Harrow-Hassidim-Lloyd algorithm (HHL algorithm) for solving linear problems and of a variant of this algorithm (HHL variant) commonly encountered in literature. This variant relieves the algorithm of preparing an entangled initial state of an auxiliary register. We prove that the computational error of the variant algorithm does not always converge to zero when the number of qubits is increased, unlike the original HHL algorithm. Both algorithms rely upon two fundamental quantum algorithms, the quantum phase estimation and the amplitude amplification. In particular, the error of the HHL variant oscillates due to the presence of undesired phases in the amplitude to be amplified, while these oscillations are suppressed in the original HHL algorithm. Then, we propose a modification of the HHL variant, by amplifying an amplitude of the state vector that does not exhibit the above destructive interference. We also study the complexity of these algorithms in the light of recent results on simulation of unitaries used in the quantum phase estimation step, and show that the modified algorithm has smaller error and lower complexity than the HHL variant. We supported our findings with numerical simulations.

Related papers

• Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA [55.2480439325792]
  We present a new method for calculating expectation values of operators that can be expressed as a linear combination of unitary (LCU) operators. This method is general for any quantum algorithm and is of particular interest in the acceleration of variational quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-03T17:15:23Z)
• Quantum Discrete Adiabatic Linear Solver based on Block Encoding and Eigenvalue Separator [5.138262101775231]
  The rise of quantum computing has spurred interest in quantum linear system problems. The performance of the HHL algorithm is constrained by its dependence on the square of the condition number. This work proposes a quantum discrete adiabatic linear solver based on block encoding and eigenvalue separation techniques.
  arXiv  Detail & Related papers  (2024-12-09T04:50:48Z)
• A quantum algorithm for advection-diffusion equation by a probabilistic imaginary-time evolution operator [0.0]
  We propose a quantum algorithm for solving the linear advection-diffusion equation by employing a new approximate probabilistic imaginary-time evolution (PITE) operator. We construct the explicit quantum circuit for realizing the imaginary-time evolution of the Hamiltonian coming from the advection-diffusion equation. Our algorithm gives comparable result to the Harrow-Hassidim-Lloyd (HHL) algorithm with similar gate complexity, while we need much less ancillary qubits.
  arXiv  Detail & Related papers  (2024-09-27T08:56:21Z)
• Quantum and classical algorithms for nonlinear unitary dynamics [0.5729426778193399]
  We present a quantum algorithm for a non-linear differential equation of the form $fracd|urangledt. We also introduce a classical algorithm based on the Euler method allowing comparably scaling to the quantum algorithm in a restricted case.
  arXiv  Detail & Related papers  (2024-07-10T14:08:58Z)
• Optimal Algorithms for the Inhomogeneous Spiked Wigner Model [89.1371983413931]
  We derive an approximate message-passing algorithm (AMP) for the inhomogeneous problem. We identify in particular the existence of a statistical-to-computational gap where known algorithms require a signal-to-noise ratio bigger than the information-theoretic threshold to perform better than random.
  arXiv  Detail & Related papers  (2023-02-13T19:57:17Z)
• Adaptive Algorithm for Quantum Amplitude Estimation [13.82667502131475]
  We propose an adaptive algorithm for interval estimation of amplitudes. The proposed algorithm uses a similar number of quantum queries to achieve the same level of precision. We rigorously prove that the number of oracle queries achieves $O(1/epsilon)$, i.e., a quadratic speedup over classical Monte Carlo sampling.
  arXiv  Detail & Related papers  (2022-06-16T21:11:15Z)
• Alternatives to a nonhomogeneous partial differential equation quantum algorithm [52.77024349608834]
  We propose a quantum algorithm for solving nonhomogeneous linear partial differential equations of the form $Apsi(textbfr)=f(textbfr)$. These achievements enable easier experimental implementation of the quantum algorithm based on nowadays technology.
  arXiv  Detail & Related papers  (2022-05-11T14:29:39Z)
• First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems [88.58409977434269]
  We consider the problem of computing an equilibrium in a class of nonlinear generalized Nash equilibrium problems (NGNEPs) Our contribution is to provide two simple first-order algorithmic frameworks based on the quadratic penalty method and the augmented Lagrangian method. We provide nonasymptotic theoretical guarantees for these algorithms.
  arXiv  Detail & Related papers  (2022-04-07T00:11:05Z)
• Bregman divergence based em algorithm and its application to classical and quantum rate distortion theory [61.12008553173672]
  We address the minimization problem of the Bregman divergence between an exponential subfamily and a mixture subfamily in a Bregman divergence system. We apply this algorithm to rate distortion and its variants including the quantum setting.
  arXiv  Detail & Related papers  (2022-01-07T13:33:28Z)
• Optimization and Noise Analysis of the Quantum Algorithm for Solving One-Dimensional Poisson Equation [17.65730040410185]
  We propose an efficient quantum algorithm for solving one-dimensional Poisson equation. We further develop this algorithm to make it closer to the real application on the noisy intermediate-scale quantum (NISQ) devices. We analyze the effect of common noise existing in the real quantum devices on our algorithm using the IBM Qiskit toolkit.
  arXiv  Detail & Related papers  (2021-08-27T09:44:41Z)
• Quantum Gaussian process regression [3.4501155479285326]
  The proposed quantum algorithm consists of three sub-algorithms. One is the first quantum subalgorithm to efficiently generate mean predictor. The other is to product covariance predictor with same method.
  arXiv  Detail & Related papers  (2021-06-12T07:03:27Z)
• Single-Timescale Stochastic Nonconvex-Concave Optimization for Smooth Nonlinear TD Learning [145.54544979467872]
  We propose two single-timescale single-loop algorithms that require only one data point each step. Our results are expressed in a form of simultaneous primal and dual side convergence.
  arXiv  Detail & Related papers  (2020-08-23T20:36:49Z)
• Optimal Randomized First-Order Methods for Least-Squares Problems [56.05635751529922]
  This class of algorithms encompasses several randomized methods among the fastest solvers for least-squares problems. We focus on two classical embeddings, namely, Gaussian projections and subsampled Hadamard transforms. Our resulting algorithm yields the best complexity known for solving least-squares problems with no condition number dependence.
  arXiv  Detail & Related papers  (2020-02-21T17:45:32Z)

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.