fulfill functions public key cryptography quantum based cryptographic systems could therefore secure traditional systems quantum hacking search problems well known example problem admitting polynomial quantum speedup ''unstructured search'' finding marked item list math n math items database solved grover 's algorithm using math sqrt n math queries database quadratically fewer math omega n math queries required classical algorithms case advantage provable also optimal shown grover 's algorithm gives
Formal science Computer science Quantum computing