.png){kind=icon}
返回
A framework for optimal quantum spatial search using alternating phase-walks
.png){kind=icon}
OA
AI
DOI：10.1088/2058-9565/ac26af.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a novel methodological framework for quantum spatial search, generalising the Childs & Goldstone (CG) algorithm via alternating applications of marked-vertex phase shifts and continuous-time quantum walks. We determine closed form expressions for the optimal walk time and phase shift parameters for periodic graphs. These parameters are chosen to rotate the system about subsets of the graph Laplacian eigenstates, amplifying the probability of measuring the marked vertex. The state evolution is asymptotically optimal for any class of periodic graphs having a fixed number of unique eigenvalues. We demonstrate the effectiveness of the algorithm by applying it to obtain O(root N) search on a variety of graphs. One important class is the n x n(3) rook graph, which has N = n(4) vertices. On this class of graphs the CG algorithm performs suboptimally, achieving only O(N-1/8) overlap after time O(N-5/8). Using the new alternating phase-walk framework, we show that O(1) overlap is obtained in O(root N) phase-walk iterations.
Keyword:
quantum spatial search
quantum algorithm
quantum walk
期刊
IF:
5
论文数:
1.4K
被引数:
5.1K
机构
引用论文
Fast-forwarding of Hamiltonians and exponentially precise measurements.png)
NATURE COMMUNICATIONS
OAAI
NATURE COMMUNICATIONSIF15.7
OAAI分享收藏Three-dimensional time-marching aeroelastic analyses using an unstructured-grid Euler methodAIAA JournalOAAI
AIAA JournalIF0
OAAI分享收藏Transcriptome analysis of Vibrio parahaemolyticus in type III secretion system 1 inducing conditionsOAAI
OAAI分享收藏
查看更多内容