2006/07/31 by Stephen D. H. Hsu
Computer Science · Mathematics · Physics and Astronomy · #Computer science #Cosmology and Gravitation Theories #Cube root #Entropy (arrow of time) #Geometry #Mathematical analysis #Mathematics #Physics #Planck time #Quantum #Quantum Computing Algorithms and Architecture #Quantum Mechanics and Applications #Quantum gravity #Quantum mechanics #Theoretical physics #Theory of relativity #Upper and lower bounds #gr-qc #hep-ph #hep-th #quant-ph
paper · pdf · doi:10.1016/j.physletb.2006.08.018
published as Phys.Lett. B641 (2006) 99-100 · 2 pages, revtex, version to appear in Physics Letters B (reference added)
arxiv created 2006/08/04 · openalex publication_date 2006/08/25 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We derive a fundamental upper bound on the rate at which a device can process information (i.e., the number of logical operations per unit time), arising from quantum mechanics and general relativity. In Planck units a device of volume V can execute no more than the cube root of V operations per unit time. We compare this to the rate of information processing performed by nature in the evolution of physical systems, and find a connection to black hole entropy and the holographic principle.