|
| related topics |
| {algorithm, log, probability} |
| {theory, mechanics, state} |
| {let, theorem, proof} |
| {state, algorithm, problem} |
| {alice, bob, state} |
| {particle, mechanics, theory} |
| {state, states, entangled} |
| {qubit, qubits, gate} |
| {bell, inequality, local} |
| {time, systems, information} |
| {field, particle, equation} |
| {information, entropy, channel} |
| {energy, gaussian, time} |
| {observables, space, algebra} |
| {cos, sin, state} |
| {error, code, errors} |
| {vol, operators, histories} |
| {states, state, optimal} |
| {entanglement, phys, rev} |
| {energy, state, states} |
| {key, protocol, security} |
| {measurement, state, measurements} |
| {temperature, thermal, energy} |
|
Limits on Efficient Computation in the Physical World
Scott Aaronson
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.
- oai_identifier:
- oai:arXiv.org:quant-ph/0412143
- categories:
- quant-ph cs.CC
- comments:
- UC Berkeley PhD thesis, 258 pages. Some minor errors fixed
- arxiv_id:
- quant-ph/0412143
- created:
- 2004-12-20
- updated:
- 2005-02-15
Full article ▸
|
|
| related documents |
| 0509153v1 |
| 0510230v3 |
| 0603135v1 |
| 0703231v2 |
| 0510185v1 |
| 0504083v2 |
| 0612089v3 |
| 0607148v3 |
| 0504067v3 |
| 0511272v1 |
| 0505007v3 |
| 0610235v2 |
| 0702245v5 |
| 0512241v1 |
| 0609220v1 |
| 0503101v1 |
| 0702007v2 |
| 0609166v1 |
| 0610105v1 |
| 0609160v1 |
| 0508156v3 |
| 0506266v2 |
| 0610214v3 |
| 0606077v1 |
| 0604191v1 |
|