Limits on Efficient Computation in the Physical World

Simple item page
dc.creatorAaronson, Scott
dc.date2004-12-20
dc.date2005-02-15
dc.date.accessioned2026-07-07T06:11:47Z
dc.date.available2026-07-07T06:11:47Z
dc.descriptionMore 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.
dc.descriptionUC Berkeley PhD thesis, 258 pages. Some minor errors fixed
dc.identifierhttps://arxiv.org/abs/quant-ph/0412143
dc.identifierhttp://arxiv.org/abs/quant-ph/0412143
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/92595
dc.subjectQuantum Physics
dc.subjectComputational Complexity
dc.titleLimits on Efficient Computation in the Physical World
dc.typetext

Files

Collections

arXiv