Computing, IT & AI

Quantum complexity theory

1993-1997 CEUmesh Vazirani and Ethan BernsteinQuantum complexity theory (STOC 1993; SIAM J. Computing 1997)Diaspora (work abroad)

1993

Defined what quantum computers can compute efficiently, and gave an early quantum speed-up.

Dated: 1993–1997
As scholars put it: 1993-1997 CE
Originator: Umesh Vazirani and Ethan Bernstein
Source text: Quantum complexity theory (STOC 1993; SIAM J. Computing 1997)
Region: Diaspora (work abroad)
Discipline: Computing, IT & AI
Evidence: Documented
Confidence: High
Verification: Verified-web

Background

Umesh Vazirani, an Indian-American at UC Berkeley, and his student Ethan Bernstein defined the quantum Turing machine and the class BQP of problems a quantum computer can solve efficiently. Their Bernstein-Vazirani algorithm learns a hidden string with a single query, where a classical computer needs many.

Significance

Gave quantum computing its formal foundation and helped inspire Simon's and Shor's algorithms.

Path to modern innovation

BQP is the standard yardstick for quantum advantage.

Global impact

The theory used to judge claims of quantum advantage.

References

3Quantum complexity theory E. Bernstein and U. Vazirani, 1997