Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0507262

Fundamental gravitational limitations to quantum computing

Rodolfo Gambini, Rafael A. Porto, Jorge A. Pullin

Published Jul 27, 2005• 14 citations
arXivHTMLPDF

Abstract

Lloyd has considered the ultimate limitations physics places on quantum computers. He concludes in particular that for an ``ultimate laptop'' (a computer of one liter of volume and one kilogram of mass) the maximum number of operations per second is bounded by $10^{51}$. The limit is derived considering ordinary quantum mechanics. Here we consider additional limits that are placed by quantum gravity ideas, namely the use of a relational notion of time and fundamental gravitational limits that exist on time measurements. We then particularize for the case of an ultimate laptop and show that the maximum number of operations is further constrained to $10^{47}$ per second.

DOI
10.48550/arxiv.quant-ph/0507262

Related papers

Probing the Planck scale with quantum computation

Boaz Katz, Shlomi Kotler

General relativity and quantum mechanics are incompatible at the Planck scale. This contention can be examined if a quantum computer is set to operate at a rate that exceeds the classical limit of one operation per Planck volume-time, or equivalently $2^{491}$ m$^{-3}$ s$^{-1}$. Here we quantify the relation between the logical qubit count and the extent to which classicality is challenged. We argue that 500 logical qubits are sufficient to reject theories confined to a laboratory. We account for the operational cost of computation and communication at all scales up to and including the observable universe, ultimately constrained by a 1600-logical-qubit computer. Remarkably, current plans for commercial quantum computers are projected to surpass this limit, thereby putting the quantum-gravity standoff to the test.

quant-pharXiv:2604.06322•Apr 9, 2026•0 citations

Quantum limits to mass sensing in a gravitational field

Luigi Seveso, Valerio Peri, Matteo G A Paris

Abstract We address the problem of estimating the mass of a quantum particle in a gravitational field and seek the ultimate bounds to precision of quantum-limited detection schemes. In particular, we study the effect of the field on the achievable sensitivity and address the question of whether quantumness of the probe state may provide a precision enhancement. The ultimate bounds to precision are quantified in terms of the corresponding quantum Fisher information. Our results show that states with no classical limit perform better than semiclassical ones and that a non-trivial interplay exists between the external field and the statistical model. More intense fields generally lead to a better precision, with the exception of position measurements in the case of freely-falling systems.

arXiv:1603.09559•Journal of Physics A Mathematical and Theoretical•Apr 12, 2017•16 citations

Observer Systems and the Density Ceiling: A Computed Bound on Coherent Laboratory Mass

William Alexander Aldred

This paper computes the largest laboratory mass that can remain coherent for one second under gravitational decoherence estimates, as a concrete form of the observer problem in measurement theory. The mass at which the Diósi–Penrose time falls to one second, for ordinary condensed-matter density, is 1.000e-12 kilograms. A mass of 1e-12 kilograms already decoheres in 9.802e-06 seconds and a mass of 1e-09 kilograms in 9.802e-11 seconds in this estimate. The density ceiling itself is never approached at laboratory densities; the operative limitation on coherent observers and memories is gravitational decoherence scaling, not the ceiling. Wigner-friend scenarios with macroscopic coherent laboratories therefore face a quantified timescale obstacle in this model. The study is simulated and computed from stated assumptions; it is not a measurement.

•Nov 11, 2026•0 citations

Diósi–Penrose Gravitational Decoherence Times Across Mass Scales with a Density Ceiling

William Alexander Aldred

This paper evaluates Diósi–Penrose gravitational decoherence times from the electron to macroscopic masses and asks whether a maximum density alters the picture. The computed time is 5.665e+19 seconds for a proton displaced by its own scale, 1.097e+15 seconds for a fullerene molecule, and 1.580e+00 seconds for a dust grain of 1e-15 kilograms. The density ceiling of 9.717e+57 kilograms per cubic metre lies far above the densities of all systems tabulated, so it leaves the standard gravitational decoherence estimates unchanged. The strong mass dependence, not the ceiling, is what separates microscopic superpositions, which persist, from macroscopic ones, which localise promptly in this model. The study is simulated and computed from stated assumptions; it is not a measurement.

•Nov 11, 2026•0 citations

THE FUNDAMENTAL LIMIT OF QUANTUM COMPUTING

Materov

Since Turing, it's been generally accepted that computing systems have two types of limitations: algorithmic (some problems are fundamentally unsolvable) and engineering (the hardware is imperfect, noisy, and breaks). Quantum computing has added a third type— complexity : some problems are solvable, but require resources that grow faster than any polynomial. This supplement introduces a fourth type of restriction, previously not described in the literature: The fundamental limit of quantum computing (FQC) is a limit on the precision of any quantum computing device, which arises not from imperfections in the implementation, but from the discrete structure of spacetime at the Planck scale. This limit cannot be overcome by any technological advancement. It is not a consequence of decoherence , thermal noise, or imperfect gates. It is built into the geometry of reality—just as the speed of light is built into the structure of spacetime and cannot be overcome by any acceleration.Unlike collapse-model-based limits on quantum hardware, the Fundamental Limit of Quantum Computation is proposed as an ontological bound arising from the discrete structure of spacetime itself.

