Quantum supremacy

Can a quantum computer solve problems faster than any classical computer?

Imagine you're trying to find the best route for a delivery truck in a city with millions of possible paths. A classical computer would take a very long time to check each route.

Grover's algorithm can search through all possible routes much faster than a classical computer by using quantum principles. It's like having a super-smart assistant who can quickly narrow down the best route for the truck.

Example

If there are 1 million possible routes, a classical computer might take 1 million checks, but Grover's algorithm can find the best route in about √1 million checks.

Remember this

Grover's algorithm provides a superpolynomial speedup in searching unsorted databases.

Text adapted from Wikipedia, licensed under CC BY-SA 4.0.

Related concepts

Shor's algorithm

Shor's algorithm factors integers in polynomial time on a quantum computer

Quantum computing

Quantum computers can solve certain problems exponentially faster than classical computers

Superconducting quantum computing

Can flipping a coin change its outcome?

Matrix multiplication algorithm

Ever wondered how computers speed up multiplying huge numbers?

Quantum key distribution

Can secret messages be intercepted without anyone noticing?

Quantum mind

Can quantum computers solve puzzles faster than our brains?

Swipe through 100 ML concepts daily

Open Pocket Polymath