# Quantum Computation and the Foundations of Computational Complexity Theory

### APA

Cuffaro, M. (2017). Quantum Computation and the Foundations of Computational Complexity Theory. Perimeter Institute. https://pirsa.org/17030046

### MLA

Cuffaro, Michael. Quantum Computation and the Foundations of Computational Complexity Theory. Perimeter Institute, Mar. 28, 2017, https://pirsa.org/17030046

### BibTex

@misc{ pirsa_17030046, doi = {}, url = {https://pirsa.org/17030046}, author = {Cuffaro, Michael}, keywords = {Quantum Foundations}, language = {en}, title = {Quantum Computation and the Foundations of Computational Complexity Theory}, publisher = {Perimeter Institute}, year = {2017}, month = {mar}, note = {PIRSA:17030046 see, \url{https://pirsa.org}} }

## Abstract

Computational complexity theory is a branch of computer science dedicated to classifying computational problems in terms of their difficulty. While computability theory tells us what we can compute in principle, complexity theory informs us regarding what is feasible. In this chapter I argue that the science of quantum computing illuminates the foundations of complexity theory by emphasising that its fundamental concepts are not model-independent. However this does not, as some have suggested, force us to radically revise the foundations of the theory. For model-independence never has been essential to those foundations. The fundamental aim of complexity theory is to describe what is achievable in practice under various models of computation for our various practical purposes. Reflecting on quantum computing illuminates complexity theory by reminding us of this, too often under-emphasised, fact.