Keywords

Physics

Affiliated Institutions

Related Publications

On the Power of Quantum Computation

The quantum model of computation is a model, analogous to the probabilistic Turing machine (PTM), in which the normal laws of chance are replaced by those obeyed by particles on...

1997 SIAM Journal on Computing 1261 citations

On the power of quantum computation

The quantum model of computation is a probabilistic model, similar to the probabilistic Turing Machine, in which the laws of chance are those obeyed by particles on a quantum me...

2002 Proceedings 35th Annual Symposium on ... 476 citations

Quantum complexity theory

In this dissertation we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing Machine in De...

1993 Proceedings of the twenty-fifth annua... 1266 citations

Publication Info

Year
2015
Type
article
Volume
11
Issue
4
Pages
291-293
Citations
461
Access
Closed

External Links

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

461
OpenAlex

Cite This

Scott Aaronson (2015). Read the fine print. Nature Physics , 11 (4) , 291-293. https://doi.org/10.1038/nphys3272

Identifiers

DOI
10.1038/nphys3272