Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2211.02260 · IEEE International Conference on Quantum Computing and Engineering (QCE)

Quantum Sensor Network Algorithms for Transmitter Localization

Caitao Zhan, Himanshu Gupta

Published Sep 17, 2023• 17 citations
arXivHTMLPDF

Abstract

A quantum sensor (QS) is able to measure various physical phenomena with extreme sensitivity. QSs have been used in several applications such as atomic interferometers, but few applications of a quantum sensor network (QSN) have been proposed or developed. We look at a natural application of QSN-localization of an event (in particular, of a wireless signal transmitter). In this paper, we develop effective quantum-based techniques for the localization of a transmitter using a QSN. Our approaches pose the localization problem as a well-studied quantum state discrimination (QSD) problem and address the challenges in its application to the localization problem. In particular, a quantum state discrimination solution can suffer from a high probability of error, especially when the number of states (i.e., the number of potential transmitter locations in our case) can be high. We address this challenge by developing a two-level localization approach, which localizes the transmitter at a coarser granularity in the first level, and then, in a finer granularity in the second level. We address the additional challenge of the impracticality of general measurements by developing new schemes that replace the QSD's measurement operator with a trained parameterized hybrid quantum-classical circuit. Our evaluation results using a custom-built simulator show that our best scheme is able to achieve meter-level (1-5m) localization accuracy; in the case of discrete locations, it achieves near-nerfect (99-100%) classification accuracy.

DOI
10.1109/qce57702.2023.00081

Related papers

Optimizing Initial State of Detector Sensors in Quantum Sensor Networks

Caitao Zhan, Himanshu Gupta, Mark S. Hillery

In this article, we consider a network of quantum sensors, where each sensor is a qubit detector that “fires,” i.e., its state changes when an event occurs close by. The change in state due to the firing of a detector is given by a unitary operator, which is the same for all sensors in the network. Such a network of detectors can be used to localize an event, using a protocol to determine the firing sensor, presumably the one closest to the event. The determination of the firing sensor can be posed as a Quantum State Discrimination problem, which incurs a probability of error depending on the initial state and the measurement operators used. In this article, we address the problem of determining the optimal initial global state of a network of detectors that incur a minimum probability of error in determining the firing sensor. For this problem, we derive necessary and sufficient conditions for the existence of an initial state that allows for perfect discrimination, i.e., zero probability of error. Using insights from this result, we derive a conjectured optimal solution for the initial state, provide a pathway to prove the conjecture, and validate the conjecture empirically using multiple search heuristics that seem to perform near-optimally.

arXiv:2306.17401•ACM Transactions on Quantum Computing•Mar 30, 2024•16 citations

A Framework for Spatial Quantum Sensing

Luís Bugalho, Yasser Omar, Damian Markham

Quantum sensor networks promise precision advantages over classical and single-sensor strategies, in particular when the estimator is non-local. We address the problem of finding such estimators through a framework we connote spatial quantum sensing: given an underlying field interrogated by a network of quantum sensors at fixed positions, construct an estimator for a property of the field, for example, distinguishing a source of signal, or evaluating the field or its derivatives at an arbitrary point. We first treat polynomial fields, casting the task as an interpolation problem, and then generalize to fields modeled by analytic functions, which yields general least-squares estimators. A central and largely unaddressed question is under what conditions on sensor placement these estimators are well-defined and error-free. For $m$-dimensional arrays we give explicit constructions and proofs in the interpolation setting using algebraic geometry, and establish necessary and sufficient conditions in the general case. Comparing a non-local entangled protocol with the best local strategy, we show that entanglement yields maximal precision in distributed sensing under global resource constraints. Finally, we introduce error-free subspaces, a technique that translates prior knowledge of the field into a reduction in the number of required sensors. We expect these techniques to be broadly useful in sensing problems across scales, ranging from earth-scale experiments to local applications such as biological imaging.

quant-pharXiv:2602.12193•Feb 13, 2026•1 citation

Quantum computational sensing using quantum signal processing, quantum neural networks, and Hamiltonian engineering

Saeed A. Khan, Sridhar Prabhu, Logan G. Wright +1 more

Abstract Combining quantum sensing with quantum computing can lead to quantum computational sensing (QCS) protocols that are able to more efficiently extract task-specific information from physical signals than is possible otherwise. In this paper, we present, in theory and numerical simulations, the application of two quantum algorithms—quantum signal processing and quantum neural networks—to various binary and multiclass machine-learning classification tasks in sensing. Here, sensing operations are interleaved with computing operations, giving rise to nonlinear functions of the sensed signals. Our approach to optimizing QCS protocols takes into account quantum sampling noise and allows us to engineer protocols that can yield accurate results with as few as just a single measurement shot. In all cases, we have been able to show a regime of operation where a quantum computational sensor can achieve higher accuracy than a conventional quantum sensor for a given budget of sensing time, with a simulated accuracy advantage of >20 percentage points for some tasks. We also present protocols for performing nonlinear tasks using Hamiltonian-engineered bosonic systems and quantum signal processing with hybrid qubit-bosonic systems, and empirically show an advantage when the received signal has a limited mean photon number.

