Bremermann's limit
Bremermann's limit, named after Hans-Joachim Bremermann, is a limit on the maximum rate of computation that can be achieved in a self-contained system in the material universe. It is derived from Einstein's mass-energy equivalency and the Heisenberg uncertainty principle, and is c2/h ≈ 1.3563925 × 1050 bits per second per kilogram.[1][2]
This value establishes an asymptotic bound on adversarial resources when designing cryptographic algorithms, as it can be used to determine the minimum size of encryption keys or hash values required to create an algorithm that could never be cracked by a brute-force search. For example, a computer with the mass of the entire Earth operating at Bremermann's limit could perform approximately 1075 mathematical computations per second. If one assumes that a cryptographic key can be tested with only one operation, then a typical 128-bit key could be cracked in under 10−36 seconds. However, a 256-bit key (which is already in use in some systems) would take about two minutes to crack. Using a 512-bit key would increase the cracking time to approaching 1072 years, without increasing the time for encryption by more than a constant factor (depending on the encryption algorithms used).
The limit has been further analysed in later literature as the maximum rate at which a system with energy spread [math]\displaystyle{ \Delta E }[/math] can evolve into an orthogonal and hence distinguishable state to another, [math]\displaystyle{ \Delta t = \frac{ \pi \hbar} {2 \Delta E}. }[/math][3][4] In particular, Margolus and Levitin have shown that a quantum system with average energy E takes at least time [math]\displaystyle{ \Delta t = \frac{ \pi \hbar} {2 E} }[/math] to evolve into an orthogonal state.[5] However, it has been shown that chaining multiple computations or access to quantum memory in principle allow computational algorithms that require arbitrarily small amount of energy/time per one elementary computation step.[6][7]
See also
- Quantum speed limit theorems
- Landauer's principle
- Bekenstein bound
- Kolmogorov complexity
- Transcomputational problem
- Limits of computation
- Ultrafinitism
References
- ↑ Bremermann, H.J. (1962) Optimization through evolution and recombination In: Self-Organizing systems 1962, edited M.C. Yovits et al., Spartan Books, Washington, D.C. pp. 93–106.
- ↑ Bremermann, H.J. (1965) Quantum noise and information. 5th Berkeley Symposium on Mathematical Statistics and Probability; Univ. of California Press, Berkeley, California.
- ↑ Aharonov, Y.; Bohm, D. (1961). "Time in the Quantum Theory and the Uncertainty Relation for Time and Energy". Physical Review 122 (5): 1649–1658. doi:10.1103/PhysRev.122.1649. Bibcode: 1961PhRv..122.1649A. http://dieumsnh.qfb.umich.mx/archivoshistoricosmq/ModernaHist/Aharonov%20a.pdf. Retrieved 2013-05-23.
- ↑ Lloyd, Seth (2000). "Ultimate physical limits to computation". Nature 406 (6799): 1047–1054. doi:10.1038/35023282. PMID 10984064. Bibcode: 2000Natur.406.1047L.
- ↑ Margolus, N.; Levitin, L. B. (September 1998). "The maximum speed of dynamical evolution". Physica D: Nonlinear Phenomena 120 (1–2): 188–195. doi:10.1016/S0167-2789(98)00054-2. Bibcode: 1998PhyD..120..188M.
- ↑ Jordan, Stephen P. (2017). "Fast quantum computation at arbitrarily low energy". Phys. Rev. A 95 (3): 032305. doi:10.1103/PhysRevA.95.032305. Bibcode: 2017PhRvA..95c2305J.
- ↑ Sinitsyn, Nikolai A. (2018). "Is there a quantum limit on speed of computation?". Physics Letters A 382 (7): 477–481. doi:10.1016/j.physleta.2017.12.042. Bibcode: 2018PhLA..382..477S.
External links
- Gorelik, G. (2003). Bremermann's Limit and cGh-physics
- Lokshin, A (2017). Arbitrary choice, ‘understanding’ and Gorelik-Bremermann limit. Far East Journal of Mathematical Sciences, V. 102, Issue 1, P. 215–222
 |  |
