Experimental realization of quantum algorithm for solving linear systems of equations
Jian Pan, Yudong Cao, Xiwei Yao, Zhaokai Li, Chenyong Ju, Xinhua Peng,, Sabre Kais, and Jiangfeng Du

TL;DR
This paper reports the first experimental implementation of a quantum algorithm for solving linear systems using a 4-qubit NMR quantum processor, achieving over 96% fidelity across different test cases.
Contribution
It demonstrates the practical feasibility of the quantum linear systems algorithm on a small-scale quantum processor, marking a significant step toward real-world quantum computing applications.
Findings
Achieved over 96% fidelity in solving linear systems with NMR quantum processor
First experimental demonstration of the quantum linear systems algorithm
Potential implications for solving practical linear problems in science and engineering
Abstract
Quantum computers have the potential of solving certain problems exponentially faster than classical computers. Recently, Harrow, Hassidim and Lloyd proposed a quantum algorithm for solving linear systems of equations: given an matrix and a vector , find the vector that satisfies . It has been shown that using the algorithm one could obtain the solution encoded in a quantum state using quantum operations, while classical algorithms require at least O(N) steps. If one is not interested in the solution itself but certain statistical feature of the solution ( is some quantum mechanical operator), the quantum algorithm will be able to achieve exponential speedup over the best classical algorithm as grows. Here we report a proof-of-concept experimental demonstration of the quantum algorithm using…
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.
