SearcharxivSearch

arXiv · 2509.01586

A Spin-Based Pathway to Testing the Quantum Nature of Gravity

Abstract

A key open problem in physics is the correct way to combine gravity (described by general relativity) with everything else (described by quantum mechanics). This problem suggests that general relativity and possibly also quantum mechanics need fundamental corrections. Most physicists expect that gravity should be quantum in character, but gravity is fundamentally different to the other forces because it alone is described by spacetime geometry. Experiments are needed to test whether gravity, and hence space-time, is quantum or classical. We propose an experiment to test the quantum nature of gravity by checking whether gravity can entangle two micron-sized crystals. A pathway to this is to create macroscopic quantum superpositions of each crystal first using embedded spins and Stern-Gerlach forces. These crystals could be nanodiamonds containing nitrogen-vacancy (NV) centres. The spins can subsequently be measured to witness the gravitationally generated entanglement. This is based on extensive theoretical feasibility studies and experimental progress in quantum technology. The eventual experiment will require a medium-sized consortium with excellent suppression of decoherence including vibrations and gravitational noise. In this white paper, we review the progress and plans towards realizing this. While implementing these plans, we will further explore the most macroscopic superpositions that are possible, which will test theories that predict a limit to this.

Explore related subjects

Keep this discovery

BibTeXRIS

Sougato Bose, Anupam Mazumdar, Roger Penrose, Ivette Fuentes, Marko Toroš, Ron Folman, Gerard J. Milburn, Myungshik Kim, Adrian Kent, A. T. M. Anishur Rahman, Cyril Laplane, Aaron Markowitz, Debarshi Das, Ethan Campos-Méndez, Eva Kilian, David Groswasser, Menachem Givon, Or Dobkowski, Peter Skakunenko, Maria Muretova, Yonathan Japha, Naor Levi, Omer Feldman, Damián Pitalúa-García, Jonathan M. H. Gosling, Ka-Di Zhu, Marco Genovese, Kia Romero-Hojjati, Ryan J. Marshman, Markus Rademacher, Martine Schut, Melanie Bautista-Cruz, Qian Xiang, Stuart M. Graham, James E. March, William J. Fairbairn, Karishma S. Gokani, Joseph Aziz, Richard Howl, Run Zhou, Ryan Rizaldy, Thiago Guerreiro, Tian Zhou, Jason Twamley, Chiara Marletto, Vlatko Vedral, Jonathan Oppenheim, Mauro Paternostro, Hendrik Ulbricht, Peter F. Barker, Thomas P. Purdy, M. V. Gurudev Dutt, Andrew A. Geraci, David C. Moore, Gavin W. Morley. 2025-09-01. A Spin-Based Pathway to Testing the Quantum Nature of Gravity. https://arxiv.org/abs/2509.01586

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph