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:2606.25100

Detection of patterns in a discrete-outcome sensor network

Pranjal Agarwal, Nada Ali, Mark Hillery

quant-phSubmitted Jun 23, 2026• Announced Jun 25, 2026• 0 citations
arXivHTMLPDF

Abstract

A discrete outcome quantum sensor network is one in which we are only interested in which detectors are activated. This can be studied in either the strong or weak interaction regime. If the detectors interact strongly with the environment, it is possible to definitely find which ones were activated. If the interaction is weaker, there is a possibility of making an error, and the object is to minimize the probability of this happening. Here we will be interested in this weaker interaction regime. We will also assume that only certain patterns of detectors will be activated, different patterns being translated versions of a fundamental one. Our object will be to find which pattern has been activated. We will look at both one and two-dimensional detector arrays and make use of techniques from minimum-error state discrimination.

Related papers

Discrete-outcome sensor networks. II. Multiple detection events and grouping detectors

Nada Ali, Mark S. Hillery

Quantum sensor networks have often been studied in order to determine how accurately they can determine a parameter, such as the strength of a magnetic field, at one of the detectors. A more coarse-grained approach is to try to simply determine whether a detector has interacted with a signal or not, and which detector it was. Such discrete-outcome quantum sensor networks, discrete in the sense that we are seeking answers to yes-no questions, are what we study here. One issue is what is a good initial state for the network, and, in particular, should it be entangled or not. Earlier we looked at the case when only one detector interacted, and here we extend that study in two ways. First, we allow more than one detector to interact, and second, we examine the effect of grouping the detectors. When the detectors are grouped we are only interested in which group contained interacting detectors and not in which individual detectors within a group interacted. We find that in the case of grouping detectors, entangled initial states can be helpful.

arXiv:2407.20435•Physical Review A•Jul 26, 2024•4 citations

Discrete outcome quantum sensor networks

Mark S. Hillery, Himanshu Gupta, Caitao Zhan

We model a quantum sensor network using techniques from quantum state discrimination. The interaction between a qubit detector and the environment is described by a unitary operator, and we will assume that at most one detector does interact. The task is to determine which one does or if none do. This involves choosing an initial state of the detectors and a measurement. We consider global measurements in which all detectors are measured simultaneously. We find that an entangled initial state can improve the detection probability, but this advantage decreases as the number of detectors increases.

arXiv:2210.17254•Physical Review A•Jan 30, 2023•18 citations

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

Applications of Entanglement in Quantum Information

Nada Ali

Entanglement is the resource that most sharply distinguishes quantum information processing from its classical counterpart, and this thesis examines it from two complementary directions: how it can be detected and quantified, and how it, together with the broader machinery of quantum correlations, interference, and measurement, can be put to use. We first study two simple, measurable conditions that detect bipartite entanglement, and show that the extent to which either is violated yields a lower bound on the negativity of a state. The bound is established for two qubits, extended to systems of arbitrary finite dimension, and sharpened when partial knowledge of the Schmidt vectors is available. We then turn to discrete-outcome quantum sensor networks, in which one seeks only to determine which detectors, or which group or spatial pattern of detectors, has responded to a signal. Working in the weak-interaction regime, where the output states are nonorthogonal, we use minimum-error and unambiguous state discrimination to show that entangled initial states and collective measurements confer an advantage when detectors are grouped, and we develop a shift-operator formalism that gives closed-form success probabilities for the detection of shifted patterns in one- and two-dimensional arrays. Next we consider the problem of learning two unknown pure qubit states, together with their probabilities of occurrence, from a scrambled stream; we show that receiving the systems in identically prepared pairs supplies exactly the extra quantum information needed, since the resulting two-qubit state in the symmetric subspace has a unique decomposition into pure product states, which we recover by tomography. Finally, we show how interference and measurement can convert information encoded in the phases of quantum amplitudes into information encoded in their magnitudes, amplifying the amplitudes that carry useful information and suppressing those that do not, and we apply this technique to states produced by the quantum approximate optimization algorithm for the MaxCut and minimum-vertex-cover problems. Throughout, a single theme recurs: the correlations and superpositions permitted by quantum mechanics are at once something to be measured and something to be exploited.

•Sep 1, 2026•0 citations

Sequential Discrimination Between Non-Orthogonal Quantum States

Dov Fields

