Quantum Proofs for Classical Theorems

Andrew Drucker, Ronald de Wolf

Research output: Contribution to journalArticlepeer-review

Abstract

Alongside the development of quantum algorithms and quantum complexity theory in recent years, quantum techniques have also proved instrumental in obtaining results in diverse classical (non-quantum) areas, such as coding theory, communication complexity, and polynomial approximations. In this paper we survey these results and the quantum toolbox they use.
Original languageEnglish
Pages (from-to)1-54
Number of pages54
JournalTheory of Computing, Graduate Surveys
Volume2
DOIs
Publication statusPublished - 2011

Fingerprint

Dive into the research topics of 'Quantum Proofs for Classical Theorems'. Together they form a unique fingerprint.

Cite this