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.
Asked
Active
Viewed 30 times