The problem of discriminating between non-orthogonal states is one that has generated a lot of interest. This basic formalism is useful in many areas of quantum information. It serves as a fundamental basis for many quantum key distribution schemes, it functions as an integral part of other quantum algorithms, and it is useful in experimental settings where orthogonal states are not always possible to generate. Additionally, the discrimination problem reveals important fundamental properties, and is intrinsically related to entanglement. In this thesis, the focus is on exploring the problem of sequentially discriminating between non-orthogonal states. In the simplest version these schemes, Alice sends one of two known pure states to Bob who performs a non-optimal discrimination procedure such that the post measurement states resulting from his measurement can then be discriminated by a third participant, Charlie. In these schemes, the goal is to optimize the joint probability of both Bob and Charlie succeeding. In devising such a scheme, there are several different criteria that can be prioritized. The most basic scheme, referred to as Minimum Error (ME) discrimination, prioritizes Bob's and Charlie's abilities to successfully determine which state was sent by Alice. In this scheme, Bob and Charlie each set up two detectors and based on the result from the detector they make a guess as to which state was sent. For instance, if Bob registers a click in his first detector, he concludes that Alice sent the first state. As each detector has some probability to produce a result for either incoming result, Bob and Charlie optimize their joint probability of success by optimizing the probability that each detector will fire when the correlated state is sent by Alice. Another possible scheme, referred to as Unambiguous Discrimination (UD), prioritizes Bob's and Charlie's ability to correctly determine the state sent by Alice. In this scheme, Bob and Charlie each set up three detectors, where if a result is obtained from the first two detectors Bob or Charlie can determine with certainty which state was sent by Alice. One final setup, referred to as Discrimination with a Fixed Rate of Inconclusive Outcome, is a combination of the previous two schemes, where Bob and Charlie maximize their probability of successfully determining the state sent by Alice where they allow some fixed probability that they will not be able to determine which state Alice sent. This fixed inconclusive probability allows Bob and Charlie to control how much they prioritize correctly determining the state that was sent, as in the Unambiguous Discrimination, versus prioritizing successfully determining the state sent by Alice, as in Minimum Error discrimination. One final topic that will be discussed by this thesis is Quantum Retrodiction. Quantum Retrodiction applies an alternate perspective on the communication protocol between Alice and Bob. In the predictive model, Alice calculates the probability that Bob gets a specific measurement result given that she prepares her system in a specific state. In the retrodictive model, Bob calculates the probability that Alice prepared her system in a specific state given the result of his measurement. This alternate perspective on the communication procedure gives new a new understanding and new tools for approaching the problem of state discrimination, as exemplified by applying the retrodictive formalism to unambiguous discrimination.

•Jan 1, 2019•0 citations

Error-Minimizing Measurements in Postselected One-Shot Symmetric Quantum State Discrimination and Acceptance as a Performance Metric

Gupta, Saurabh Kumar, Abhishek Kr. Gupta

In hypothesis testing with quantum states, given a black box containing one of the two possible states, measurement is performed to detect in favor of one of the hypotheses. In postselected hypothesis testing, a third outcome is added, corresponding to not selecting any of the hypotheses. In postselected scenario, minimum error one-shot symmetric hypothesis testing is characterized in literature conditioned on the fact that one of the selected outcomes occur. We proceed further in this direction to give the set of all possible measurements that lead to the minimum error. We have given an arbitrary error-minimizing measurement in a parametric form. Note that not selecting any of the hypotheses decimates the quality of testing. We further give an example to show that these measurements vary in quality. There is a need to discuss the quality of postselected hypothesis testing. We then characterize the quality of postselected hypothesis testing by defining a new metric acceptance and give expression of acceptance for an arbitrary error-minimizing measurement in terms of some parameters of the measurement. On the set of measurements that achieve minimum error, we have maximized the acceptance, and given an example which achieves that, thus giving an example of the best possible measurement in terms of acceptance.

