You're viewing papers too quickly. Please wait a moment.<br>This helps keep the archive available for everyone.
Quick Navigation
Topics
Quantum Algorithms
Convergence rate of algorithms for solving linear equations by quantum annealing
arXiv
Authors: V. Shalgin, S. Tikhomirov
Year
2023
Paper ID
57286
Status
Preprint
Abstract Read
~2 min
Abstract Words
75
Citations
N/A
Abstract
We consider various iterative algorithms for solving the linear equation ax=b using a quantum computer operating on the principle of quantum annealing. Assuming that the computer's output is described by the Boltzmann distribution, it is shown under which conditions the equation-solving algorithms converge, and an estimate of their convergence rate is provided. The application of this approach to algorithms using both an infinite number of qubits and a small number of qubits is discussed.
Why This Paper Matters
- It adds a 2023 reference point for readers tracking recent quantum research.
- We consider various iterative algorithms for solving the linear equation ax=b using a quantum computer operating on the principle of quantum annealing.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.