.png){kind=icon}
.png){kind=icon}
Return
Fixed-point oblivious quantum amplitude-amplification algorithm
.png){kind=icon}
OA
AI
DOI：10.1038/s41598-022-15093-x.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The quantum amplitude amplification algorithms based on Grover's rotation operator need to perform phase flips for both the initial state and the target state. When the initial state is oblivious, the phase flips will be intractable, and we need to adopt oblivious amplitude amplification algorithm to handle. Without knowing exactly how many target items there are, oblivious amplitude amplification also suffers the souffle problem, in which iterating too little undercooks the state and too much overcooks the state, both resulting in a mostly non-target final state. In this work, we present a fixed-point oblivious quantum amplitude-amplification (FOQA) algorithm by introducing damping based on methods proposed by A. Mizel. Moreover, we construct the quantum circuit to implement our algorithm under the framework of duality quantum computing. Our algorithm can avoid the souffle problem, meanwhile keep the square speedup of quantum search, serving as a subroutine to improve the performance of quantum algorithms containing oblivious amplitude amplification procedure.
Keywords:
MATHEMATICAL-THEORY
SEARCH
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.9
Papers:
27.1W
Citations:
83.5W