Work

Quantum Proofs for Classical Theorems

Year: 2011

Type: article

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.

Source: Theory of Computing

DOI: 10.4086/toc.gs.2011.002

Authors: Andrew Drucker, Ronald de Wolf

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: European Commission, Nederlandse Organisatie voor Wetenschappelijk Onderzoek, Defense Advanced Research Projects Agency

Award: G5946206379

OpenAlex ID: W2095739278