•Jun 17, 2026•0 citations

The physical limits of computing

Michael P. Frank

Many of the fundamental limits on information processing, from thermodynamics, relativity, and quantum mechanics, are only a few decades away. Novel physically motivated computing paradigms, such as reversible computing and quantum computing, may help in certain ways, but even they remain subject to some basic limits. One can arrive at several firm conclusions regarding upper bounds on the limits of computing. In this article, the author only reviews the fundamental technology-independent limits.

Computing in Science & Engineering•May 1, 2002•87 citations
Lloyd has considered the ultimate limitations physics places on quantum computers. He concludes in particular that for an ``ultimate laptop'' (a computer of one liter of volume and one kilogram of mass) the maximum number of operations per second is bounded by 105110^{51}1051. The limit is derived considering ordinary quantum mechanics. Here we consider additional limits that are placed by quantum gravity ideas, namely the use of a relational notion of time and fundamental gravitational limits that exist on time measurements. We then particularize for the case of an ultimate laptop and show that the maximum number of operations is further constrained to 104710^{47}1047 per second.
General relativity and quantum mechanics are incompatible at the Planck scale. This contention can be examined if a quantum computer is set to operate at a rate that exceeds the classical limit of one operation per Planck volume-time, or equivalently 24912^{491}2491 m−3^{-3}−3 s−1^{-1}−1. Here we quantify the relation between the logical qubit count and the extent to which classicality is challenged. We argue that 500 logical qubits are sufficient to reject theories confined to a laboratory. We account for the operational cost of computation and communication at all scales up to and including the observable universe, ultimately constrained by a 1600-logical-qubit computer. Remarkably, current plans for commercial quantum computers are projected to surpass this limit, thereby putting the quantum-gravity standoff to the test.
Abstract We address the problem of estimating the mass of a quantum particle in a gravitational field and seek the ultimate bounds to precision of quantum-limited detection schemes. In particular, we study the effect of the field on the achievable sensitivity and address the question of whether quantumness of the probe state may provide a precision enhancement. The ultimate bounds to precision are quantified in terms of the corresponding quantum Fisher information. Our results show that states with no classical limit perform better than semiclassical ones and that a non-trivial interplay exists between the external field and the statistical model. More intense fields generally lead to a better precision, with the exception of position measurements in the case of freely-falling systems.
This paper computes the largest laboratory mass that can remain coherent for one second under gravitational decoherence estimates, as a concrete form of the observer problem in measurement theory. The mass at which the Diósi–Penrose time falls to one second, for ordinary condensed-matter density, is 1.000e-12 kilograms. A mass of 1e-12 kilograms already decoheres in 9.802e-06 seconds and a mass of 1e-09 kilograms in 9.802e-11 seconds in this estimate. The density ceiling itself is never approached at laboratory densities; the operative limitation on coherent observers and memories is gravitational decoherence scaling, not the ceiling. Wigner-friend scenarios with macroscopic coherent laboratories therefore face a quantified timescale obstacle in this model. The study is simulated and computed from stated assumptions; it is not a measurement.
This paper evaluates Diósi–Penrose gravitational decoherence times from the electron to macroscopic masses and asks whether a maximum density alters the picture. The computed time is 5.665e+19 seconds for a proton displaced by its own scale, 1.097e+15 seconds for a fullerene molecule, and 1.580e+00 seconds for a dust grain of 1e-15 kilograms. The density ceiling of 9.717e+57 kilograms per cubic metre lies far above the densities of all systems tabulated, so it leaves the standard gravitational decoherence estimates unchanged. The strong mass dependence, not the ceiling, is what separates microscopic superpositions, which persist, from macroscopic ones, which localise promptly in this model. The study is simulated and computed from stated assumptions; it is not a measurement.
Since Turing, it's been generally accepted that computing systems have two types of limitations: algorithmic (some problems are fundamentally unsolvable) and engineering (the hardware is imperfect, noisy, and breaks). Quantum computing has added a third type— complexity : some problems are solvable, but require resources that grow faster than any polynomial. This supplement introduces a fourth type of restriction, previously not described in the literature: The fundamental limit of quantum computing (FQC) is a limit on the precision of any quantum computing device, which arises not from imperfections in the implementation, but from the discrete structure of spacetime at the Planck scale. This limit cannot be overcome by any technological advancement. It is not a consequence of decoherence , thermal noise, or imperfect gates. It is built into the geometry of reality—just as the speed of light is built into the structure of spacetime and cannot be overcome by any acceleration.Unlike collapse-model-based limits on quantum hardware, the Fundamental Limit of Quantum Computation is proposed as an ontological bound arising from the discrete structure of spacetime itself.
Many of the fundamental limits on information processing, from thermodynamics, relativity, and quantum mechanics, are only a few decades away. Novel physically motivated computing paradigms, such as reversible computing and quantum computing, may help in certain ways, but even they remain subject to some basic limits. One can arrive at several firm conclusions regarding upper bounds on the limits of computing. In this article, the author only reviews the fundamental technology-independent limits.