0

Do we have an example of a task that provably consumes more time/memory in the case of a classical computer than a quantum one? For example, Shor's factorization is polynomial, while the classical deterministic factorization algorithms, as far as I know, are subexponential, but the polynomial algorithm is unknown, but also there is no proof that it exists, nor is there a converse proof. Please don't give "essentially quantum" problems that have no classical analogues, like bosonic sampling or something like that.

Join the party P.A.R.T.Y.
  • 1
  • 2
    Grover's algorithm requires provably fewer oracle queries when searching a completely unstructured database. – Rammus Jun 16 '23 at 09:15
  • @Join the P.A.R.T.Y., welcome to QCSE. Your question is a good one, but may versions of it have been asked on this site before. I recommend you take a look at here along with some of the links therein. If you can narrow your question more, it could also be helpful. Briefly, there are many provable separations, including both polynomial and exponential separations, for many practical problems, but in the "oracle" world. – Mark Spinelli Jun 16 '23 at 16:30

0 Answers0