arXiv:2507.15845•npj Quantum Information•May 14, 2026•8 citations

Noise-Robust Distributed Quantum Sensing: A Variational Quantum Approach

Uman Khalid, Muhammad Shohibul Ulum, Trung Q. Duong +2 more

Quantum sensing networks (QSNs) are expected to play a critical role in quantum networks by achieving measurement precision unattainable with classical methods, leveraging quantum properties such as superposition and entanglement. Distributed quantum sensing, a key application of QSNs, can reach Heisenberg-limited precision scaling with the number of sensors involved. However, practical implementation faces significant challenges due to noise effects, complicating the optimal selection of sensor configurations. In this paper, we propose applying a variational quantum algorithm (VQA) combined with a genetic algorithm to efficiently mitigate noise in quantum sensing protocols and to identify high-quality sensor configurations. Performance analysis demonstrates that our approach outperforms traditional sensor configuration methods in single- and multi-parameter sensing scenarios under dephasing and amplitude damping noises, significantly improving quantum sensing accuracy and scalability.

Globecom•Dec 8, 2025•0 citations

Quantum Sensors: A Comprehensive Review and Future Perspectives

Ana R. Bastos, Emmanuel Zambrini Cruzeiro, M. Niehus +1 more

Quantum sensing is an emerging field that exploits the principles of quantum mechanics to achieve unprecedented levels of precision, sensitivity, and accuracy in measuring physical quantities. From navigation and artificial intelligence to environmental monitoring and medical diagnostics, these technologies have the potential to transform a wide range of applications completely. This review provides an exploration of the fundamental principles, state-of-the-art developments, and future perspectives of quantum sensors and perception. We discuss the underlying quantum phenomena, such as superposition, entanglement, and quantum coherence, and their role in enabling advanced sensing capabilities. We also look at how quantum sensors can be incorporated into several applications. Lastly, we address the field’s challenges and outline future research directions.

IEEE Sensors Reviews•Jan 1, 2026•0 citations

Solving Quantum Channel Discrimination Problem With Quantum Networks and Quantum Neural Networks

Penghui Qiu, Xiaoguang Chen, Yi-Wei Shi

Distinguishing one quantum channel from another becomes a next natural question following the advent of quantum state discrimination. Here, we address the problem of quantum channel discrimination with the separable states and the entangled states input. Two schemes, based on the simulator for quantum networks and channels framework (SQUANCH) and the quantum machine learning toolbox (QMLT), are proposed to perform the quantum channel discrimination task. In the first scheme, we give an example of several qubit channels, verify that the performance metrics of channel discrimination can be improved by the entangled states. In the second scheme, we train a quantum circuit learning model to classify quantum channels using the Adam stochastic optimization algorithm. Although we consider the distinguishability in the case of only two possible channels, this model can be extended to any number of channels. This method can provide a good solution for distinguishing some complex quantum channels.

