Search arXivSearch

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

Explore connections, maps & timelines

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

Fermionic magic resources in disordered quantum spin chains

Fermionic non-Gaussianity quantifies a quantum state's deviation from a classically tractable free-fermionic description, constituting a necessary resource for computational quantum advantage. Here we use fermionic antiflatness (FAF) to measure this deviation across ergodic and many-body localized (MBL) regimes. We focus on the paradigmatic disordered spin-$1\!/2$ XXZ chain and its impurity variant with local interactions. Across highly excited eigenstates, FAF evolves from typical-state behavior at weak disorder to strongly suppressed values deep in the MBL regime, with volume-law scaling in the XXZ chain and an area-law bound in the impurity setting. Rare long-range cat-like eigenstates exhibit a pronounced enhancement of FAF, making it a sensitive diagnostic of mechanisms proposed to destabilize MBL. Starting from product states, we find that in the MBL regime FAF grows slowly in time, approaching saturation via a power-law relaxation. Overall, our results show that MBL suppresses fermionic non-Gaussianity, and the associated complexity beyond free fermions, while ergodicity restores it, motivating explorations of fermionic non-Gaussianity in other ergodicity-breaking phenomena.

quant-ph

Progressive Binarization - Pauli Correlation Encoding: a Continuation Method for Constrained Optimization

Pauli Correlation Encoding (PCE) reduces the qubit requirements of quantum optimization by embedding the problem variables into the expectation values of Pauli observables, so that the number of qubits can be much smaller than the number of variables. PCE has not yet been studied for constrained optimization. We extend it to constrained combinatorial problems, using the budget-constrained MinCut as a case study, and show that the standard formulation fails to reliably enforce the constraint: feasibility hinges on the binarization of the encoded variables, which depends sensitively on hyperparameters that are hard to tune and do not transfer across instances. To address this, we introduce Progressive-Binarization PCE (PB-PCE), an adaptive continuation scheme that progressively increases the binarization parameter while re-optimizing the circuit from the previous solution, driving the variables towards the binary domain. PB-PCE attains near-complete constraint satisfaction (88--100\%) and smaller cut sizes than standard PCE, with a number of stages (10--20) essentially independent of problem size, solving instances of up to 300 variables with only 9-qubit circuits.

quant-ph

A quantum model for synchronizing finite state transition systems

We propose a quantum model for finding a resetting input sequence (RS) which can take a finite state transition system (FA), to particular state independent of its current state. The complexity of finding such sequences for various types of FA can be NP-Hard or even PSPACE-Complete. To this end, we represent the FA states, inputs, and transition function in quantum space. Accordingly, we propose a model to represent the execution of an input sequence of a particular length $l$ starting form an initial FA state. The model is extended considering the application in superposition of all input sequences of length $l$ to an initial state of the FA. The model is further extended considering the application of all input sequences to all initial states of the FA capturing for every input sequence the collection (ordered list) of states reached by applying the sequence to all states of the FA. The amplitude amplification algorithm is then used as it combines similar collections of reached states while preserving all input sequences that reach these collections. A Grover search for a reached collection where its elements correspond to the same FA state provides a RS for the FA. Our approach offers a quadratic gain over the exponential complexity of traditional brute-force method, which is the only method that can be applied to a general FA class.

quant-ph