Inference-Based Quantum Sensing
Not on the map. Why?
Abstract (arXiv)
In a standard Quantum Sensing (QS) task one aims at estimating an unknown parameter θ, encoded into an n-qubit probe state, via measurements of the system. The success of this task hinges on the ability to correlate changes in the parameter to changes in the system response R(θ) (i.e., changes in the measurement outcomes). For simple cases the form of R(θ) is known, but the same cannot be said for realistic scenarios, as no general closed-form expression exists. In this work we present an inference-based scheme for QS. We show that, for a general class of unitary families of encoding, R(θ) can be fully characterized by only measuring the system response at 2n+1 parameters. This allows us to infer the value of an unknown parameter given the measured response, as well as to determine the sensitivity of the scheme, which characterizes its overall performance. We show that inference error is, with high probability, smaller than δ, if one measures the system response with a number of shots that scales only as Omega(log3(n)/δ2). Furthermore, the framework presented can be broadly applied as it remains valid for arbitrary probe states and measurement schemes, and, even holds in the presence of quantum noise. We also discuss how to extend our results beyond unitary families. Finally, to showcase our method we implement it for a QS task on real quantum hardware, and in numerical simulations.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 6 of its 52 references that are in the map. First posted on arXiv 20 Jun 2022.
Builds on
6 of 52 references.
References · 6
- 2020Variational Quantum Algorithmscited by 692
- 2020Noise-Induced Barren Plateaus in Variational Quantum Algorithmscited by 193
- 2020Absence of Barren Plateaus in Quantum Convolutional Neural Networkscited by 125
- 2019Stochastic gradient descent for hybrid quantum-classical optimizationcited by 59
- 2020Trainability of Dissipative Perceptron-Based Quantum Neural Networkscited by 56
- 2021Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?cited by 14
Built on by
Citing papers per year: 2022: 1; 2023: 4; 2024: 1; 2025: 1.
7 papers.
- 2023Does provable absence of barren plateaus imply classical simulability?cited by 80
- 2022Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networkscited by 52
- 2025A Primer on Quantum Machine Learningcited by 12
- 2023Effects of noise on the overparametrization of quantum neural networkscited by 9
- 2023On the universality of Sn-equivariant k-body gatescited by 7
- 2024Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theoremcited by 1
- 2023Optical Quantum Sensing for Agnostic Environments via Deep Learningcited by 0
- 2025A Primer on Quantum Machine Learning20 Nov 2025
- 2024Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem12 May 2024
- 2023Does provable absence of barren plateaus imply classical simulability?14 Dec 2023
- 2023Optical Quantum Sensing for Agnostic Environments via Deep Learning13 Nov 2023
- 2023On the universality of Sn-equivariant k-body gates1 Mar 2023
- 2023Effects of noise on the overparametrization of quantum neural networks10 Feb 2023
- 2022Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks18 Oct 2022