.png){kind=icon}
返回
Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
.png){kind=icon}
OA
AI
DOI：10.22331/q-2020-11-11-361.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 (O) over tilde (dk, log(1/6)) query complexity for a d-sparse matrix, where k is the condition number, and epsilon is the desired precision. Neither algorithm uses phase estimation or amplitude amplification.
Keyword:
ALGORITHMS
PHASE
期刊
IF:
5.4
论文数:
974
被引数:
1.0W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容