4 ms·
TLDR; This is showing that a regular probabilistic computer can't do certain cryptographic problems faster than a quantum computer ( BPP < BQP). Others have co
by zitterbewegung 4y ago
TLDR; This is showing that a regular probabilistic computer can't do certain cryptographic problems faster than a quantum computer ( BPP < BQP).
Others have commented here that this is due to the fact that Quantum computers must be fully reversible operations which is in correct.
- tsimionescu 4y agoI think you mistyped, but just to be clear: it's showing that a regular probabilistic classical computer can't do certain cryptographic problems faster than a quantum computer.