GNSS-free quantum gravity-aided navigation and fine-scale marine surveying with a strapdown quantum gravimeter

Patrick J. Everitt; Donald H. White; Todd Lyon; Murat Muradoglu; Alessandro D'Ortenzio; Aaron J. Canciani; Malo Cadoret; Daniel D. Brown; David Adams; Yosri Ben-Aïcha; Suraj Bijjahalli; Mojtaba K. Farsani; Alexander Rischka; Karandeep S. Gill; Magdalena Meyer; Henry W. Orton; Nicholas P. Robins; Reuben Symon; Michael J. Biercuk; Michael R. Hush; Stuart S. Szigeti; Russell P. Anderson

arXiv · 2608.25563

GNSS-free quantum gravity-aided navigation and fine-scale marine surveying with a strapdown quantum gravimeter

View original source ↗Read source document ↗Export metadata ↓

Abstract

Global navigation satellite systems (GNSS) are often disrupted or unavailable at sea, and unaided inertial navigation systems (INS) drift without correction. Quantum-sensing-based gravity map matching offers a passive, infrastructure-free aid, but field demonstrations of GNSS-free quantum gravimetric navigation have not been reported. Here we perform gravity map matching and fine-resolution gravity survey with a mobile quantum gravimeter aboard a 29 m surface vessel. We hybridize an atomic sensor with a classical accelerometer for bias stabilization and independently mechanize a navigation-grade IMU, all installed in an uncontrolled cabin with no environmental stabilization or calibration. Operated in both gimbaled and strapdown configurations over identical traversals, the hybrid sensor corrected the inertial solution over an 83 km maritime trajectory by referencing locally measured gravity to a satellite-derived anomaly map. Gravity-aiding constrains INS drift and delivers bounded positioning at nautical-mile-level accuracy, with GNSS excluded throughout the measurement chain. In a separate GNSS-referenced mode, the same system surveyed coastal routes up to Sea State 4, achieving mGal-level agreement with gravimetric maps and sub-mGal repeatability and stability, with gimbaled and strapdown operation performing comparably. Resolved anomalies reach an along-track scale of ~300 m, 50X finer than the satellite map's half-power wavelength. A 56 h stationary test shows atom referencing lowers long-term drift ~70X versus the classical channel alone. These results provide the first same-instrument comparison of gimbaled and strapdown mobile quantum gravimetry and the first fully GNSS-independent gravity-map-matching navigation demonstration using a quantum gravimeter, pointing toward compact, autonomous-platform-ready quantum sensing for GNSS-denied maritime navigation and survey.

Explore related subjects

quant-ph

Keep this discovery

BibTeX RIS

Patrick J. Everitt, Donald H. White, Todd Lyon, Murat Muradoglu, Alessandro D'Ortenzio, Aaron J. Canciani, Malo Cadoret, Daniel D. Brown, David Adams, Yosri Ben-Aïcha, Suraj Bijjahalli, Mojtaba K. Farsani, Alexander Rischka, Karandeep S. Gill, Magdalena Meyer, Henry W. Orton, Nicholas P. Robins, Reuben Symon, Michael J. Biercuk, Michael R. Hush, Stuart S. Szigeti, Russell P. Anderson. 2026-08-26. GNSS-free quantum gravity-aided navigation and fine-scale marine surveying with a strapdown quantum gravimeter. https://arxiv.org/abs/2608.25563

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