Quantum computing's true power

What makes this fascinating

• Not just “faster computers” — Quantum machines help only for problems with the right structure — not for everything.

• Shor vs. the rest — Factoring falls to a dramatic quantum speedup; for many other problems the advantage is modest or unknown.

• Where's the true boundary? — Exactly which problems quantum computers can crack that classical ones can't is still an open question.

Frequently asked questions

What can quantum computers do that classical computers can't?

For specific problems — factoring (Shor's algorithm) and simulating quantum systems — they offer dramatic speedups. For most everyday computing they offer no advantage.

What is quantum supremacy?

The point where a quantum computer performs a task no classical computer can feasibly match. Demonstrations exist, but on contrived benchmarks rather than useful applications.

Which problems can quantum computers actually solve faster?

That is itself an open question. The exact boundary of quantum advantage — the complexity class BQP versus classical computation — is not fully understood.

More summits in Computer Science

• Artificial general intelligence

  Can a machine match the full, flexible breadth of human thought — and how would we know?

• The foundations of cryptography

  All modern security rests on a bet: that some problems are truly hard. Can we ever prove it?

• AI interpretability

  We build neural networks we can't read. Can we ever truly understand what they learn inside?

• Provably correct software

  Can we ever write software proven, mathematically, to be free of bugs and exploits?