IEEE Access•Jan 1, 2019•10 citations
A quantum sensor (QS) is able to measure various physical phenomena with extreme sensitivity. QSs have been used in several applications such as atomic interferometers, but few applications of a quantum sensor network (QSN) have been proposed or developed. We look at a natural application of QSN-localization of an event (in particular, of a wireless signal transmitter). In this paper, we develop effective quantum-based techniques for the localization of a transmitter using a QSN. Our approaches pose the localization problem as a well-studied quantum state discrimination (QSD) problem and address the challenges in its application to the localization problem. In particular, a quantum state discrimination solution can suffer from a high probability of error, especially when the number of states (i.e., the number of potential transmitter locations in our case) can be high. We address this challenge by developing a two-level localization approach, which localizes the transmitter at a coarser granularity in the first level, and then, in a finer granularity in the second level. We address the additional challenge of the impracticality of general measurements by developing new schemes that replace the QSD's measurement operator with a trained parameterized hybrid quantum-classical circuit. Our evaluation results using a custom-built simulator show that our best scheme is able to achieve meter-level (1-5m) localization accuracy; in the case of discrete locations, it achieves near-nerfect (99-100%) classification accuracy.
In this article, we consider a network of quantum sensors, where each sensor is a qubit detector that “fires,” i.e., its state changes when an event occurs close by. The change in state due to the firing of a detector is given by a unitary operator, which is the same for all sensors in the network. Such a network of detectors can be used to localize an event, using a protocol to determine the firing sensor, presumably the one closest to the event. The determination of the firing sensor can be posed as a Quantum State Discrimination problem, which incurs a probability of error depending on the initial state and the measurement operators used. In this article, we address the problem of determining the optimal initial global state of a network of detectors that incur a minimum probability of error in determining the firing sensor. For this problem, we derive necessary and sufficient conditions for the existence of an initial state that allows for perfect discrimination, i.e., zero probability of error. Using insights from this result, we derive a conjectured optimal solution for the initial state, provide a pathway to prove the conjecture, and validate the conjecture empirically using multiple search heuristics that seem to perform near-optimally.
Quantum sensor networks promise precision advantages over classical and single-sensor strategies, in particular when the estimator is non-local. We address the problem of finding such estimators through a framework we connote spatial quantum sensing: given an underlying field interrogated by a network of quantum sensors at fixed positions, construct an estimator for a property of the field, for example, distinguishing a source of signal, or evaluating the field or its derivatives at an arbitrary point. We first treat polynomial fields, casting the task as an interpolation problem, and then generalize to fields modeled by analytic functions, which yields general least-squares estimators. A central and largely unaddressed question is under what conditions on sensor placement these estimators are well-defined and error-free. For mmm-dimensional arrays we give explicit constructions and proofs in the interpolation setting using algebraic geometry, and establish necessary and sufficient conditions in the general case. Comparing a non-local entangled protocol with the best local strategy, we show that entanglement yields maximal precision in distributed sensing under global resource constraints. Finally, we introduce error-free subspaces, a technique that translates prior knowledge of the field into a reduction in the number of required sensors. We expect these techniques to be broadly useful in sensing problems across scales, ranging from earth-scale experiments to local applications such as biological imaging.
Abstract Combining quantum sensing with quantum computing can lead to quantum computational sensing (QCS) protocols that are able to more efficiently extract task-specific information from physical signals than is possible otherwise. In this paper, we present, in theory and numerical simulations, the application of two quantum algorithms—quantum signal processing and quantum neural networks—to various binary and multiclass machine-learning classification tasks in sensing. Here, sensing operations are interleaved with computing operations, giving rise to nonlinear functions of the sensed signals. Our approach to optimizing QCS protocols takes into account quantum sampling noise and allows us to engineer protocols that can yield accurate results with as few as just a single measurement shot. In all cases, we have been able to show a regime of operation where a quantum computational sensor can achieve higher accuracy than a conventional quantum sensor for a given budget of sensing time, with a simulated accuracy advantage of >20 percentage points for some tasks. We also present protocols for performing nonlinear tasks using Hamiltonian-engineered bosonic systems and quantum signal processing with hybrid qubit-bosonic systems, and empirically show an advantage when the received signal has a limited mean photon number.
Quantum sensing networks (QSNs) are expected to play a critical role in quantum networks by achieving measurement precision unattainable with classical methods, leveraging quantum properties such as superposition and entanglement. Distributed quantum sensing, a key application of QSNs, can reach Heisenberg-limited precision scaling with the number of sensors involved. However, practical implementation faces significant challenges due to noise effects, complicating the optimal selection of sensor configurations. In this paper, we propose applying a variational quantum algorithm (VQA) combined with a genetic algorithm to efficiently mitigate noise in quantum sensing protocols and to identify high-quality sensor configurations. Performance analysis demonstrates that our approach outperforms traditional sensor configuration methods in single- and multi-parameter sensing scenarios under dephasing and amplitude damping noises, significantly improving quantum sensing accuracy and scalability.
Quantum sensing is an emerging field that exploits the principles of quantum mechanics to achieve unprecedented levels of precision, sensitivity, and accuracy in measuring physical quantities. From navigation and artificial intelligence to environmental monitoring and medical diagnostics, these technologies have the potential to transform a wide range of applications completely. This review provides an exploration of the fundamental principles, state-of-the-art developments, and future perspectives of quantum sensors and perception. We discuss the underlying quantum phenomena, such as superposition, entanglement, and quantum coherence, and their role in enabling advanced sensing capabilities. We also look at how quantum sensors can be incorporated into several applications. Lastly, we address the field’s challenges and outline future research directions.
Distinguishing one quantum channel from another becomes a next natural question following the advent of quantum state discrimination. Here, we address the problem of quantum channel discrimination with the separable states and the entangled states input. Two schemes, based on the simulator for quantum networks and channels framework (SQUANCH) and the quantum machine learning toolbox (QMLT), are proposed to perform the quantum channel discrimination task. In the first scheme, we give an example of several qubit channels, verify that the performance metrics of channel discrimination can be improved by the entangled states. In the second scheme, we train a quantum circuit learning model to classify quantum channels using the Adam stochastic optimization algorithm. Although we consider the distinguishability in the case of only two possible channels, this model can be extended to any number of channels. This method can provide a good solution for distinguishing some complex quantum channels.