arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.04486quant-ph

Quantifying Computational Advantage of Grover's Algorithm with the Trace Speed

Valentin Gebhart, Luca Pezzè, Augusto Smerzi

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