학술
Optimal phase change for a generalized Grover's algorithm
arXiv Math
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.Abstract
We study the generalized Grover's algorithm with an arbitrary amplitude vector to find the optimal phase change for maximizing the gain in probability for the target of each iteration.
In the classic setting of Grover's algorithm with a real initial amplitude vector, we find that a phase change of $\pi$ stays optimal until the probability of observing the target is quite close to 1.
We provide a formula for identifying this cut-off point based on the size of the data set.
When the amplitude is truly complex, we find that the optimal phase change depends non-trivially on the complexity of the amplitude vector.
We provide an optimization formula to identify the required optimal phase change.
관련 뉴스
'research' 카테고리 뉴스
Correction: Pupillary dynamics during hands-off L2 driving and transitions of control under high cognitive load
PLOS ONE
Correction: Ornamental motifs and visual concerns: Exploring aesthetic pleasure and conservation intention in architectural heritage renovation
PLOS ONE
Correction: Who is disrupting whom? Examining the nighttime activity patterns of humans and their dogs
PLOS ONE