Limits on Efficient Computation in the Physical World
Quantum Physics
2007-05-23 v2 Computational Complexity
Abstract
More than a speculative technology, quantum computing seems to challenge our most basic intuitions about how the physical world should behave. In this thesis I show that, while some intuitions from classical computer science must be jettisoned in the light of modern physics, many others emerge nearly unscathed; and I use powerful tools from computational complexity theory to help determine which are which.
Cite
@article{arxiv.quant-ph/0412143,
title = {Limits on Efficient Computation in the Physical World},
author = {Scott Aaronson},
journal= {arXiv preprint arXiv:quant-ph/0412143},
year = {2007}
}
Comments
UC Berkeley PhD thesis, 258 pages. Some minor errors fixed