One Complexity Theorist's View of Quantum Computing
| dc.creator | Fortnow, Lance | |
| dc.date | 2000-03-09 | |
| dc.date.accessioned | 2026-07-07T05:59:42Z | |
| dc.date.available | 2026-07-07T05:59:42Z | |
| dc.description | The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or the other as to how useful these machines will be. The tools of computational complexity theory should come to bear on these important questions. Quantum computing often scares away many potential researchers from computer science because of the apparent background need in quantum mechanics and the alien looking notation used in papers on the topic. This paper will give an overview of quantum computation from the point of view of a complexity theorist. We will see that one can think of BQP as yet another complexity class and study its power without focusing on the physical aspects behind it. | |
| dc.description | 13 pages. Based on a talk presented at the Second Workshop on Algorithms in Quantum Information Processing at DePaul University, Chicago, January 21, 1999 | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0003035 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0003035 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/88774 | |
| dc.subject | Quantum Physics | |
| dc.subject | Computational Complexity | |
| dc.title | One Complexity Theorist's View of Quantum Computing | |
| dc.type | text |