arXiv:2409.13379•Sep 20, 2024•0 citations
A discrete outcome quantum sensor network is one in which we are only interested in which detectors are activated. This can be studied in either the strong or weak interaction regime. If the detectors interact strongly with the environment, it is possible to definitely find which ones were activated. If the interaction is weaker, there is a possibility of making an error, and the object is to minimize the probability of this happening. Here we will be interested in this weaker interaction regime. We will also assume that only certain patterns of detectors will be activated, different patterns being translated versions of a fundamental one. Our object will be to find which pattern has been activated. We will look at both one and two-dimensional detector arrays and make use of techniques from minimum-error state discrimination.
Quantum sensor networks have often been studied in order to determine how accurately they can determine a parameter, such as the strength of a magnetic field, at one of the detectors. A more coarse-grained approach is to try to simply determine whether a detector has interacted with a signal or not, and which detector it was. Such discrete-outcome quantum sensor networks, discrete in the sense that we are seeking answers to yes-no questions, are what we study here. One issue is what is a good initial state for the network, and, in particular, should it be entangled or not. Earlier we looked at the case when only one detector interacted, and here we extend that study in two ways. First, we allow more than one detector to interact, and second, we examine the effect of grouping the detectors. When the detectors are grouped we are only interested in which group contained interacting detectors and not in which individual detectors within a group interacted. We find that in the case of grouping detectors, entangled initial states can be helpful.
We model a quantum sensor network using techniques from quantum state discrimination. The interaction between a qubit detector and the environment is described by a unitary operator, and we will assume that at most one detector does interact. The task is to determine which one does or if none do. This involves choosing an initial state of the detectors and a measurement. We consider global measurements in which all detectors are measured simultaneously. We find that an entangled initial state can improve the detection probability, but this advantage decreases as the number of detectors increases.
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.
Entanglement is the resource that most sharply distinguishes quantum information processing from its classical counterpart, and this thesis examines it from two complementary directions: how it can be detected and quantified, and how it, together with the broader machinery of quantum correlations, interference, and measurement, can be put to use. We first study two simple, measurable conditions that detect bipartite entanglement, and show that the extent to which either is violated yields a lower bound on the negativity of a state. The bound is established for two qubits, extended to systems of arbitrary finite dimension, and sharpened when partial knowledge of the Schmidt vectors is available. We then turn to discrete-outcome quantum sensor networks, in which one seeks only to determine which detectors, or which group or spatial pattern of detectors, has responded to a signal. Working in the weak-interaction regime, where the output states are nonorthogonal, we use minimum-error and unambiguous state discrimination to show that entangled initial states and collective measurements confer an advantage when detectors are grouped, and we develop a shift-operator formalism that gives closed-form success probabilities for the detection of shifted patterns in one- and two-dimensional arrays. Next we consider the problem of learning two unknown pure qubit states, together with their probabilities of occurrence, from a scrambled stream; we show that receiving the systems in identically prepared pairs supplies exactly the extra quantum information needed, since the resulting two-qubit state in the symmetric subspace has a unique decomposition into pure product states, which we recover by tomography. Finally, we show how interference and measurement can convert information encoded in the phases of quantum amplitudes into information encoded in their magnitudes, amplifying the amplitudes that carry useful information and suppressing those that do not, and we apply this technique to states produced by the quantum approximate optimization algorithm for the MaxCut and minimum-vertex-cover problems. Throughout, a single theme recurs: the correlations and superpositions permitted by quantum mechanics are at once something to be measured and something to be exploited.
The problem of discriminating between non-orthogonal states is one that has generated a lot of interest. This basic formalism is useful in many areas of quantum information. It serves as a fundamental basis for many quantum key distribution schemes, it functions as an integral part of other quantum algorithms, and it is useful in experimental settings where orthogonal states are not always possible to generate. Additionally, the discrimination problem reveals important fundamental properties, and is intrinsically related to entanglement. In this thesis, the focus is on exploring the problem of sequentially discriminating between non-orthogonal states. In the simplest version these schemes, Alice sends one of two known pure states to Bob who performs a non-optimal discrimination procedure such that the post measurement states resulting from his measurement can then be discriminated by a third participant, Charlie. In these schemes, the goal is to optimize the joint probability of both Bob and Charlie succeeding. In devising such a scheme, there are several different criteria that can be prioritized. The most basic scheme, referred to as Minimum Error (ME) discrimination, prioritizes Bob's and Charlie's abilities to successfully determine which state was sent by Alice. In this scheme, Bob and Charlie each set up two detectors and based on the result from the detector they make a guess as to which state was sent. For instance, if Bob registers a click in his first detector, he concludes that Alice sent the first state. As each detector has some probability to produce a result for either incoming result, Bob and Charlie optimize their joint probability of success by optimizing the probability that each detector will fire when the correlated state is sent by Alice. Another possible scheme, referred to as Unambiguous Discrimination (UD), prioritizes Bob's and Charlie's ability to correctly determine the state sent by Alice. In this scheme, Bob and Charlie each set up three detectors, where if a result is obtained from the first two detectors Bob or Charlie can determine with certainty which state was sent by Alice. One final setup, referred to as Discrimination with a Fixed Rate of Inconclusive Outcome, is a combination of the previous two schemes, where Bob and Charlie maximize their probability of successfully determining the state sent by Alice where they allow some fixed probability that they will not be able to determine which state Alice sent. This fixed inconclusive probability allows Bob and Charlie to control how much they prioritize correctly determining the state that was sent, as in the Unambiguous Discrimination, versus prioritizing successfully determining the state sent by Alice, as in Minimum Error discrimination. One final topic that will be discussed by this thesis is Quantum Retrodiction. Quantum Retrodiction applies an alternate perspective on the communication protocol between Alice and Bob. In the predictive model, Alice calculates the probability that Bob gets a specific measurement result given that she prepares her system in a specific state. In the retrodictive model, Bob calculates the probability that Alice prepared her system in a specific state given the result of his measurement. This alternate perspective on the communication procedure gives new a new understanding and new tools for approaching the problem of state discrimination, as exemplified by applying the retrodictive formalism to unambiguous discrimination.
In hypothesis testing with quantum states, given a black box containing one of the two possible states, measurement is performed to detect in favor of one of the hypotheses. In postselected hypothesis testing, a third outcome is added, corresponding to not selecting any of the hypotheses. In postselected scenario, minimum error one-shot symmetric hypothesis testing is characterized in literature conditioned on the fact that one of the selected outcomes occur. We proceed further in this direction to give the set of all possible measurements that lead to the minimum error. We have given an arbitrary error-minimizing measurement in a parametric form. Note that not selecting any of the hypotheses decimates the quality of testing. We further give an example to show that these measurements vary in quality. There is a need to discuss the quality of postselected hypothesis testing. We then characterize the quality of postselected hypothesis testing by defining a new metric acceptance and give expression of acceptance for an arbitrary error-minimizing measurement in terms of some parameters of the measurement. On the set of measurements that achieve minimum error, we have maximized the acceptance, and given an example which achieves that, thus giving an example of the best possible measurement in terms of acceptance.