Near-term quantum algorithms for linear systems of equations
Hsin-Yuan Huang, Kishor Bharti, Patrick Rebentrost

TL;DR
This paper introduces near-term quantum algorithms for solving large linear systems, leveraging variational methods and classical combination of quantum states, with promising scalability demonstrated through classical simulations.
Contribution
The paper proposes a novel near-term quantum algorithm based on classical combination of variational quantum states and provides theoretical guarantees and scalability analysis.
Findings
Algorithms can solve systems up to 2^300 size
Scalability demonstrated for 100-300 qubits
Supports heuristic and gradient-based improvements
Abstract
Solving linear systems of equations is essential for many problems in science and technology, including problems in machine learning. Existing quantum algorithms have demonstrated the potential for large speedups, but the required quantum resources are not immediately available on near-term quantum devices. In this work, we study near-term quantum algorithms for linear systems of equations of the form . We investigate the use of variational algorithms and analyze their optimization landscapes. There exist types of linear systems for which variational algorithms designed to avoid barren plateaus, such as properly-initialized imaginary time evolution and adiabatic-inspired optimization, suffer from a different plateau problem. To circumvent this issue, we design near-term algorithms based on a core idea: the classical combination of variational quantum states (CQS). We exhibit…
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Neural Networks and Reservoir Computing
