Probing the Planck scale with quantum computation

• URL: http://arxiv.org/abs/2604.06322v1
• Date: Tue, 07 Apr 2026 18:00:35 GMT
• Title: Probing the Planck scale with quantum computation
• Abstract summary: We quantify the relation between the logical qubit count and the extent to which classicality is challenged.<n>We argue that 500 logical qubits are sufficient to reject theories confined to a laboratory.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Quantum-classical crossover in fault-tolerant quantum dynamics simulation [56.198154828333685]
  We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations.<n>A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics.
  arXiv  Detail & Related papers  (2026-07-17T16:54:25Z)
• Testing Quantum Mechanics with Quantum Computers: Qubit Information Capacity [0.0]
  Motivated by Wheeler's assertion that Hilbert Space conceals the information-theoretic nature of the quantum wavefunction, a specific discretisation of complex Hilbert Space is proposed.<n>For any $N ge N_mathrmmax$-qubit state, there is insufficient information in the $N$ qubits to allocate even one bit to each of the $2N+1-2$ degrees of freedom demanded by complex Hilbert Space.
  arXiv  Detail & Related papers  (2025-09-19T07:12:31Z)
• High-precision Quantum Phase Estimation on a Trapped-ion Quantum Computer [0.0]
  We propose a benchmarking approach involving the use of multi-ancilla quantum phase estimation.<n>We generate circuits that scale quadratically in gate count with the number of qubits in the readout register.<n>This enables the execution of quantum chemistry circuits that act on many qubits, while producing meaningful results with limited shot counts.
  arXiv  Detail & Related papers  (2025-06-20T17:55:14Z)
• Robust Fitting on a Gate Quantum Computer [22.0076458961442]
  We propose a quantum circuit to solve the $ell_infty$ feasibility test in the 1D case, which allows to demonstrate for the first time quantum robust fitting on a real gate quantum computer. We also show how 1D Boolean influences can be accumulated to compute influences for higher-dimensional non-linear models.
  arXiv  Detail & Related papers  (2024-09-03T15:54:20Z)
• Solving an Industrially Relevant Quantum Chemistry Problem on Quantum Hardware [31.15746974078601]
  We calculate the lowest energy eigenvalue of active space Hamiltonians of industrially relevant and strongly correlated metal chelates on trapped ion quantum hardware. We are able to achieve chemical accuracy by training a variational quantum algorithm on quantum hardware, followed by a classical diagonalization in the subspace of states measured as outputs of the quantum circuit.
  arXiv  Detail & Related papers  (2024-08-20T12:50:15Z)
• Rapidly Achieving Chemical Accuracy with Quantum Computing Enforced Language Model [22.163742052849432]
  QiankunNet-VQE is a transformer based language models enforced with quantum computing to learn and generate quantum states. It has been implemented using up to 12 qubits and attaining an accuracy level competitive with state-of-the-art classical methods.
  arXiv  Detail & Related papers  (2024-05-15T07:50:57Z)
• Fundamental causal bounds of quantum random access memories [13.19534468575575]
  We study the intrinsic bounds of rapid quantum memories based on causality. We show that QRAM can accommodate up to $mathcalO(107)$ logical qubits in 1 dimension, $mathcalO(1015)$ to $mathcalO(1020)$ in various 2D architectures, and $mathcalO(1024)$ in 3 dimensions.
  arXiv  Detail & Related papers  (2023-07-25T12:40:48Z)
• A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
  Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
  arXiv  Detail & Related papers  (2023-05-23T13:42:36Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Ruling out real-valued standard formalism of quantum theory [19.015836913247288]
  A quantum game has been developed to distinguish standard quantum theory from its real-number analog. We experimentally implement the quantum game based on entanglement swapping with a state-of-the-art fidelity of 0.952(1). Our results disprove the real-number formulation and establish the indispensable role of complex numbers in the standard quantum theory.
  arXiv  Detail & Related papers  (2021-03-15T03:56:13Z)
• Demonstrating the power of quantum computers, certification of highly entangled measurements and scalable quantum nonlocality [0.0]
  We demonstrate the power of state-of-the-art IBM quantum computers in correlation experiments inspired by quantum networks. Our experiments feature up to 12 qubits and require the implementation of paradigmatic Bell-State Measurements.
  arXiv  Detail & Related papers  (2020-09-29T13:59:49Z)
• Quantum advantage for computations with limited space [6.327095331866255]
  We consider space-restricted computations, where input is a read-only memory and only one (qu)bit can be computed on. We experimentally demonstrate computations of $3$-, $4$-, $5$-, and $6$- by quantum circuits, leveraging custom two-qubit gates.
  arXiv  Detail & Related papers  (2020-08-14T17:31:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.