Cited by 571Cosmology and Gravitation TheoriesComputability, Logic, AI AlgorithmsBlack Holes and Theoretical Physics

Computational Capacity of the Universe

Open access
Lloyd, Seth·2002·Physical Review Letters

Abstract

All physical systems register and process information. The laws of physics determine the amount of information that a physical system can register (number of bits) and the number of elementary logic operations that a system can perform (number of ops). The Universe is a physical system. The amount of information that the Universe can register and the number of elementary operations that it can have performed over its history are calculated. The Universe can have performed ${10}^{120}\phantom{\rule{0ex}{0ex}}\mathrm{ops}$ on ${10}^{90}\phantom{\rule{0ex}{0ex}}\mathrm{bits}$ ( ${10}^{120}\phantom{\rule{0ex}{0ex}}\mathrm{bits}$ including gravitational degrees of freedom).

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.88.237901

Cites

36 of 36 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • We consider Hamiltonians that can be written as a polynomial number of terms, with respect to the system size.

    “We consider Hamiltonians that can be written as a polynomial number of terms, with respect to the system size.”

    From A variational eigenvalue solver on a photonic quantum processor (2014) · cites this paper as [20]

    The Discussion (p. 14) says quantum computers can efficiently simulate systems with local interactions, but it does not specify Hamiltonians expressible as a polynomial number of terms in system size. Searches for polynomially many Hamiltonian terms found no passage addressing that condition. (LLM, conf=0.73)

    Experimental — accuracy not yet measured
  • This class of Hamiltonians encompasses a wide range of physical systems, including the electronic structure Hamiltonian of quantum chemistry, the quantum Ising Model, the Heisenberg Model, matrices that are well approximated as a sum of n-fold tensor products, and more generally any k-sparse Hamiltonian without evident tensor product structure.

    “This class of Hamiltonians encompasses a wide range of physical systems, including the electronic structure Hamiltonian of quantum chemistry, the quantum Ising Model, the Heisenberg Model2021, matrices that are well approximated as a sum of n-fold tensor products2223, and more generally any k-sparse Hamiltonian without evident tensor product structure”

    From A variational eigenvalue solver on a photonic quantum processor (2014) · cites this paper as [20]

    The Discussion (p. 14) says quantum computers can efficiently simulate systems with local interactions, but it does not identify the claimed class of Hamiltonians or its examples. Searches for the Ising and Heisenberg models, electronic-structure Hamiltonians, tensor products, and k-sparse Hamiltonians found no passage addressing that classification. (LLM, conf=0.76)

    Experimental — accuracy not yet measured
  • Uhlmann's theorem states that the square root of the fidelity is given by the maximum over purifications.

    “According to Uhlmann's theorem [18], the square root of the fidelity is given by”

    From Geometric derivation of the quantum speed limit (2010) · cites this paper as [18]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 3

  1. N. Margolus, 1996, PhysComp96, Proceedings of the Fourth Workshop on Physics and Computation,
  2. N. Margolus, 1998, Physica (Amsterdam), 120D, 188
  3. D. G. Cory, PhysComp96, Proceedings of the Fourth Workshop on Physics and Computation

Cited by

Sorted by citations

Authors
Lloyd, S.
Affiliations
Massachusetts Institute of Technology (US)
Corresponding author
Lloyd, Seth
Venue
Physical Review Letters
Published
2002-05-24
Volume
88
Issue
23
Pages
237901-237901
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W1993466133
Cited by
571
References
35
Citations by year
2026: 39 · 2025: 32 · 2024: 39 · 2023: 36 · 2022: 17 · 2021: 27 · 2020: 23 · 2019: 40 · 2018: 27 · 2017: 24 · 2016: 29 · 2015: 27 · 2014: 13 · 2013: 30 · 2012: 16
FWCI
8.07
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Physics and Astronomy › Astronomy and Astrophysics › Cosmology and Gravitation Theories
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
  • Physical Sciences › Physics and Astronomy › Nuclear and High Energy Physics › Black Holes and Theoretical Physics
Keywords
gravitational degrees of freedom

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review