Margolus–Levitin theorem
The Margolus–Levitin theorem, named for Norman Margolus and Lev B. Levitin, gives a fundamental limit on quantum computation (strictly speaking on all forms on computation). The processing rate cannot be higher than 6 × 1033 operations per second per joule of energy. Or stating the bound for one bit:
See also
- Bekenstein bound
- Bremermann's limit
- Landauer's principle
- Kolmogorov complexity
- Koomey's law
- Limits to computation
- Moore's law
References
- Norman Margolus, Lev B. Levitin (1998). "The maximum speed of dynamical evolution". Physica D. 120 (1–2): 188–195. arXiv:quant-ph/9710043. Bibcode:1998PhyD..120..188M. doi:10.1016/S0167-2789(98)00054-2.CS1 maint: uses authors parameter (link)
- Deffner, Sebastian; Campbell, Steve (2017), "Quantum speed limits", Journal of Physics A, 50: 453001, arXiv:1705.08023, Bibcode:2017JPhA...50S3001D, doi:10.1088/1751-8121/aa86c6
- Jordan, Stephen P. (2017), "Fast quantum computation at arbitrarily low energy", Physical Review A, 95 (3): 032305, arXiv:1701.01175, Bibcode:2017PhRvA..95c2305J, doi:10.1103/PhysRevA.95.032305
- Lloyd, Seth; Ng, Y. Jack, "Black Hole Computers", Scientific American (April 2007), p. 53–61
- Sinitsyn, Nikolai A. (2018). "Is there a quantum limit on speed of computation?". Physics Letters A. 382: 477–481. arXiv:1701.05550. Bibcode:2018PhLA..382..477S. doi:10.1016/j.physleta.2017.12.042.
| General |  | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Theorems | |||||||||
| Quantum communication | |||||||||
| Quantum algorithms | |||||||||
| Quantum complexity theory | |||||||||
| Quantum computing models | |||||||||
| Quantum error correction | |||||||||
| Physical implementations |
| ||||||||
| Software | |||||||||
| |||||||||
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.