Quantum Proofs for Classical Theorems

Andrew Drucker; Ronald de Wolf

doi:10.4086/toc.gs.2011.002

Quantum Proofs for Classical Theorems

Andrew Drucker, Ronald de Wolf

Research output: Contribution to journal › Article › peer-review

Abstract / Description of output

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 language	English
Pages (from-to)	1-54
Number of pages	54
Journal	Theory of Computing, Graduate Surveys
Volume	2
DOIs	https://doi.org/10.4086/toc.gs.2011.002
Publication status	Published - 2011

Access to Document

10.4086/toc.gs.2011.002

Drucker De Wolk 2011 Quantum Proofs for Classical TheoremsFinal published version, 495 KB

http://dx.doi.org/10.4086/toc.gs.2011.002

Cite this

@article{41fc9b2f15b047b58be2f8f1f9be4e7c,

title = "Quantum Proofs for Classical Theorems",

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. ",

author = "Andrew Drucker and Wolf, {Ronald de}",

year = "2011",

doi = "10.4086/toc.gs.2011.002",

language = "English",

volume = "2",

pages = "1--54",

journal = "Theory of Computing, Graduate Surveys",

}

TY - JOUR

T1 - Quantum Proofs for Classical Theorems

AU - Drucker, Andrew

AU - Wolf, Ronald de

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

U2 - 10.4086/toc.gs.2011.002

DO - 10.4086/toc.gs.2011.002

M3 - Article

VL - 2

SP - 1

EP - 54

JO - Theory of Computing, Graduate Surveys

JF - Theory of Computing, Graduate Surveys

ER -

Quantum Proofs for Classical Theorems

Abstract / Description of output

Access to Document

Fingerprint

Cite this