Probing the Planck scale with quantum computation

This paper argues that commercial quantum computers projected to exceed 1600 logical qubits will operate beyond classical Planck-scale limits, providing a feasible experimental test to resolve the incompatibility between general relativity and quantum mechanics.

The Gist

The Big Problem: Two Rules That Don't Mix

Imagine the universe is a giant video game.

• The Macro Game (General Relativity): This is the rulebook for big things like stars, planets, and galaxies. It says space is smooth and continuous, like a calm ocean.
• The Micro Game (Quantum Mechanics): This is the rulebook for tiny things like atoms and electrons. It says the world is pixelated, jittery, and full of weird probabilities, like a chaotic static screen.

For a long time, physicists have been trying to merge these two rulebooks into one "Super Rulebook." But they clash violently at the smallest possible size in the universe, called the Planck Scale. This is so small (a billionth of a trillionth of a proton) that we can't build a particle accelerator big enough to see it. It's like trying to see a single grain of sand on a beach using a telescope meant for the moon.

The New Idea: The Ultimate Computer as a Microscope

The authors, Boaz Katz and Shlomi Kotler, propose a crazy new idea: We don't need a bigger telescope; we need a faster computer.

Think of a computer processor as a grid of tiny workers.

• Classical Computers (Your Laptop): These workers are spaced out by about 50 nanometers. They work at a certain speed. If you try to pack them tighter or make them faster, you eventually hit a wall because of the laws of physics (heat, atomic size, etc.).
• Quantum Computers: These are different. They don't just do one thing at a time; they can do a massive number of things simultaneously.

The paper argues that if we build a quantum computer with enough power, it will be forced to operate at a speed so fast that it effectively "squeezes" the universe. If the universe is actually made of tiny, smooth, classical blocks (like a grid of pixels), this super-fast computer will try to run faster than those blocks can handle.

The Analogy: The Traffic Jam at the Speed of Light

Imagine the universe is a highway.

• The Speed Limit: Nothing can go faster than the speed of light ($c$).
• The Planck Scale: This is the smallest possible "car" and the smallest possible "road segment."

If you try to drive a car that is smaller than the road segment, or faster than the time it takes to switch lanes, you break the rules of the road.

The authors calculate that if a quantum computer performs enough calculations, it reaches a Computational Rate Density (CRD). This is a fancy way of saying: "How many math problems can we solve in a tiny box of space in a tiny slice of time?"

If a quantum computer solves enough problems, it hits a "density" where it is trying to do more math than the universe's "pixels" can possibly handle.

• If the universe is classical (smooth/pixelated): The computer should crash, fail, or behave strangely because it's asking the universe to do the impossible.
• If the universe is truly quantum: The computer will keep working perfectly, proving that the universe can handle this extreme density.

The Magic Numbers: How Many Qubits Do We Need?

The paper does the math to see how powerful the computer needs to be to break the "Planck barrier." They look at different scenarios, like how much the computer can "talk" to itself.

1. The "Lab" Scenario (500 Qubits):
   Imagine a quantum computer the size of a large room, running for a year. If it has about 500 logical qubits (the quantum equivalent of bits), it will be powerful enough to prove that the universe cannot be a simple, smooth, classical grid confined to that lab. It would rule out theories that say "reality is just a simple simulation running in a box."

2. The "Universe" Scenario (1,600 Qubits):
   Now, imagine the computer is connected to everything in the universe since the Big Bang. Every calculation it makes uses data from every other calculation that ever happened in the past. Even with this massive, fully connected network, the limit is reached at about 1,600 qubits.

The "RSA-2048" Connection: Why This Matters Now

You might be thinking, "1,600 qubits sounds like a lot. Do we have that?"
The answer is: We are getting there very fast.

Currently, companies are building quantum computers specifically to break RSA-2048 encryption. This is the digital lock that protects your bank accounts and government secrets. To crack this code, we need a quantum computer with roughly 2,000 to 4,000 qubits.

The Punchline:
The quantum computers we are building right now to hack our banks are actually powerful enough to test the fundamental nature of reality.

