Review Article | Published:

Ultimate physical limits to computation

Nature volume 406, pages 10471054 (31 August 2000) | Download Citation

Subjects

Computers are physical systems: the laws of physics dictate what they can and cannot do. In particular, the speed with which a physical device can process information is limited by its energy and the amount of information that it can process is limited by the number of degrees of freedom it possesses. Here I explore the physical limits of computation as determined by the speed of light c, the quantum scale and the gravitational constant G. As an example, I put quantitative bounds to the computational power of an ‘ultimate laptop’ with a mass of one kilogram confined to a volume of one litre.

Access optionsAccess options

Rent or Buy article

Get time limited or full article access on ReadCube.

from$8.99

All prices are NET prices.

References

  1. 1.

    Theory of Heat (Appleton, London, 1871).

  2. 2.

    Vorträge über die kinetische Theorie der Materie u. Elektrizitat (Leipzig, 1914).

  3. 3.

    Über die Entropieverminderung in einem thermodynamischen System bei Eingriffen intelligenter Wesen. Z. Physik 53, 840– 856 (1929).

  4. 4.

    Science and Information Theory (Academic Press, New York, 1953).

  5. 5.

    Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183–191 (1961).

  6. 6.

    & Minimal energy dissipation in logic . IBM J. Res. Dev. 14, 152– 157 (1970).

  7. 7.

    Dissipation and noise-immunity in computation and communication. Nature 335, 779–784 ( 1988).

  8. 8.

    Information is physical. Phys. Today 44, 23–29 (1991).

  9. 9.

    The physical nature of information. Phys. Lett. A 217 , 188–193 (1996).

  10. 10.

    Theory of Self-Reproducing Automata Lect. 3 (Univ. Illinois Press, Urbana, IL, 1966).

  11. 11.

    & Information transmission by electromagnetic field. Inform. Control 9, 1–22 (1966).

  12. 12.

    in Proceedings of the 3rd International Symposium on Radio Electronics part 3, 1–15 (Varna, Bulgaria, 1970).

  13. 13.

    Physical limitations of rate, depth, and minimum energy in information processing . Int. J. Theor. Phys. 21, 299– 309 (1982).

  14. 14.

    Energy cost of information transmission (along the path to understanding) . Physica D 120, 162–167 (1998).

  15. 15.

    & in Proceedings of the Fourth Workshop on Physics and Computation—PhysComp96 (eds Toffoli, T., Biafore, M. & Leão, J.) (New England Complex Systems Institute, Boston, MA, 1996).

  16. 16.

    & The maximum speed of dynamical evolution. Physica D 120, 188– 195 (1998).

  17. 17.

    in Self-Organizing Systems (eds Yovits, M. C., Jacobi, G. T. & Goldstein, G. D.) 93–106 (Spartan Books, Washington DC, 1962).

  18. 18.

    in Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability (eds LeCam, L. M. & Neymen, J.) Vol. 4, 15–20 (Univ. California Press, Berkeley, CA, 1967).

  19. 19.

    Minimum energy requirements of information transfer and computing. Int. J. Theor. Phys. 21, 203–217 (1982).

  20. 20.

    Universal upper bound on the entropy-to-energy ration for bounded systems . Phys. Rev. D 23, 287– 298 (1981).

  21. 21.

    Energy cost of information transfer. Phys. Rev. Lett. 46, 623–626 (1981).

  22. 22.

    Entropy content and information flow in systems with limited energy. Phys. Rev. D 30, 1669–1679 (1984).

  23. 23.

    & Time in the quantum theory and the uncertainty relation for the time and energy domain. Phys. Rev. 122, 1649–1658 ( 1961).

  24. 24.

    & Answer to Fock concerning the time-energy indeterminancy relation. Phys. Rev. B 134, 1417–1418 (1964).

  25. 25.

    & Geometry of quantum evolution. Phys. Rev. Lett. 65, 1697–1700 (1990).

  26. 26.

    Quantum Theory: Concepts and Methods (Kluwer, Hingham, 1995).

  27. 27.

    Machines de Turing réversibles. C.R. Acad. Sci. 257, 2597–2600 (1963).

  28. 28.

    Logical reversibility of computation. IBM J. Res. Dev. 17, 525–532 (1973).

  29. 29.

    Thermodynamics of computation—a review. Int. J. Theor. Phys. 21, 905–940 ( 1982).

  30. 30.

    Demons, engines and the second law. Sci. Am. 257, 108 (1987).

  31. 31.

    & Conservative logic. Int. J. Theor. Phys. 21, 219–253 (1982).

  32. 32.

    Classical and quantum limitations on energy consumption in computation. Int. J. Theor. Phys. 21, 311–325 (1982).

  33. 33.

    et al. in Proceedings of the 1985 Chapel Hill Conference on VLSI (ed. Fuchs, H.) (Computer Science Press, Rockville, MD, 1985).

  34. 34.

    Reversible electronic logic using switches. Nanotechnology 34, 21–40 (1993).

  35. 35.

    & in Proceedings of the 1993 Symposium on Integrated Systems, Seattle, Washington (eds Berrielo, G. & Ebeling, C.) (MIT Press, Cambridge, MA, 1993).

  36. 36.

    & Complexity as thermodynamic depth . Ann. Phys. 188, 186–213 (1988).

  37. 37.

    Use of mutual information to decrease entropy—implications for the Second Law of Thermodynamics. Phys. Rev. A 39, 5378–5386 (1989).

  38. 38.

    Thermodynamic cost of computation, algorithmic complexity and the information metric. Nature 341, 119– 124 (1989).

  39. 39.

    & Maxwell's Demon: Entropy, Information, Computing (Princeton Univ. Press, Princeton, 1990).

  40. 40.

    Quantum mechanical Maxwell's demon. Phys. Rev. A 56 , 3374–3382 (1997).

  41. 41.

    The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. J. Stat. Phys. 22, 563–591 ( 1980).

  42. 42.

    Quantum mechanical models of Turing machines that dissipate no energy. Phys. Rev. Lett. 48, 1581–1585 (1982).

  43. 43.

    P. Simulating physics with computers. Int. J. Theor. Phys. 21, 467 (1982).

  44. 44.

    Quantum mechanical computers. Optics News 11, 11 (1985); reprinted in Found. Phys. 16, 507 (1986).

  45. 45.

    Reversibility and stability of information-processing systems. Phys. Rev. Lett. 53, 391–394 (1984).

  46. 46.

    Reversible logic and quantum computers. Phys. Rev. A 32, 3266–3276 (1985).

  47. 47.

    Quantum-theory, the Church-Turing principle, and the universal quantum computer . Proc. R. Soc. Lond. A 400, 97– 117 (1985).

  48. 48.

    Quantum computation. Ann. N.Y. Acad. Sci. 480, 487–497 (1986).

  49. 49.

    Quantum computational networks. Proc. R. Soc. Lond. A 425, 73–90 (1989).

  50. 50.

    in Complexity, Entropy, and the Physics of Information, Santa Fe Institute Studies in the Sciences of Complexity Vol. VIII (ed. Zurek, W. H.) 273–288 (Addison Wesley, Redwood City, 1991).

  51. 51.

    Quantum-mechanical computers and uncomputability. Phys. Rev. Lett. 71, 943–946 ( 1993).

  52. 52.

    A potentially realizable quantum computer. Science 261, 1569–1571 (1993).

  53. 53.

    Necessary and sufficient conditions for quantum computation. J. Mod. Opt. 41, 2503–2520 (1994).

  54. 54.

    in Proceedings of the 35th Annual Symposium on Foundations of Computer Science (ed. Goldwasser, S.) 124–134 (IEEE Computer Society, Los Alamitos, CA, 1994).

  55. 55.

    Quantum-mechanical computers. Sci. Am. 273, 140–145 (1995).

  56. 56.

    Quantum computation. Science 270, 255– 261 (1995).

  57. 57.

    2-Bit gates are universal for quantum computation. Phys. Rev. A 51, 1015–1022 ( 1995).

  58. 58.

    & Realizable universal quantum logic gates. Phys. Rev. Lett. 74, 4087– 4090 (1995).

  59. 59.

    et al. Elementary gates for quantum computation. Phys. Rev. A 52, 3457–3467 ( 1995).

  60. 60.

    Almost any quantum logic gate is universal. Phys. Rev. Lett. 75, 346–349 (1995).

  61. 61.

    , & Universality in quantum computation. Proc. R. Soc. Lond. A 449, 669–677 (1995).

  62. 62.

    & Quantum computation with cold ion traps. Phys. Rev. Lett. 74, 4091– 4094 (1995).

  63. 63.

    , , & Decoherence, continuous observation, and quantum computing—a cavity QED model. Phys. Rev. Lett. 75, 3788– 3791 (1995).

  64. 64.

    , , , & Measurement of conditional phase-shifts for quantum logic. Phys. Rev. Lett. 75, 4710– 4713 (1995).

  65. 65.

    , , , & Demonstration of a fundamental quantum logic gate. Phys. Rev. Lett. 75, 4714–4717 (1995).

  66. 66.

    in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing 212–218 (ACM Press, New York, 1996 ).

  67. 67.

    Universal quantum simulators. Science 273, 1073–1078 (1996).

  68. 68.

    Simulating quantum systems on a quantum computer. Proc. R. Soc. Lond A 454, 313–322 ( 1998).

  69. 69.

    A scheme for reducing decoherence in quantum memory. Phys. Rev. A 52, R2493–R2496 ( 1995).

  70. 70.

    Error correcting codes in quantum theory. Phys. Rev. Lett. 77, 793–797 (1996).

  71. 71.

    , , & Perfect quantum error correcting code. Phys. Rev. Lett. 77, 198–201 (1996).

  72. 72.

    & Fault-tolerant error correction with efficient quantum codes. Phys. Rev. Lett. 77, 3260–3263 ( 1996).

  73. 73.

    in Proceedings of the 37th Annual Symposium on the Foundations of Computer Science 56–65 (IEEE Computer Society Press, Los Alamitos, CA, 1996).

  74. 74.

    Reliable quantum computers. Proc. R. Soc. Lond. A 454 , 385–410 (1998).

  75. 75.

    , & Resilient quantum computation. Science 279, 342–345 ( 1998).

  76. 76.

    , & in Proceedings of the Fourth Workshop on Physics and Computation—PhysComp96 (eds Toffoli, T., Biafore, M. & Leão, J.) 87–91 (New England Complex Systems Institute, Boston, MA, 1996).

  77. 77.

    & Bulk spin-resonance quantum computation. Science 275, 350– 356 (1997).

  78. 78.

    , K., , & Experimental realization of a quantum algorithm. Nature 393, 143– 146 (1998).

  79. 79.

    , & Implementation of a quantum search algorithm on a quantum computer. Nature 393, 344– 346 (1998).

  80. 80.

    , & Experimental implementation of fast quantum searching . Phys. Rev. Lett. 80, 3408– 3411 (1998).

  81. 81.

    A silicon-based nuclear-spin quantum computer. Nature 393, 133 (1998).

  82. 82.

    , & Coherent control of macroscopic quantum states in a single-Cooper-pair box. Nature 398, 786 –788 (1999).

  83. 83.

    et al. Josephson persistent-current qubit. Science 285, 1036–1039 (1999).

  84. 84.

    & Quantum computation over continuous variables. Phys. Rev. Lett. 82, 1784– 1787 (1999).

  85. 85.

    & Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and P problems. Phys. Rev. Lett. 81, 3992–3995 (1998).

  86. 86.

    & Relativistic Astrophysics (Univ. of Chicago Press, Chicago, 1971 ).

  87. 87.

    & Black Holes (Springer, Berlin, 1986).

  88. 88.

    The Cosmic Code: Quantum Physics as the Language of Nature (Simon and Schuster, New York, 1982).

  89. 89.

    , & Growing hair on black-holes. Phys. Rev. Lett. 67, 1975–1978 ( 1991).

  90. 90.

    Quantum hair. Phys. Scr. T 36, 258– 264 (1991).

  91. 91.

    , & Black-hole thermodynamics and information loss in 2 dimensions. Phys. Rev. D 50, 3987– 4014 (1994).

  92. 92.

    & Black-hole entropy in canonical quantum-gravity and superstring theory. Phys. Rev. D 50, 2700–2711 (1994).

  93. 93.

    & Microscopic origin of the Bekenstein-Hawking entropy. Phys. Lett. B 37, 99– 104 (1996).

  94. 94.

    & Comparing decay rates for black holes and D-branes. Nucl. Phys. B 478, 561 –576 (1996).

  95. 95.

    Particle emision rates from a black-hole: massless particles form an uncharged non-rotating black-hole. Phys. Rev. D 13, 198 (1976).

  96. 96.

    , & in Black Holes: The Membrane Paradigm Ch. VIII (eds Thorne, K. S., Price, R. H. & Macdonald, D. A.) 280– 340 (Yale Univ. Press, New Haven, CT, 1986).

Download references

Author information

Affiliations

  1. d'Arbeloff Laboratory for Information Systems and Technology, MIT Department of Mechanical Engineering, Massachusetts Institute of Technology 3-160, Cambridge, Massachusetts 02139, USA (slloyd@mit.edu)

    • Seth Lloyd

Authors

  1. Search for Seth Lloyd in:

About this article

Publication history

Published

DOI

https://doi.org/10.1038/35023282

Further reading Further reading

Comments

By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.

Newsletter Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing