Various iterative algorithms for solving the linear equation ax=b using a quantum computer operating on the principle of quantum annealing are studied. Assuming that the result produced by the computer is described by the Boltzmann distribution, conditions under which these algorithms converge are obtained and an estimate of their convergence rate is provided. Application of this approach for algorithms that use an infinite number of qubits and a small number of qubits is considered.
Translated title of the contributionСкорость сходимости алгоритмов решения линейного уравнения методом квантового отжига
Original languageEnglish
Pages (from-to)989-1003
Number of pages15
JournalComputational Mathematics and Mathematical Physics
Volume64
Issue number5
DOIs
StatePublished - 13 Jun 2024

    Research areas

  • adiabatic quantum computations, quantum annealing, linear equation, Boltzmann distribution, truncated normal distribution

ID: 126322227