DOE OSTI · 1763676
Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
Abstract
We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial state with non-trivial overlap with the target eigenstate and have a reasonable lower bound for the spectral gap. We apply this algorithm to the quantum linear system problem (QLSP), and present two algorithms based on quantum adiabatic computing (AQC) and quantum Zeno effect respectively. Both algorithms prepare the final solution as a pure state, and achieves the near optimal $\mathcal{\tilde{O}}$(dκlog(1/ϵ)) query complexity for a d -sparse matrix, where κ is the condition number, and ϵ is the desired precision. Neither algorithm uses phase estimation or amplitude amplification.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Lin, Lin, Tong, Yu. 2020-11-11. Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems. https://doi.org/10.22331/q-2020-11-11-361. https://searchnasa.com/record/osti%3A1763676/optimal-polynomial-based-quantum-eigenstate-filtering-with-application-to-solving-quantum-linear-sys
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.