Quantifying computational advantage of Grover's algorithm with the trace speed.

Sci Rep

QSTAR, INO-CNR and LENS, Largo Enrico Fermi 2, 50125, Firenze, Italy.

Published: January 2021

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.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC7809032PMC
http://dx.doi.org/10.1038/s41598-020-80153-zDOI Listing

Publication Analysis

Top Keywords

trace speed
12
quantum speed-up
12
quantum
6
speed-up
5
quantifying computational
4
computational advantage
4
advantage grover's
4
algorithm
4
grover's algorithm
4
algorithm trace
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!