.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
Search is one of the most commonly used primitives in quantum algorithm design. It is known that quadratic speedups provided by Grover's algorithm are optimal, and no faster quantum algorithms for Search exist. While it is known that at least some quantum computation is required to achieve these speedups, the existing bounds do not rule out the possibility of an equally fast hybrid quantum-classical algorithm where most of the computation is classical. In this work, we study such hybrid algorithms, and we show that classical computation, unless it by itself can solve the Search problem, cannot assist quantum computation. In addition, we generalize this result to algorithms with subconstant success probabilities.
Keyword:
Quantum search
multiple oracles
quantum speedups
期刊
A
IF:
6.8
论文数:
540
被引数:
508
机构
引用论文
.png){kind=icon}
分享.png){kind=icon}
收藏Human Sperm Binding Is Mediated by the Sialyl-Lewis
x
Oligosaccharide on the Zona Pellucida.png)
Science.png)
OAAI
ScienceIF0
OAAI分享收藏Nickel-trimethylphosphine complexes: crystal and molecular structure and decomposition reaction of methyltetrakis(trimethylphosphine)nickel(II) tetraphenylborate镍-三甲基膦配合物: 甲基四 (三甲基膦) 四苯基硼酸镍 (II) 的晶体和分子结构及分解反应
PREAI
分享收藏Relationships among Puberty, Muscle and Fat, and Liveweight Gain during Mating in Young Female Sheep青年母羊在配种期间青春期、肌肉与脂肪以及体重增长之间的关系
OAAI
OAAI分享收藏 没有更多内容
没有更多内容