Moving quantum sensors

Evan Zhang; Erfan Abbasgholinejad; Yu-Xin Wang; Ali Fahimniya; Daniel J. Spencer; Sean R. Muleady; Mohammad Hafezi; Andrew M. Childs; Alexey V. Gorshkov

arXiv · 2610.17176

Moving quantum sensors

Evan Zhang·Erfan Abbasgholinejad·Yu-Xin Wang·Ali Fahimniya·Daniel J. Spencer·Sean R. Muleady·Mohammad Hafezi·Andrew M. Childs·Alexey V. Gorshkov

View original source ↗Read source document ↗Export metadata ↓

Abstract

We investigate whether controlled motion of a quantum sensor offers a metrological advantage in a field-detection task. We consider a localized field of known strength $B$ occupying an unknown contiguous region making up a fraction $1/N$ of the total search space, with a qubit sensor controlled for a total time $T$ to maximize the probability of detecting the field. We study the regime in which the characteristic timescale of the field is slow compared to the time to move the sensor between any two regions, and we distinguish classical motion, where the sensor follows a definite trajectory, from quantum motion, where the sensor can be in a coherent superposition of locations. For a single classically moving sensor, we derive an optimal multi-stop protocol and obtain the exact maximum detection probability. Allowing coherent spatial superposition maps the single-sensor problem onto Hamiltonian search and reduces the interrogation time for successfully detecting the field from $Θ(N/B)$ to $Θ(\sqrt{N}/B)$. We then extend the problem to $M$ sensors and identify a hierarchy of optimal time scalings for constant success probability determined by the available spatial and inter-sensor quantum resources. Unentangled coherently moving sensors achieve $T=Θ(\sqrt{N/M}/B)$ by searching disjoint regions in parallel, while entanglement among the sensors can further enhance the effective field coupling and achieve $T=Θ(\sqrt{N}/(MB))$. Matching lower bounds establish the optimality of these scalings in the presence of arbitrary controls and ancilla systems. Our results separate the roles of classical motion, spatial coherence, and entanglement in spatial field detection.

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Evan Zhang, Erfan Abbasgholinejad, Yu-Xin Wang, Ali Fahimniya, Daniel J. Spencer, Sean R. Muleady, Mohammad Hafezi, Andrew M. Childs, Alexey V. Gorshkov. 2026-10-12. Moving quantum sensors. https://arxiv.org/abs/2610.17176

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

KEEP EXPLORING

Related papers

arXiv2026

All you need is Trotter

The work here enables a cost scaling of $\tilde{O}\left( \frac{T ^{1+o(1)}\,{\rm log}^2 (1/ε)}{\varepsilon}\right)$ and maximum depth $\tilde{O}\left( \frac{T^{1+o(1)}\,{\rm log} (1/ε)}{\varepsilon}\right)$ for estimating observables after some Hamiltonian evolution $e^{i H T}$ using no extra block-encoding qubits, where $ε$ is the algorithmic error of the target Hamiltonian evolution and $\varepsilon$ is the statistical error from the observable estimation. Throughout, $\tilde{O}$ suppresses factors that are doubly logarithmic in $1/ε$ (i.e. ${\rm polyloglog}(1/ε)$), which are subdominant to the displayed ${\rm polylog}(1/ε)$ factors. This is achieved through product formulas, stable interpolation (Chebyshev), and to calculate the needed fractional queries, cardinal sine interpolation is used. This is an improvement over similar work using interpolation methods which have a superlinear scaling of the form $5^p T^{1+1/p}$, where $p$ is the order of the product formula used and an improvement on required qubits over Quantum Signal Processing methods while maintaining scaling with ${\rm polylog}{1/ε}$. This is accomplished through an optimized and variable (with $T$) order $p$. The slightly better $\log^2(1/ε)$ compared to $\log^3(1/ε)$ comes from the use of cardinal sine interpolation compared to other methods using Chebyshev interpolation and product formulas. The work presented here also provides an alternative to Quantum Signal Processing techniques to calculate observables or amplitudes after a fractional query evolution with a cost $O(T\log{1/ε})$ through this cardinal sine interpolation.

quant-ph↗

arXiv2026

Noncontextuality inequalities for prepare-transform-measure scenarios

We provide the first systematic technique for deriving witnesses of contextuality in prepare-transform-measure scenarios. More specifically, we show how linear quantifier elimination can be used to compute a polytope of correlations consistent with generalized noncontextuality in such scenarios. This polytope is specified as a set of noncontextuality inequalities that are necessary and sufficient conditions for observed data in the scenario to admit of a classical explanation relative to any linear operational identities, if one ignores some constraints from diagram preservation. While including these latter constraints generally leads to tighter inequalities, it seems that nonlinear quantifier elimination would be required to systematically include them. We also provide a linear program which can certify the nonclassicality of a set of numerical data arising in a prepare-transform-measure experiment. We apply our results to get a robust noncontextuality inequality for transformations that can be violated within the stabilizer subtheory. Finally, we give a simple algorithm for computing all the linear operational identities holding among a given set of states, of transformations, or of measurements.

quant-ph↗

arXiv2026

A General Framework for Gradient-Based Optimization of Superconducting Quantum Circuits using Qubit Discovery as a Case Study

Engineering the Hamiltonian of a quantum system is fundamental to the design of quantum systems. Automating Hamiltonian design through gradient-based optimization can dramatically accelerate this process. However, computing the gradients of eigenvalues and eigenvectors of a Hamiltonian--a large, sparse matrix--relative to system properties poses a significant challenge, especially for arbitrary systems. Superconducting quantum circuits offer substantial flexibility in Hamiltonian design, making them an ideal platform for this task. In this work, we present a comprehensive framework for the gradient-based optimization of superconducting quantum circuits, leveraging the SQcircuit software package. By addressing the challenge of calculating the gradient of the eigensystem for large, sparse Hamiltonians and integrating automatic differentiation within SQcircuit, our framework enables efficient and precise computation of gradients for various circuit properties or custom-defined metrics, streamlining the optimization process. We apply this framework to the qubit discovery problem, demonstrating its effectiveness in identifying qubit designs with superior performance metrics. The optimized circuits show improvements in a heuristic measure of gate count, upper bounds on gate speed, decoherence time, and resilience to noise and fabrication errors compared to existing qubits. While this methodology is showcased through qubit optimization and discovery, it is versatile and can be extended to tackle other optimization challenges in superconducting quantum hardware design.

quant-ph↗