首页    期刊浏览 2024年07月03日 星期三
登录注册

文章基本信息

  • 标题:Quantifying computational advantage of Grover’s algorithm with the trace speed
  • 本地全文:下载
  • 作者:Valentin Gebhart ; Luca Pezzè ; Augusto Smerzi
  • 期刊名称:Scientific Reports
  • 电子版ISSN:2045-2322
  • 出版年度:2021
  • 卷号:11
  • 期号:1
  • 页码:1288
  • DOI:10.1038/s41598-020-80153-z
  • 出版社:Springer Nature
  • 摘要:Despite intensive research, the physical origin of the speed-up offered by quantum algorithms remains mysterious. No general physical quantity, like, for instance, entanglement, can be singled out as the essential useful resource. Here we report a close connection between the trace speed and the quantum speed-up in Grover’s search algorithm implemented with pure and pseudo-pure states. For a noiseless algorithm, we find a one-to-one correspondence between the quantum speed-up and the polarization of the pseudo-pure state, which can be connected to a wide class of quantum statistical speeds. For time-dependent partial depolarization and for interrupted Grover searches, the speed-up is specifically bounded by the maximal trace speed that occurs during the algorithm operations. Our results quantify the quantum speed-up with a physical resource that is experimentally measurable and related to multipartite entanglement and quantum coherence.
国家哲学社会科学文献中心版权所有