Search arXivSearch

arXiv · 2608.28519

Beyond sensitivity: mechanism-resolved error budgets for designing quantum sensors

Abstract

Quantum sensors are specified by a headline sensitivity, yet applications also demand accuracy and reliability. The dominant limiter of one metric is often known, but no method resolves how interacting mechanisms combine into a signed, per-mechanism budget for each metric. We introduce a framework that computes a sensor's sensitivity, accuracy, and robustness from one open-system simulation and attributes each to its limiting mechanism. For a nitrogen-vacancy diamond ensemble the attribution inverts across metrics: dephasing limits sensitivity, the thermal ground-state shift limits accuracy, and optical leakage limits robustness. At identical sensitivity the recovered-field bias spans $8$ to $1500$\,nT, so tuning to sensitivity alone can miss the accuracy target by two orders of magnitude. The same modeling transfers to a cesium optically pumped magnetometer recording a human magnetocardiogram. As a digital twin, it predicts the gain from addressing each limiter, so sensors can be designed to the required metrics.

Explore related subjects

Keep this discovery

BibTeXRIS

Nima Leclerc, Marco Capelli, Kevin James Rietwyk, Mark Dong, Dmitry Lyakh, Geoffrey Iwata, Brandon Rodenburg, Sean Oliver, Benedikt Kloss, Jin-Sung Kim, Stefan Bogdanovic, Yunheng Chen, Meysam Sharifzadeh Mirshekarloo, Cedric Weber, Marcus Doherty, Ethan Pratt, Joseph Hagmann. 2026-08-28. Beyond sensitivity: mechanism-resolved error budgets for designing quantum sensors. https://arxiv.org/abs/2608.28519

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

Horizon-Dependent Tube MPC for Elliptical-Orbit Rendezvous Under Mass Uncertainty

A spacecraft closing on a target from three hundred kilometres to contact flies one guidance law across five orders of magnitude of range, and a controller that is provably safe at close range can lose that guarantee completely at long range while continuing to fly as though nothing were wrong. This paper derives the range at which the guarantee lapses and uses it as a design rule. The bound compares the prediction model's own linearisation error against the disturbance set the controller was built to reject, and needs only the sampling period, the orbit and that disturbance bound, so it can be evaluated before any simulation. On a Mars Sample Return approach it disqualifies the homing phase, where most of the propellant is spent, and clears the other two. Re-posing the disqualified phase in relative orbital elements restores the guarantee; re-posing a phase the rule already clears, in a frame two orders of magnitude more accurate, changes propellant by under a tenth of one per cent, and it is that second prediction that makes the rule falsifiable rather than descriptive. The constraint tightening also ties the prediction horizon to feasibility, so the horizon search limit becomes a mission parameter rather than a solver setting. Against a reimplementation of a published benchmark that reproduces its propellant to within one per cent, over five hundred dispersed Monte Carlo transfers per case on matched seeds, the controller saves 29% of the propellant on a circular target orbit and 40% on an eccentric one, docking inside the 0.20 m capture requirement on essentially every draw at a median miss near 5 cm. Two results run the other way: the saving is bought with time of flight and computation, and it comes from what the guarantee demanded of the terminal condition rather than from better disturbance rejection. Recursive feasibility and asymptotic stability are not claimed.

eess.SY

A Reproducible Method for Mapping Electricity Transmission Infrastructure for Space Weather Risk Assessment

Space weather risk assessment is constrained by the lack of available asset information needed to model geomagnetically induced currents (GICs) in electricity transmission infrastructure. We propose a systematic method that enables risk analysts to collect their own open-source substation data. Using a web browser platform for annotation, we convert OpenStreetMap (OSM) substation locations into high-resolution, component-level mappings of electricity transmission assets. We convert an initial 1,313 high-voltage (>=230 kV) substations to 52,273 components using low-altitude, satellite, and Street View imagery accessed through Google Earth, identifying 7,949 transformers. Compared to the OSM baseline, this approach provides detailed insights on voltage levels and substation configurations. We then construct a geospatial GIC network for the Tennessee Valley Authority (TVA) region, comparing May 2024 results with the University of Illinois Urbana-Champaign 150-bus (UIUC150) synthetic network and with measured ground GICs at 13 monitoring devices. The transformer types at unannotated substations and the grounding resistances are unknown, so we sample both across a Monte Carlo ensemble. This gives a median TVA 95th-percentile peak ground GIC of 29.1 A, with a 90 percent confidence interval of 23.9-36.1 A. The UIUC150 network yields a 95th-percentile peak ground GIC of 35.8 A under the same forcing, falling within this interval, and the modeled time series broadly capture the temporal morphology of the geomagnetic storm at the monitoring sites. This method shows promise for spatially explicit, screening-level GIC assessment without requiring access to operator data.

physics.geo-ph

Fast Trainable Multilinear Bases for Image Compression

The Discrete Fourier Transform (DFT), the Discrete Cosine Transform (DCT), and their block-wise variants underpin most deployed image and video codecs. Their effectiveness rests on three properties: their runtime is near-linear (up to a polylogarithmic factor) in the image size, they are exactly invertible, and they carry few to no parameters. In this work, we generalize these bases to isometric multilinear bases, allowing a small number of extra parameters (polylogarithmic in the image size), while preserving all three properties. We develop a scheme to train a better transformation for a given image dataset: we use isometric tensor networks, inspired by quantum many-body theory, to parameterize the basis, and train it with Riemannian optimization. We show that training consistently improves performance, as our parameterized bases can represent the traditional DFT and DCT-IV (a variant of the DCT). Evidence is shown across natural photographs and line drawings. On Quick Draw line-drawing compression, for example, the best trained basis outperforms the block cosine transform used in the JPEG format by $20\%$ in terms of compressed data size.

eess.IV