Quantum proofs for classical theorems
| Authors |
|
|---|---|
| Publication date | 09-03-2011 |
| Journal | Theory of Computing |
| Volume | Issue number | Theory of Computing Library, Graduate Surveys | 2 |
| Number of pages | 54 |
| Organisations |
|
| 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. |
| Document type | Article |
| Language | English |
| Published at | https://doi.org/10.4086/toc.gs.2011.002 |
| Downloads |
gs002
(Final published version)
|
| Permalink to this page | |