.png){kind=icon}
.png){kind=icon}
Return
Improved quantum linear system solver via quantum phase discrimination
.png){kind=icon}
PRE
AI
DOI：10.1140/epjs/s11734-025-01627-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The problem of solving linear systems is of great significance in both theory and practice, for which quantum solvers have been shown to provide an exponential speedup over the best-known classical solvers. Recently, a quantum linear system solver has been developed with the state-of-the-art complexity [1], which combines two techniques, namely, discrete adiabatic evolution and eigenstate filtering. However, the parameters of the quantum circuit for eigenstate filtering need to be precomputed classically via the discrete Fourier transform, which introduces additional computational overhead. In this paper, we improve the solver by presenting a new eigenstate filtering process termed quantum phase discrimination in which the circuit parameters are given directly in a concise and analytical form with negligible classical overhead, while maintaining the same quantum complexity.
Journal
IF:
2.3
Papers:
436
Citations:
7.1K