• If we build a 2,000-qubit computer and it successfully cracks the code, it proves that Quantum Mechanics is real even at the Planck scale. It means the universe is not a simple, classical grid.
• If we keep trying to build these computers and they consistently fail for no technical reason (not because of bad engineering, but because the math just won't work), it might be the first sign that Quantum Mechanics has a limit and breaks down at that scale.

Summary

This paper is a "check-engine light" for the universe.

It suggests that the race to build a super-quantum computer to break encryption is accidentally becoming the most important physics experiment in history. By pushing the "speed" of our computers to the absolute limit, we are effectively probing the deepest, smallest secrets of nature.

• If the computer works: Quantum mechanics wins, and gravity's current theories need an update.
• If the computer mysteriously fails: We might have found the edge of the universe's rulebook.

We are on the verge of finding out if the universe is a smooth ocean or a pixelated screen, and the key to unlocking that mystery is a machine we are building to steal credit card numbers.

Technical Summary

1. Problem Statement

The fundamental incompatibility between General Relativity (governing macroscopic scales) and Quantum Mechanics (governing microscopic scales) remains unresolved, particularly at the Planck scale ($l_P \approx 1.6 \times 10^{-35}$ m, $t_P \approx 5.4 \times 10^{-44}$ s, $E_P \approx 1.2 \times 10^{28}$ eV).

• The Challenge: Direct experimental probing of this scale is currently impossible. The energy required exceeds the capabilities of the most powerful particle accelerators (like the LHC) by 15 orders of magnitude.
• The Hypothesis: Some theories propose that spacetime or physical laws are discrete or "classical" at the Planck scale (e.g., cellular automata interpretations). If such a classical substrate exists, it imposes a fundamental limit on the Computational Rate Density (CRD)—the number of operations per unit volume per unit time—that any physical system can perform.
• The Question: Can quantum computers, by achieving CRDs that exceed the theoretical limits of a classical Planck-scale substrate, empirically falsify these classical theories?

2. Methodology

The authors develop a theoretical framework to quantify the relationship between the number of logical qubits in a quantum computer and the physical length scale it can probe.

A. Defining Computational Rate Density (CRD)

The paper defines CRD ($C$) as the number of operations ($N_{ops}$) per unit volume ($V^3$) per unit time ($T$):
$$C = \frac{N_{ops}}{V^3 T} = \frac{1}{l^3 \tau}$$
Where $l$ is the distance between computing elements and $\tau$ is the time step.

• Classical Limit: Information cannot propagate faster than light ($c$), implying $\tau \geq l/c$. This leads to an upper bound on the length scale $l$ probed by a computer:
  $$l \leq \left( \frac{V^3 c T}{N_{ops}} \right)^{1/4}$$

B. Quantum Advantage Scaling

A quantum computer with $n$ logical qubits is expected to perform $N_{ops} \geq 2^n$ equivalent classical operations. By substituting this exponential growth into the CRD equations, the authors calculate the effective length scale $l$ probed as a function of $n$.

C. Modeling Connectivity and Causality

To ensure robustness, the authors model increasingly inclusive scenarios for how computational resources are aggregated:

1. Laboratory Scale: A fixed volume and time (e.g., $1000 \text{ m}^3$ for 1 year).
2. Causal History (Universe Scale): The authors account for the fact that a calculation today can utilize information from any event in its past light cone since the Big Bang.
   • They integrate the spacetime volume of the observable universe using a flat $\Lambda$-CDM cosmological model.
   • They consider two connectivity models:
     • Nearest-Neighbor: Limited communication (negligible impact on the threshold).
     • Fully Connected: Every computational event integrates inputs from all events in its past light cone (maximizing $N_{ops}$).

3. Key Contributions

• Quantitative Thresholds: The paper provides specific numerical thresholds for the number of logical qubits required to challenge classical theories at the Planck scale under different physical assumptions.
• Integration of Cosmology: It uniquely combines quantum information theory with cosmological expansion history to define the "ultimate" computational capacity of the universe.
• Reframing the Test: Instead of looking for energy signatures, the paper proposes Computational Rate Density as a new experimental axis to test the fundamental nature of spacetime.

4. Results

The authors derive the number of logical qubits ($n$) required to reach the Planck CRD limit under various constraints:

Scenario	Description	Logical Qubits ($n$) Required
Standard Lab	Fixed volume ($1000 \text{ m}^3$) and time (1 year).	~525
Lab with Connectivity	Lab operations include inputs from all past events within the lab's light cone.	~1050
Fully Connected Universe	Theoretical maximum: A computer utilizing all causal history of the observable universe since the Big Bang, with full connectivity.	~1609

• Planck CRD Value: The threshold is defined as $C_P \approx 1.37 \times 10^{2490} \text{ ops m}^{-3} \text{s}^{-1}$.
• RSA-2048 Connection: Current industrial roadmaps for breaking RSA-2048 encryption using Shor's algorithm require between 1,000 and 2,000 logical qubits.
• Conclusion: A quantum computer capable of breaking RSA-2048 would inherently possess a CRD exceeding the Planck limit, even if the entire observable universe were utilized as a classical computer.

5. Significance and Implications

• Near-Term Experimental Test: The paper argues that the race to build fault-tolerant quantum computers for cryptography is inadvertently a race to probe the Planck scale. If a quantum computer successfully factors a 2048-bit number, it will have demonstrated a computational density that no classical theory confined to the Planck scale can explain.
• Falsifiability of Classical Substrates: A successful execution of such a computation would effectively rule out theories suggesting the universe operates on a discrete, classical grid at the Planck scale (e.g., 't Hooft's cellular automaton).
• Limits of Quantum Mechanics: Conversely, if quantum computers consistently fail to reach these scales despite no apparent technical errors, it could indicate a fundamental breakdown of quantum mechanics at high computational densities, suggesting a new physical limit.
• New Physics Paradigm: This work shifts the search for quantum gravity effects from high-energy particle collisions (which are currently infeasible) to high-density computation, offering a viable path to test the intersection of quantum mechanics and gravity within the next decade.

In summary, the paper posits that quantum computation is not just a technological tool, but a fundamental probe of spacetime structure. The successful implementation of large-scale quantum algorithms (specifically Shor's algorithm) will serve as a definitive experiment to determine whether the universe is fundamentally quantum or classical at the Planck scale.