Entanglement-enhanced testing of multiple quantum hypotheses

Quantum hypothesis testing has been greatly advanced for the binary discrimination of two states, or two channels. In this setting, we already know that quantum entanglement can be used to enhance the discrimination of two bosonic channels. Here, we remove the restriction of binary hypotheses and show that entangled photons can remarkably boost the discrimination of multiple bosonic channels. More precisely, we formulate a general problem of channel-position finding where the goal is to determine the position of a target channel among many background channels. We prove that, using entangled photons at the input and a generalized form of conditional nulling receiver at the output, we may outperform any classical strategy. Our results can be applied to enhance a range of technological tasks, including the optical readout of sparse classical data, the spectroscopic analysis of a frequency spectrum, and the determination of the direction of a target at fixed range. Quantum channel discrimination exploits quantum resources to improve hypothesis testing for binary bosonic channels. Here, the authors overcome the binary setting, showing quantum entanglement greatly enhances the discrimination performance for an arbitrary number of channels.


I. INTRODUCTION
Quantum sensing [1] exploits quantum resources and measurements to improve the performance of parameter estimation and hypothesis testing, with respect to the best possible classical strategies.One of the fundamental settings of quantum hypothesis testing [2][3][4][5] is quantum channel discrimination [6][7][8][9][10], where the aim is to discriminate between different physical processes, modeled as quantum channels, arbitrarily chosen from some known ensemble.Finding the best strategy for quantum channel discrimination is a non-trivial double optimization problem which involves the optimization of both input states and output measurements.Furthermore, the optimization is generally performed assuming a certain number of probings and it becomes an energy-constrained problem in the discrimination of bosonic channels, where the available input states have a finite mean number of photons [11].
For the discrimination of bosonic channels, the socalled 'classical strategies' are based on preparing the input signal modes in (mixtures of) coherent states and then measuring the channel outputs by means of suitable receivers, e.g., a homodyne detector.By fixing the input energy to a suitably low number of mean photons per probing, the classical strategies are often beaten by truly-quantum sources such as two-mode squeezed vacuum states, where each signal mode (probing the channel) is entangled with a corresponding idler mode directly sent to the output measurement.This quantum advantage was specifically proven for the readout of data from an optical memory, known as quantum reading [12], and the yes/no detection of a remote target, known as quantum illumination [13][14][15][16].
While quantum advantage with entangled-assisted protocols has been proven in problems of binary quantum channel discrimination with bosonic channels, the potential advantage of quantum entanglement over the best classical strategies still needs to be explored and fully quantified in the more general setting of discrimination between multiple quantum channels.As a matter of fact, this problem is very relevant because real physical applications often involves multiple hypotheses, and their treatment lead to non-trivial mathematical complications.In fact, naively decomposing a multi-hypothesis quantum channel discrimination into multiple rounds of binary cases does not necessarily preserve the quantum advantages from the binary case.
In this work, we formulate a basic problem of multiple channel discrimination that we call "channel-position finding".Here the goal is to determine the position of a target channel among many copies of a background channel.We prove that, using entangled photons at the input and a generalized form of conditional nulling receiver at the output, we may outperform any classical strategy in finding the position of the target channel, with a clear advantage in terms of mean error probability and its error exponent.In particular, our receiver design only relies on state-of-the-art technology in quantum optics, i.e., direct photo-detection (not requiring number-resolution), two-mode squeezing (which can be realized by standard optical parametric amplifiers) and feed-forward control (which has been demonstrated [17]).Our results can be applied to various applications, including position-based quantum reading, spectroscopy and target finding.

II. RESULTS
A. General setting and main findings.
We study the discrimination of multiple quantum channels by introducing and studying the problem of V m n C s V L 9 q h 9 q J s d S M c D o v D C J F Q 0 y m e E z 7 h g r s U + X E 6 c V z d G K U E f I C a U p o l K o / J 2 L s K z X z X d P p Y z 1 R f 7 1 E / M / r R 9 q 7 d G I m w k h T Q R a L v I g j H a D k f T R i k h L N Z 4 Z g I p m 5 F Z E J l p h o E 1 I h D e E q w f n 3 y 8 u k c 1 a p 1 i q 1 2 3 q p U c / i y M M R H E M Z q n A B D b i B J r S B g I B H e I Y X S 1 l P 1 q v 1 t m j N W d n M I f y C 9 f 4 F 4 4 a Q f w = = < / l a t e x i t > E < l a t e x i t s h a 1 _ b a s e 6 4 = " R X r w 8 o q E S q / t x Y G G V L i 5 j h 1 h H K A = " > A A A B 9 H i c b V D L S s N A F L 2 p r 1 p f V Z d u B o v g q i S 2 + N g V R H B Z w T 6 g D W U y n b R D J 5 M 4 M y m U 0 O 9 w 4 0 I R t 3 6 M O / / G S R p E r Q c G D u f c y z 1 z v I g z p W 3 7 0 y q s r K 6 t b x Q 3 S 1 v b O 7 t 7 5 f 2 D t g p j S W i L h D y U X Q 8 r y p m g L c 0 0 p 9 1 I U h x 4 n H a 8 y X X q d 6 Z U K h a K e z 2 L q B v g k W A + I 1 g b y e 0 H W I 8 J 5 s n N f O A M y h W 7 a m d A y 8 T J S Q V y N A f l j / 4 w J H F A h S Y c K 9 V z 7 E i 7 C Z a a E U 7 n p X 6 s a I T J B I 9 o z 1 C B A 6 r c J A s 9 R y d G G S I / l O Y J j T L 1 5 0 a C A 6 V m g W c m 0 5 D q r 5 e K / 3 m 9 W P u X b s J E F G s q y O K Q H 3 O k Q 5 Q 2 g I Z M U q L 5 z B B M J D N Z E R l j i Y k 2 P Z W y E q 5 S n H 9 / e Z m 0 z 6 p O r V q 7 q 1 c a 9 b y O I h z B M Z y C A x f Q g F t o Q g s I P M A j P M O L N b W e r F f r b T F a s P K d Q / g F 6 / 0 L u H q S K A = = < / l a t e x i t > E < l a t e x i t s h a 1 _ b a s e 6 4 = " X u r A 8 A z O 5 q 3 2 w i f B Z H N P B d I / n K Q = " > A A A B 9 H i c b V D L S s N A F L 3 x W e u r 6 t L N Y B F c l a Q t P n Y F E V x W s A 9 o Q 5 l M J + 3 Q y S T O T A o l 9 D v c u F D E r R / j z r 9 x k g Z R 6 4 G B w z n 3 c s 8 c L + J M a d v + t F Z W 1 9 Y 3 N g t b x e 2 d 3 b 3 9 0 s F h W 4 W x J L R F Q h 7 K r o c V 5 U z Q l m a a 0 2 4 k K Q 4 8 T j v e 5 D r 1 O 1 M q F Q v F v Z 5 F 1 A 3 w S D C f E a y N 5 P Y D r M c E 8 + R m P q g O S m W 7 Y m d A y 8 T J S R l y N A e l j / 4 w J H F A h S Y c K 9 V z 7 E i 7 C Z a a E U 7 n x X 6 s a I T J B I 9 o z 1 C B A 6 r c J A s 9 R 6 d G G S I / l O Y J j T L 1 5 0 a C A 6 V m g W c m 0 5 D q r 5 e K / 3 m 9 W P u X b s J E F G s q y O K Q H 3 O k Q 5 Q 2 g I Z M U q L 5 z B B M J D N Z E R l j i Y k 2 P R W z E q 5 S n H 9 / e Z m 0 q x W n V q n d 1 c u N e l 5 H A Y 7 h B M 7 A g Q t o w C 0 0 o Q U E H u A R n u H F m l p P 1 q v 1 t h h d s f K d I / g F 6 / 0 L u f 6 S K Q = = < / l a t e x i t > E < l a t e x i t s h a 1 _ b a s e 6 4 = " o F F h U 6 Y q Q b t S + x R f w w l q W o S E S b M = " > A A A B 9 H i c b V D L S s N A F L 2 p r 1 p f V Z d u B o v g q i S 2 + N g V R H B Z w T 6 g D W U y n b R D J 5 M 4 M y m U 0 O 9 w 4 0 I R t 3 6 M O / / G S R p E r Q c G D u f c y z 1 z v I g z p W 3 7 0 y q s r K 6 t b x Q 3 S 1 v b O 7 t 7 5 f 2 D t g p j S W i L h D y U X Q 8 r y p m g L c 0 0 p 9 1 I U h x 4 n H a 8 y X X q d 6 Z U K h a K e z 2 L q B v g k W A + I 1 g b y e 0 H W I 8 J 5 s n N f F A b l C t 2 1 c 6 A l o m T k w r k a A 7 K H / 1 h S O K A C k 0 4 V q r n 2 J F 2 E y w 1 I 5 z O S / 1 Y 0 Q i T C R 7 R n q E C B 1 S 5 S R Z 6 j k 6 M M k R + K M 0 T G m X q z 4 0 E B 0 r N A s 9 M p i H V X y 8 V / / N 6 s f Y v 3 Y S J K N Z U k M U h P + Z I h y h t A A 2 Z p E T z m S G Y S G a y I j L G E h N t e i p l J V y l O P / + 8 j J p n 1 W d W r V 2 V 6 8 0 6 n k d R T i C Y z g F B y 6 g A b f Q h B Y Q e I B H e I Y X a 2 o 9 W a / W 2 2 K 0 Y O U 7 h / A L 1 v s X u 4 K S K g = = < / l a t e x i t > (B) < l a t e x i t s h a 1 _ b a s e 6 4 = " 0 3 + I l e v t t I g U U z r i 7 x R X 1 3  V m n C s V L 9 q h 9 q J s d S M c D o v D C J F Q 0 y m e E z 7 h g r s U + X E 6 c V z d G K U E f I C a U p o l K o / J 2 L s K z X z X d P p Y z 1 R f 7 1 E / M / r R 9 q 7 d G I m w k h T Q R a L v I g j H a D k f T R i k h L N Z 4 Z g I p m 5 F Z E J l p h o E 1 I h D e E q w f n 3 y 8 u k c 1 a p 1 i q 1 2 3 q p U c / i y M M R H E M Z q n A B D b i B J r S B g I B H e I Y X S 1 l P 1 q v 1 t m j N W d n M I f y C 9 f 4 F 4 4 a Q f w = = < / l a t e x i t > (B) < l a t e x i t s h a 1 _ b a s e 6 4 = " 0 3 + I l e v t t I g U U z r i 7 x R X 1 3 < l a t e x i t s h a 1 _ b a s e 6 4 = " 0 3 + I l e v t t I g U U z r i 7 x R X 1 3 7 < l a t e x i t s h a 1 _ b a s e 6 4 = " 0 3 + I l e v t t I g U U z r i 7 x R X 1 3 7 < l a t e x i t s h a 1 _ b a s e 6 4 = " 0 3 + I l e v t t I g U U z r i 7 x R X 1 3 7

Classical strategy
< l a t e x i t s h a 1 _ b a s e 6 4 = " i 7 z 3 f 8 k U q y W 7 E U C A k g X 9 7 s r y t r X e l q 0 F K 5 8 5 h l + w 3 r 8 A 6 t q N q g = = < / l a t e x i t > S 3 < l a t e x i t s h a 1 _ b a s e 6 4 = " K w 1 K n v l c s V r e V B F x l O d w 2 Z t 9 2 J g = " > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l s U X s r e P F Y q f 2 A N p T N d t M u 3 W z C 7 k Y o o T / B i w d F v P q L v P l v 3 K R B 1 P p g 4 P H e D D P z v I g z p W 3 7 0 y q s r W 9 s b h W 3 S z u 7 e / s H 5 c O j r g p j S W i H h D y U f Q 8 r y p m g H c 0 0 p / 1 I U h x 4 n P a 8 2 U 3 q 9 r X e l q 0 F K 5 8 5 h l + w 3 r 8 A 7 F 6 N q w = = < / l a t e x i t > ?< l a t e x i t s h a 1 _ b a s e 6 4 = " h B / 4 h s m S q n a l B e y 2 S X d 6 P y Y k W S g = " > q x X 6 2 3 R W r D y m U P 0 C 9 b 7 F 6 X o j P E = < / l a t e x i t > ?< l a t e x i t s h a 1 _ b a s e 6 4 = " h B / 4 h s m S q n a l B e y 2 S X d 6 P y Y k W S g = " > q x X 6 2 3 R W r D y m U P 0 C 9 b 7 F 6 X o j P E = < / l a t e x i t > ?< l a t e x i t s h a 1 _ b a s e 6 4 = " h B / 4 h s m S q n a l B e y 2 S X d 6 P y Y k W S g = " > r X e l q 0 F K 5 8 5 h l + w 3 r 8 A 6 t q N q g = = < / l a t e x i t > S 3 < l a t e x i t s h a 1 _ b a s e 6 4 = " K w 1 K n v l c s V r e V B F x l O d w 2 Z t 9 2 J g = " > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l s U X s r e P F Y q f 2 A N p T N d t M u 3 W z C 7 k Y o o T / B i w d F v P q L v P l v 3 K R B 1 P p g 4 P H e D D P z v I g z p W 3 7 0 y q s r W 9 s b h W 3 S z u 7 e / s H 5 c O j r g p j S W i H h D y U f Q 8 r y p m g H c 0 0 p / 1 I U h x 4 n P a 8 2 U 3 q 9 r X e l q 0 F K 5 8 5 h l + w 3 r 8 A 7 F 6 N q w = = < / l a t e x i t > rB < l a t e x i t s h a 1 _ b a s e 6 4 = " M u w j O 8 W N x 6 s l 6 t t 3 l r w c p n 9 u E X r P c v + u K N s w = = < / l a t e x i t > S 1 < l a t e x i t s h a 1 _ b a s e 6 4 = " + i 5 n I E u 8 Q P n w s l r s O 6 z h c V U U 9 S A = " > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l s U X s r e P F Y q f 2 A N p T N d t M u 3 W z C 7 k Y o o T / B i w d F v P q L v P l v 3 K R B 1 P p g 4 P H e D D P z v I g z p W 3 7 0 y q s r W 9 s b h W 3 S z u 7 e / s H 5 c O j r g p j S W i H h D y U f Q 8 r y p m g H c 0 0 p / 1 I U h x 4 n P a 8 2 U 3 q 9 P l v 3 K R B 1 P p g 4 P H e D D P z v I g z p W 3 7 0 y q s r W 9 s b h W 3 S z u 7 e / s H 5 c O j r g p j S W i H h D y U f Q 8 r y p m g H c 0 0 p / 1 I U h x 4 n P a 8 2 U 3 q 9 r X e l q 0 F K 5 8 5 h l + w 3 r 8 A 6 t q N q g = = < / l a t e x i t > S 3 < l a t e x i t s h a 1 _ b a s e 6 4 = " K w 1 K n v l c s V r e V B F x l O d w 2 Z t 9 2 J g = " > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l s U X s r e P F Y q f 2 A N p T N d t M u 3 W z C 7 k Y o o T / B i w d F v P q L v P l v 3 K R B 1 P p g 4 P H e D D P z v I g z p W 3 7 0 y q s r W 9 s b h W 3 S z u 7 e / s H 5 c O j r g p j S W i H h D y U f Q 8 r y p m g H c 0 0 p / 1 I U h x 4 n P a 8 2 U 3 q 9 r X e l q 0 F K 5 8 5 h l + w 3 r 8 A 7 F 6 N q w = = < / l a t e x i t > Receiver < l a t e x i t s h a 1 _ b a s e 6 4 = " u y q W X b 0

Quantum target finding
< l a t e x i t s h a 1 _ b a s e 6 4 = " 7 U 4 z u P A 1 q h 4 2 X 9 p W A l v s w 4 l Z entanglement-enhanced spectroscopy < l a t e x i t s h a 1 _ b a s e 6 4 = " 6 s 0 z / G / q z 5 S G 7 7 w A z K 3 d 3 2 o q e n o = " channel-position finding (CPF).This is a basic model of pattern recognition involving quantum channels, which has relations with the notion of pulse-position modulation [19][20][21][22].In CPF, a pattern is represented by a multimode quantum channel E composed of m sub-channels Φ, each acting on a different subsystem S k (for k = 1, . . ., m) and chosen from a binary alphabet {Φ (B) , Φ (T ) }.Only one of the sub-channels can be the target channel Φ (T ) , while all the others are copies of a background channel Φ (B) .A quantum pattern is therefore represented by a global channel E n (for n = 1, • • • , m) where the target channel is only applied to subsystem S n while all the other subsystems undergo background channels (see Fig. 1a for a simple example with m = 3).
In this scenario, we design entanglement-enhanced protocols, based on a two-mode squeezed vacuum source and a generalized entangled version of the conditional-nulling (CN) receiver [17,[23][24][25], that are able to greatly outperform any classical strategy based on coherent states (see Fig. 1b for a schematic).This quantum advantage is quantified in terms of much lower mean error probability and improved error exponent for its asymptotic behavior.
Quantum-enhanced CPF has wide applications (see Fig. 1c).In quantum reading of classical data, this corresponds to a novel formulation that we call 'positionbased quantum reading'.Here the information is encoded in the position of a target memory cell with reflectivity r T which is randomly located among background memory cells with reflectivity r B .This is a particularly suitable model for information readout from sparse memory blocks.Changing from spatial to frequency modes, it can be mapped into a quantum-enhanced model of photometer or scanner, where the goal is to find an absorbance line within a band of frequencies.The advantage can therefore be interpreted as a quantum-enhanced tool for non-invasive spectroscopy.
Another potential application of CPF is quantum target finding, where we simultaneously probe multiple space cells that are now represented by sectors of a sphere with some fixed radius.Only a single sector has a target with reflectivity η while all the other sectors are empty.Moreover, each sector is characterized by bright noise so that N B mean thermal photons per bosonic mode are irradiated back to the receiver.Of course the problem is not limited to a spherical geometry.For instance, it can be seen in the context of defected device detection.Suppose there is an assembly line for producing a device that implements a channel, and with low probability, the assembly line produces a defective device that implements a different channel.Similarly, the problem can equivalently be mapped from spatial to frequency modes, so as to realize a quantum-enhanced scanner now working in very noisy conditions.
Besides these potential applications, we expect that our results will have other implications beyond the model of CPF.For instance, as a by-product, we also found that our generalized CN receiver beats the best known receiver for the original binary problem of quantum reading [12] (see Sec. VII B for more details).

B. Generalized conditional nulling receiver
From a mathematical point of view, the model of CPF exploits a relevant symmetry property that enables us to perform analytical calculations.Formally, we consider the discrimination of m possible global channels {E n } m n=1 , each with equal prior probability and expressed by where is the background/target channel acting on subsystem S k .In general, each subsystem may represent a collection of M bosonic modes.
It is easy to see that the ensemble of global channels {E n } m n=1 has the geometric uniform symmetry (GUS) [22] E n = S n−1 E 1 S †n−1 , where the unitary S is a cyclic permutation and S m = I, with I being the identity operator.
Because the channels are highly symmetric, it is natural to input a product state with GUS ⊗ m k=1 φ S k , in which case the output state becomes where σ (T /B) := Φ (T /B) (φ).It is clear that this ensemble of output states also has GUS, i.e., ρ n = S n−1 ρ 1 S †n−1 , and it is analogous to the states considered in a pulseposition modulation [19,21,22].It is known [22,26] that the optimal positive-valued operator measure (POVM) {Π k } minimizing the error probability for discriminating an ensemble of GUS states has the same type of symmetry, i.e., Π n = S n−1 Π 1 S †n−1 .This POVM has minimum error probability (Helstrom limit) P H = 1−Tr(ρ 1 Π 1 ).For the specific cases where the output states are pure σ T /B = ψ (T /B) ψ (T /B) , with overlap ζ = | ψ (T ) |ψ (B) | 2 , we have the following expression of the Helstrom limit which is achievable by the 'pretty good' measurement [27][28][29].In particular, note that for mζ 1 we have the asymptotic expansion In general, when Eq. ( 2) represents an ensemble of mixed states, we do not know how to compute the ultimate Helstrom limit.However, we can resort to a suboptimal detection strategy by generalizing the CN receiver of Ref. [23].In fact, consider the m-ary CPF problem of Eq. ( 1) with target/background channel Φ (T /B) .Assume that the pattern is probed by a GUS state so that the output ensemble is given by a generally-mixed state as in Eq. ( 2) with target/background state σ (T /B) .Then, we show the following (see Sec. VII F for a proof).
Theorem 1 (Generalized CN receiver) Denote by h n the hypothesis that the target channel Φ (T ) is encoded in sub-system S n , so that the global channel is E n .Suppose that there are two partially unambiguous POVMs, that we call t-POVM {Π (5) Then, we design the following receiver.Start with n = 1: 1. Check the current hypothesis h n by measuring subsystem S n with the t-POVM {Π The error probability of this CN receiver is where are the two types of error probabilities.
Note that, when mζ 1 1, we have the asymptotic expansion Also note that the above receiver is a CN receiver because it exploits partially-unambiguous POVMs and a feed-forward mechanism, similar to the classical CN receiver [23].However, it is a generalized CN receiver because it also involves entanglement with ancillas and may also be applied to mixed-state inputs, while the original CN receiver [23] only applies to pure states with no entanglement.Finally, our receiver only relies on local operations and classical communication among the different subsystems, an important feature that makes it practical.For pure GUS states, one can always devise partially unambiguous POVMs and find symmetric error probabilities ζ 1 = ζ 2 = ζ, in which case the CN receiver asymptotically achieves twice the Helstrom limit in Eq. ( 4).However, for mixed GUS states, it is generally difficult to design such POVMs, and we will have to give non-trivial constructions in this paper.Also note that feed-forward is crucial for achieving good performance.
In fact, suppose that we choose a simple strategy without feed-forward, e.g., measuring all subsystems in the b-POVM {Π b }.In this case, no error occurs when measuring background states σ (B) .The error only occurs when this POVM is applied to the target state σ (T ) and gives the erroneous outcome 'B', which happens with probability ζ 2 .When this happens, we need to randomly guess (just because all outcomes would be equal to 'B').This gives a conditional error probability (m − 1) /m, since only one among the m subsystems is correct.The corresponding error probability for this design is given by where the first 1/m factor is the equal prior.We find that , the CN strategy is always better than the non-feed-forward strategy and the advantage is particularly large when ζ 1 is small.

III. CLASSICAL VERSUS ENTANGLED STRATEGY
Given a CPF problem expressed by Eq. ( 1), we aim to minimize the mean error probability affecting the dis-crimination of the corresponding m hypotheses {h n } m n=1 .The solution of this problem is derived assuming that the signal modes irradiated over the subsystems are energetically-constrained.More precisely, let us discuss below the details on how we compare classical strategies (or 'benchmarks') with quantum strategies.
In a classical strategy (see Fig. 1b), we consider an input source which is described by a state with positive P-representation, so that it emits a statistical mixtures of multi-mode coherent states.First assume that this classical source has the GUS structure ⊗ m k=1 φ S k , so that M modes and M N S mean photons are irradiated over each subsystem.In this case, we can directly map Eq. ( 1) into Eq.( 2) and write the following lower bound based on Ref. [30] (see Sec. VII G for more details) where F is the quantum fidelity.
For the problem of CPF with arbitrary single-mode phase-insensitive bosonic Gaussian channels [11,31] (see Sec. VII A for a detailed definition), we prove a general classical benchmark.Suppose the target and background channels have transmissivity/gain µ T , µ B and output noises E T , E B .Given the most general classical source at the input, i.e., a multimode mixture of coherent states not necessarily with GUS structure, and assuming it irradiates a total of mM modes and mM N S mean photons over the entire pattern of channels, we show the following lower bound (LB) to the mean error probability (see Sec. VII H and Sec.VIII B for proof) First note that we can also obtain this bound from Eq. ( 9) by considering a source that irradiates a singlemode coherent state | √ N S for each of the M modes probing subsystem S k .Then, consider no passive signature E B = E T , which means that successful discrimination requires signal irradiation, i.e., it cannot be based on the passive detection of different levels of background noise.In this latter case, we find that an energetic singlemode coherent state |M N S on each subsystem is able to produce Eq. ( 10) from Eq. ( 9).For this reason, in our next comparisons, we will also consider the performance of such a coherent-state source.In some cases, the corresponding output ensemble will turn out to be pure, so that we can exactly quantify its performance via Eq.(3).
In order to obtain an enhancement by means of entanglement, we need to introduce ancillary 'idler' systems I k , for 1 ≤ k ≤ m, which are directly sent to the measurement apparatus (see Fig. 1b).This means that the generic global channel takes the form Sn ⊗ I In ).(11) For the quantum source, we use the tensor product φ ⊗mM ME , where φ ME := ∞ k=0 N k S /(N S + 1) k+1 |k, k is a two-mode squeezed vacuum state that maximally entangles a signal mode with a corresponding idler mode, given the mean number of photons N S constraining both signal and idler energies.Each subsystem S k is probed by the signal part of φ ⊗M ME with a total of M N S photons on average irradiated over S k .Therefore, the overall GUS ensemble of output states takes the form SnIn , (12) where Ξ (T /B) = (Φ (T /B) ⊗I)(φ ⊗M M E ).For generally-mixed states, it is difficult to calculate the Helstrom limit.One alternative is to use the upper bound (UB) [30] However, far better results can be found by employing the generalized CN receiver of Theorem 1.Note that the formulation and proof of this theorem automatically applies to the extended channel E n → E n ⊗I and the corresponding target/background state σ (T /B) → Ξ (T /B) .
In the following we explicitly compare classical and quantum performance for the paradigmatic cases mentioned in our introduction, i.e., position-based quantum reading and quantum target finding, including their frequency-based spectroscopic formulations.In all cases we exactly quantify the quantum advantage that is achievable by the use of entanglement.

IV. POSITION-BASED QUANTUM READING AND FREQUENCY SCANNER
As depicted in Fig. 1, a possible specification of the problem is for the quantum readout of classical data from optical memories.In quantum reading [12], the bosonic channels are used to model the reflection of light from the surfaces of an optical cell with different reflectivities, whose two possible values r T and r B are used to encode a classical bit.In the absence of other noise, the readout process is therefore equivalent to discriminating the value r ∈ {r T , r B } of the loss parameter of a pure-loss bosonic channel L r .In our position-based formulation of the protocol, the classical information is encoded in the position of a target cell (with reflectivity µ T = r T ) within a pattern of m cells, where all the remaining are background cells (with reflectivity µ B = r B ).In general, we probe each cell with M bosonic modes, so that we have target channel In the following, we develop our theory of position-based quantum and classical reading in this pure-loss setting, where E B = E T = 0. Our analysis can be extended to the presence of extra noise (thermal-loss channels) as discussed in Sec.VII I.
As previously mentioned, we can map the model from spatial to frequency modes.This means that the problem may be translated into a spectroscopic one where the goal is to find a faint absorbance line r T < 1 within a range W of transparent frequencies (r B ∼ 1).This can be resolved into a discrete ensemble of m = W/δW modes, where δW is the bandwidth of the detector.The corresponding quantum-advantage can then be directly re-stated in terms of better identifying an absorbance line in a frequency spectrum, where we are constrained to use a white power spectral density over W for a certain time duration, so that the total irradiated energy is equal to mM N S .This model can be considered both in transmission (e.g., in a spectro-photometer setup) and in reflection (e.g., in a scanner-like setup).

A. Position-based reading with classical light
We can easily specify the lower bound in Eq. ( 10) to the reading problem, so that we get the following lower bound for position-based classical reading of a block of m cells irradiated by mM N s mean photons where 'CR' stands for classical reading.As discussed before, we can also obtain this bound from Eq. ( 9) by irradiating energetic single-mode coherent states on each subsystem, i.e., ⊗ m k=1 |α S k with α = √ M N S .Assuming the input source ⊗ m k=1 |α S k , the output states {ρ n } m n=1 are pure, expressed by Eq. ( 2) with σ ( ) = | √ r α for = T, B. Thus we can use Eq.(3) to calculate the Helstrom limit at the output where In the limit of small overlap ζ 1, we have which is only m/2 times larger than the lower bound in Eq. ( 14).This also means that the lower bound is tight in the error exponent.Although it is extremely difficult to minimize the Helstrom limit by varying the input among general non-symmetric classical states, we can show that mixtures of the type ´d2 αP (α) ⊗ m k=1 |α S k or increasing the modes in each subsystem do not improve the value of P CR H (see details in Sec.VII E).

B. Position-based reading with entangled light
To get a quantum advantage in terms of a lower error probability and, therefore, a higher rate of data retrieval from the pattern, we interrogate each cell with the signal-part of an M -pair two-mode squeezed vacuum state φ ⊗M ME .At the output of each cell, we get the state ⊗M for = B, T .We can upper bound the error probability using the formula in Eq. ( 13), where the fidelity term F 2 Ξ (T ) , Ξ (B) = F 2M (L r T ⊗ I)φ ME , (L r B ⊗ I)φ ME can be exactly calculated (see Sec. VIII A for details).The exact expression of the bound P QR H,U B is too long to display, but will be used in our numerical comparisons (here 'QR' stands for quantum reading).
For N S 1 and M 1 at fixed M N S per cell, we have the simple asymptotic expansion Comparing Eqs. ( 16) and ( 17), we can already see that, for r T + r B ≥ 1, the error exponent of the quantum case is better than the exact error exponent of the classical case.In particular, this advantage becomes large when both r T and r B are close to unity.We can improve this result and show a greater quantum advantage by employing the generalized CN receiver of Theorem 1.An important preliminary observation is that the output state (L r ⊗ I)φ ME , from each probing of a generic cell, can be transformed into a tensor product form, where the signal mode is in the vacuum state and the idler mode is in a thermal state with mean photon number (1 − r)N S .This is possible by applying a twomode squeezing operation S 2 [s(r, N S )], with strength This allows us to design a CN receiver for the cell output state Ξ ( ) , which consists of two-mode squeezing operations followed by photon counting on the signal modes.By applying S 2 [s(r B , N S )] to each pair of the 2M signalidler modes, we have that Ξ (B) is transformed into a state Ξ(B) with vacuum signal modes; while Ξ (T ) becomes a state Ξ(T ) where the signal modes are in a product of M thermal states, each with mean photon number Let us now measure the number of photons on the M signal modes.The outcomes are interpreted as follows: If we count any photon then return 'T', otherwise return 'B'.Assuming this rule, the background state Ξ(B) does not lead to any photon count and, therefore, to any error.An error occurs only if, in the presence of a target state Ξ(T ) , we get zero count on all M signal modes, which happens with probability This measurement implements the b-POVM of our CN receiver (unambiguous over background cells).
Let us now realize the t-POVM, which is unambiguous on target cells.In this case, we apply the operator S 2 [s(r T , N S )] with different squeezing, so that Ξ(T ) has vacuum signal modes, while Ξ(B) has thermal signal < l a t e x i t s h a 1 _ b a s e 6 4 = " W 6 7 T / S K j a l D A H f J 8 l e g B / c y g L 9 < l a t e x i t s h a 1 _ b a s e 6 4 = " W 6 7 T / S K j a l D A H f J 8 l e g B / c y g L 9 < l a t e x i t s h a 1 _ b a s e 6 4 = " T w T T c U k 7 6 I S + T 5 / m L e B 7 Y w r Q CN /P CR H ]), between quantum reading with conditional-nulling receiver P QR CN and classical reading in the Helstrom limit P CR H .This ratio is plotted as a function of the background and target reflectivities, rB and rT , for M = 10 modes per cell.Note that since Eq. ( 6) is not symmetric in rB and rT , we observe asymmetric patterns.(b) Error probabilities P QR CN (black solid) and P CR H (black dashed) versus number of modes M , for reflectivities rB = 0.95 and rT = 0.9.We also include the ultimate classical benchmark given by the lower bound for classical reading P CR H,LB (gray dashed).(c) As in panel (b) but with rB = 1 and rT = 0.4.modes, each with mean photon number n(N S , r T , r B ).By performing photon counting on the signal modes and using the same rule above, we have that an error occurs only if a background state Ξ(B) gets zero counts on all M modes, which happens with probability We can now study the performance of the CN receiver from Theorem 1, where we use the formula of Eq. ( 6) computed over the two types of error probabilities ζ QR 1 and ζ QR 2 .For position-based quantum reading of a block of m cells, we find the achievable error probability At low photon numbers N S 1 while keeping the total irradiated energy M N S as a finite value, we have that P QR CN 2P CR H (r B , r T , M, N S ), i.e., a factor of two worse than the classical performance in Eq. ( 16).However, for larger values of N S and assuming the condition 1, we find that which has a large advantage in the error exponent when r B and r T are close to 1, as also evident from Fig. 2.

C. Further quantum enhancement
Let us consider an ideal scenario for position-based quantum reading, where the target cell with r T < 1 has z s e 8 d c X J Z 4 7 g D 5 z P H + K N j O M = < / l a t e x i t > 3 < l a t e x i t s h a 1 _ b a s e 6 4 = " e d t w q q G / z L w S X 4 b 0 O C e 4 I O e k 4 l c = " > A L X p + h / 0 j m 3 3 a p 9 c V O r N N 0 8 j i I c w T G c g g t 1 a M I 1 t K A N B A J 4 g C d 4 t q b W o / V i v S 5 b C 1 Y + c w g / Y L 1 9 A r r P j X g = < / l a t e x i t > to be found among many background cells with perfect reflectivity r B = 1.This configuration allows us to show an even higher quantum advantage.In fact, for ideal background (r B = 1), the application of S 2 [s(r B , N S )] generates a background state Ξ(B) which is vacuum in all signal and idler modes, and a target state Ξ(T ) which is non-vacuum on all these modes.We can therefore apply the b-POVM of the CN receiver to the entire set of 2M signal and idler modes.
The type-II error probability is obtained by calculating the fidelity between Ξ(T ) and the vacuum state (see Sec. VIII A for details).This leads to with a clear improvement with respect to the previous case ζ QR 2 .Consider now the t-POVM.The application of the other squeezing operator S 2 [s(r T , N S )] generates a target state Ξ(T ) with vacuum signals but non-vacuum idlers, so that we must again restrict photon counting to the signal modes, implying that we achieve the same type-I error probability as before, i.e., ζ QS 1 * = ζ QR 1 .Using Eq. ( 6), we derive the overall error probability ).At low photon numbers N S 1 while keeping the total energy M N S as finite, we find which shows a large advantage in the error exponent with respect to the classical strategy of Eq. ( 16).In Fig. 3 we show the quantum advantage both in terms of error exponent and actual values of the error probabilities.This further quantum enhancement is particularly relevant to spectroscopy, where the background is indeed highly transparent with r B very close to unity.Finally, let us note that the other case of r T = 1 and r B < 1 can be improved in the same way, leading to an improved type-I error probability and the overall error probability V. QUANTUM TARGET FINDING In general, target detection involves a search in multiple space-time-frequency bins.Time bins are associated with ranging, frequency bins can be used for speed detection via Doppler effect, while space bins are associated with direction finding.Let us study the latter problem here, i.e., discovering the position of a single target in terms of polar and azimuthal angles, while we assume it is at some fixed range R and does not create large Doppler shifts.Let us divide the R-radius horizon sphere into m non-overlapping sectors, one of which contains the reflective target.For large m, each sector S k is approximately subtended by a corresponding small solid angle (see Fig. 1).
We simultaneously probe all m sectors, while using M bosonic modes for each of them (e.g., a train of temporal pulses or a single broadband pulse).Each signal mode will shine N S mean number of photons.Let us denote by L N µ a thermal-loss channel with loss parameter µ and mean number of thermal photons N , so that its output noise is E = (1 − µ)N .When the target is present in a sector, the M signal modes go through the target channel

⊗M
, so that each mode is affected by loss parameter µ T = η and output noise E T = N B .By contrast, if the target is absent in a sector, then the M signal modes are lost and replaced by environmental modes, each having N B mean thermal photons.For target absent, we therefore have the background channel Φ (B) = L N B 0 ⊗M , with µ B = 0 and E B = N B (no passive signature).
We consider the region of quantum illumination [13], where bright thermal noise N B 1 is present in the environment, as it would be the case at the microwave wavelengths [15].We then consider low energy signals (N S 1) so that the probing is non-revealing and/or non-destructive for the target.In these conditions, the considered quantum channels are clearly entanglementbreaking. Before we present the corresponding results, let us note that the model for target finding can also be mapped to a model of quantum-enhanced frequency scanner, now in the presence of bright environmental noise.See Sec.VII D for more details on this mapping and also for a discussion on target ranging.

A. Target finding with classical light
The general lower bound in Eq. ( 10) can be specified to classical target finding, by setting E T = E B = N B and µ T = η, µ B = 0, so that we have where 'CTF' stands for classical target finding.This expression bounds the best performance achievable by classical sources of light that globally irradiate mM N S mean photons over the entire sphere.In particular, we can also obtain this bound from Eq. ( 9) by considering m single-mode coherent states ⊗ m k=1 | √ M N S S k , each shining M N S mean photons on a sector.
Let us compute the classical performance with a specific receiver.When we use the uniform coherent source ⊗ m k=1 | √ M N S S k at the input, the ensemble of output states of Eq. ( 2) is defined on the following background and target states This is identical to classical pulse-position modulation decoding with signal √ ηM N S and thermal noise N B [22].
We can therefore consider the direct detection (DD) scheme based on photon counting (see Ref. [2, p. 193] and Ref. [22]), giving the error probability where v = N B /(N B + 1) and C k m is the binomial coefficient (number of combinations of k items out of m).
In the high-noise N B 1 and large number of modes M 1 limit, this error probability is dominated by the smallest error exponent in the sum, and it becomes This is only a factor 2 worse than the bound in Eq. (28).
In these limits, we expect that classical target finding via a DD scheme is close to the optimum.31) (CTF-DD, solid black line) and assuming the lower bound of Eq. ( 28) (CTF-LB, black dashed line).We then consider the performance of quantum target finding assuming the upper bound of Eq. ( 35) (QTF-UB, red dashed line) and via the generalized CN receiver from Eq. ( 37) (QTF-CN, solid red line).

B. Target finding with entangled light
Let us now assume a tensor product of two-mode squeezed vacuum states φ ⊗mM ME at the input.In each M -mode probing of a sector, the ensemble of possible output states takes the form of Eq. ( 12) with the following background and target states Let us compute an upper bound based on Eq. (13).Its exact expression is too long to display, even though it is used in our numerical evaluation.In the limits of N S 1 and M 1 while keeping the total energy per sector M N S as fixed, we find the following asymptotic bound for quantum target finding where 'QTF' stands for quantum target finding.This has no advantage with respect to Eq. ( 28), but both bounds are likely to be non-tight.It has instead a factor of 2 advantange in the error exponent with respect to the direct detection result in Eq. ( 32) for large noise.To better evaluate the performance of the entangled case, we need to analyze an explicit receiver design.We adapt the quantum illumination receiver based on sum-frequency-generation (SFG) process [32] to the CN approach in Theorem 1.Consider the problem of binary hypothesis testing between the states Ξ (B) and Ξ (T ) .An SFG receiver converts the signal-idler cross correlations into photon number counts, through the combination of multiple cycles of SFG process and interference.In the limit of N S 1 and N B 1 with feed-forward disabled, the photon counting statistics of Ξ (T ) is equivalent to a coherent state with mean photon number M ηN S (N S + 1)/N B , and Ξ (B) is equivalent to a vacuum state.
After this conversion, suppose we perform the photoncounting stage of the SFG measurement on the background state Ξ (B) , then there is always zero count and therefore no ambiguity.For Ξ (T ) , there is instead some type-II probability ζ QTF 2 = e −M ηN S (N S +1)/N B of getting zero count and therefore selecting the wrong hypothesis 'B'.This corresponds to the b-POVM of the generalized CN receiver.On the other hand, for the t-POVM, suppose we apply a two-mode squeezer S 2 (r QTF ) before performing the previous SFG measurement, where is chosen such that S 2 (r QTF )Ξ (T ) S † 2 (r QTF ) has zero cross correlations.Then we decide 'T' when no photon is counted, making no error.However, when the input is Ξ (B) , the squeezer will create phase sensitive cross correlations ηN S (N S + 1).When no counts are registered, we select the wrong hypothesis 'T', with type-I error probability According to Theorem 1, the performance of the generalized CN receiver (here applied to signals and idlers) corresponds to the following mean error probability Comparing with Eq. ( 28), we see that the achievable performance of quantum target finding clearly outperforms the bound on classical target finding.In particular, we see that the error exponent is increased by a factor 2. We explicitly compare these results in Fig. 4.

VI. DISCUSSION
In this work we showed that the use of quantum entanglement can remarkably enhance the discrimination of multiple quantum hypotheses, represented by different quantum channels.More precisely, we considered a basic problem of quantum pattern recognition that we called channel-position finding.This model can also be regarded as a quantum channel formulation of the classical notion of pulse position modulation [18], so that it clearly departs from other approaches that exploit pulse position modulation for state-based encoding (e.g., [33]).In this scenario, we showed that the use of an entangled source and a suitably constructed conditional-nulling receiver can outperform any classical strategy in finding the unknown position of the channel.This quantum advantage, which is quantified in terms of improved error probability and error exponent, has been demonstrated for paradigmatic examples of position-based quantum reading and quantum target finding, besides their spectroscopic formulations as quantum-enhanced frequency scanners.As further theoretical directions, it would be interesting to exactly establish the optimal performance for discriminating quantum channels with geometrical uniform symmetry.Finally, although our analysis relies on symmetry, we expect that a similar quantum advantage exists in problems with completely arbitrary channel patterns.

A. Phase-insensitive bosonic Gaussian channels
The action of a single-mode (covariant) phaseinsensitive Gaussian channel over input quadratures x = (q, p) T can be represented by the transformation x → √ µ x + |1 − µ| xE + ξ, where µ is a transmissivity (0 ≤ µ ≤ 1) or a gain (µ ≥ 1), xE are the quadratures of an environmental mode in a thermal state with noise variance ω = 2N + 1 with N being the mean number of photons, and ξ is additive classical noise, i.e., a random 2D Gaussian distributed vector with covariance matrix w add I.Here we assume vacuum shot noise equal to 1.

B. Optimal receiver design for standard quantum reading
The novel CN receiver design also provides a new insight into the original quantum reading model, related to the binary discrimination between the two lossy channels L r T and L r B .With no loss of generality, let us assume r B > r T .When the two-mode squeezed vacuum state is used at the input, the corresponding outputs for the two channels are Ξ (T ) and Ξ (B) .Therefore, the t-POVM and b-POVM can be directly used to perform their discrimination, leading to the error probability ζ QR 1 /2 for equal prior probabilities, where ζ QR 1 is given in Eq. ( 20) (see orange line in Fig. 5).In the ideal case of r B = 1, the further improved detection, given by the application of the CN receiver to both signals and idlers, leads to the error probability ζ QR 1 * /2, where ζ QR 1 * is defined in Eq. ( 24) (see red dotted line in Fig. 5).We see that the improved performance ζ QR 1 * /2 saturates the quantum Chernoff bound [34,35], while the general applicable performance ζ QR 1 /2 is able to beat the best known Bell-measurement receiver designed in Ref. [12], when M is sufficiently large (Fig. 5a) or N S is large (Fig. 5b).

C. Quantum-enhanced frequency scanner in noisy conditions
The previous result on quantum-enhanced target finding can be mapped into the model of quantum-enhanced frequency scanner, now in the presence of bright environmental noise.Here we assume a target at some fixed linear distance which only reflects radiation at a narrow bandwidth δν around some carrier frequency.The target is assumed to be still (or slowly moving) and it completely diffracts the other frequencies.This limited reflection could also be the effect of meta-materials employed in a cloak.The previous m sectors now become m different non-overlapping frequency windows with bandwidth δν, each of them probed by pulses with the same bandwidth.
One choice is to use a single δν-pulse per window containing M δν −1 effective frequencies, each with N S mean number of photons.Alternatively, we may use M δν-pulses per window which are irradiated as a train of independent temporal modes, each with N S mean photons.In our basic model, reflection occurs in only one of these frequency windows, while background thermal noise is detected for all the other windows.The previous results (see Fig. 4) automatically imply that the use of an entangled source outperforms any classical strategies in the regime of few photon numbers per mode.

D. About target ranging
In quantum target finding, if we consider time bins instead of spatial bins, we can map the problem of direction finding into that of ranging.However, at fixed direction but unknown distance, there is a crucial problem which makes the entangled strategy problematic.We must in fact ensure that the returning signal (if any) is combined with the corresponding idler.Since we do not know, a priori, the round-trip time from the target, we cannot synchronize signal and idler in a joint detection.A potential way around this issue is to generate a train of m signal-idler pulses with well-separated carrier frequencies (e.g., with a bandwidth larger than the maximum Doppler shift from the target).Signal-idler pulses with different carrier frequencies are then jointly detected at the different m time bins.In principle this procedure can make the quantum measurement work but it opens another issue.The best classical strategy does not need to employ this time slicing approach.In fact, one could just send a single coherent pulse and wait for its potential return.From an energetic point of view, the classical source would only irradiate M N S photons (assuming M modes per pulse) while the quantum case needs to irradiate mM N S photons on the target.Taking into account of this difference, we cannot directly apply our previous findings and derive a conclusive result for target ranging.
E. Optimality of pure states which leads to completing the proof.Note that, when the receiver outcomes are all 'B', this automatically means that the true hypothesis is the last one h m , which is compatible with the initial condition P 1 = 0.

G. General bounds
Here we present various general bounds that apply to m-ary state discrimination (in the setting of symmetric hypothesis testing) [30,[36][37][38].These bounds apply to the mean error probability and can be computed from the quantum fidelity (which has a closed formula for arbitrary multimode Gaussian states [1]).In particular, for any ensemble of m mixed states {p k , ρ k } m k=1 , where p k 's are the prior probabilities and ρ k 's are the states, we may write the following upper bound [30] on the minimum error probability or Helstrom limit where F is the Bures' fidelity The result of Eq. ( 42) is a bound on the performance of a 'pretty good' measurement [27][28][29] and is tight up to constant factors in the exponent.A fidelity-based lower bound is instead given by [40], Assume equi-probable hypotheses, so that p k = m −1 for any k, and the symmetry F (ρ k , ρ k ) = F, ∀k = k .We then have the simplified bounds These bounds appear in our main text with the following expressions for the fidelity for the entangled case and for the classical case.

H. Classical benchmarks
Let us now introduce a general bound to the ultimate performances achievable by classical states in CPF, with direct application to the problems of position-based reading and target finding.Recall that the general problem of CPF consists of discriminating an ensemble of GUS bosonic channels {E n } with equal priors.These are expressed by where is the background/target channel acting on subsystem S k (e.g., a cell or a sector).Each of these channels is generally meant to be a multi-mode channel.
In the bosonic setting, single-mode phase insensitive Gaussian channels model various physical processes.This channel G µ,E can be parameterized by a transmissivity/gain parameter µ > 0 and a noise parameter E > 0 [11,31].In particular, E accounts for the thermal photons at the output of the channel, when the input state is a vacuum or coherent state.Besides the single-mode phase-insensitive (covariant) bosonic Gaussian channels discussed above, we can also include the contravariant conjugate thermal-amplifier channel, whose action on an input annihilation operator is described by where µ > 0 and ê is in a thermal state with mean photon number (E − µ)/(µ + 1).All these channels G µ,E map a coherent state |α to a displaced thermal state with amplitude √ µα ( √ µα for the conjugate thermal-amplifier channel) and covariance matrix (2E + 1)I.Therefore, let us consider the problem of CPF where target and background channels are tensor products of a phase-insensitive bosonic Gaussian channel G µ,E .Denote the transmissivity/gain and noise of the target channel as µ T and E T , while those of the background channel as µ B and E B .For the entangled case, we assume that each subsystem is exactly probed by M signal modes, each irradiating N S mean photons, for a total of mM N S mean photons.For the classical case, we can relax this structure and include the more general case of different energies irradiated by the M modes over each subsystem S k .More generally, for the classical case with no passive signature (E B = E T ), we can also allow for arbitrary number of modes M k per subsystem S k so that Φ (l) In other words, for classical CPF with no passive signature, the only surviving constraint is the mM N S mean photons globally irradiated.More precisely, we can state the following result (See Sec.VIII B for proof).
Lemma 4 Consider the problem of CPF where target and background channels are tensor products of a singlemode phase-insensitive bosonic Gaussian channel with parameters µ T , E T (for target) and µ B , E B (for background).Assume a global energetic constraint of mM N S mean photons with M modes irradiated over each of the m subsystems S k .The optimal classical state (with positive P-representation) minimizing the lower bound P H,LB of Eq. ( 44) is any tensor product of coherent states where the phases θ S k = M N S for any k, so that each subsystem is irradiated by the same mean number of photons.The corresponding minimum lower bound is given by In particular, for no passive signature (E T = E B ≡ E), we have the simplification and bound holds under the general energetic constraint of mM N S mean photons, with no restriction on the number of modes irradiated per subsystem.In this case, an optimal state is the tensor-product ⊗ m k=1 | √ M N S S k .

I. Position-based quantum reading with thermal noise
Let us now generalize the study of position-based quantum reading to the case where thermal noise is present in the environment.This means that the environmental input of each cell S k is not the vacuum but a thermal state with N B mean photons.Each cell has reflectivity r B or r T in such a way that the block of m cells has GUS.The block is probed by bosonic modes for a total of mM N S mean photons irradiated.In the classical case, we compute a lower bound to the performance of all possible classical states (globally irradiating mM N S mean photons over the m block of cells), while for the quantum case, we consider a tensor-product of two-mode squeezed vacuum states, so that M signal modes probe each cell, with each mode irradiating N S mean photons.
As before, this problem is mapped into the discrimination of an ensemble of GUS bosonic channels {E n } with equal priors, which are expressed by In general, the protocol of position-based quantum reading can be formulated with two generic thermal-loss channels as discussed above.In such a case, the classical benchmark can be easily derived from Eq. ( 52).Then, we may introduce a finer classification of the protocol in two types: one with active and the other with passive signature.In the first type of protocol, the parameters of the channels are such that the noise variance at the output of the two channels is different assuming the vacuum state at the input.In other words, their statistical discrimination is possible without sending a probing signal.In the second type, the parameters are such that there are no different levels of noise at the output.Here we analyze this second type, so that the channels have reflectivity r l and mean number of thermal photons N B /(1 − r l ) for l = B, T .The corresponding classical benchmark can be computed from Eq. (53) and takes the form Similarly, for the quantum case, we can easily repeat the calculations to find the corresponding noisy expression P QR,N H,U B of the upper bound P QR H,U B .For N S 1 and M 1 at fixed M N S , we may generalize Eq. ( 17) of our main text into the following form where Denote the error exponent in Eq. (55) as CR and the error exponent in Eq. (56) as QR .We find that the quantum case is always better than the classical case, i.e.QR > CR .For r T and r B close to 1, we have QR / CR 1 + 1/2N B .In this regime, we see that the advantage becomes huge when N B 1, which agrees with our observation in Eqs. ( 16) and (17).However, when N B 1, the advantage decays, in agreement with the observation related to Eqs. (28) and (35).Note that this conclusion is based on a quantum lower bound and a classical upper bound, and we expect them to be not tight when noise N B is large.
which is the standard one-norm and equals the total mean photon number of the state |x, θ .Then, the total energy constraint leads to the inequality ˆdP x 1 ≤ mM N S , where the integral has been simplified to a marginal probability measure P restricted to the non-negative variables x.
The total conditional state at the output of the channel E n is also a mixture, with expression where each conditional state is given by The target state (ρ C T ) Sn is a product of M displaced thermal states, each with amplitude µ T x From Eq. (44), we can write the following lower bound to the mean error probability.
where use the joint concavity of the fidelity and Jensen's inequality for the square function with K = (m − 1)m/2.
Let us now address each fidelity term Using Eq. (57), we can compute where the constant B ≡ ( From the one-norm in the expression above, it becomes clear that the performance is exactly the same regardless how the energy is distributed among the M modes impinging on a subsystem, as long as the mean total energy irradiated over the subsystem is fixed.By replacing the F C in Eq. ( 79), and noticing that F C does not depend on θ we find the following lower bound where we define the function (84) We notice that e −cx with c ≥ 0 is strictly convex in the variable x.Thus, from convexity, we have where we have used K = m(m − 1)/2 and x 1 = m n=1 x n 1 (from its definition).The equality holds if and only if x n 1 = x 1 /m for all n.
Thus overall we may write For the second inequality, we use the convexity of e −cx (with c > 0) and Jensen's inequality to move expectation value to the exponent.The last inequality exploits the monotonic decreasing property of e −cx (with c > 0) and the constraint in Eq. ( 76).This leads to the result in Eq. (52) in the main paper.Due to Jensen's inequality and convexity, it is easy to check that the lower bound is reached by (and only by) an input coherent source |x, θ = ⊗ m k=1 |x k , θ k S k , such that on each subsystem the total mean photon number is equal, i.e., x k = M N S .
In the passive case of E B = E T ≡ E, we have c E B ,E T = 1, so that Eq. ( 82) is replaced by We see that only the mean photon numbers of subsystems S n and S n appear in this expression, while the number of modes M is no longer present.Following the same analysis from above we arrive at Eq. (53) in the main paper where the number of modes M per subsystem can now be variable, as long as the total energetic constraint mM N S is fixed.In this case, the optimal state is a tensor product of coherent states with arbitrary number of modes per subsystem and arbitrary phases, and such to irradiate M N S mean photon number per subsystem.In particular, we may choose ⊗ m k=1 | √ M N S S k .
t e x i t s h a 1 _ b a s e 6 4 = " C 2 x x H 3 F o + 8 b 5 y B X V i t z 0 b 9 t D Z M s = " > A A A B 8 X i c b V D L S s N A F L 2 p r 1 p f V Z d u B o t Q N y W 1 x c e u 4 M Z l h b 6 w j W U y n b R D J 5 M w M x F K 6 F + 4 c a G I W / / G n X / j J A 2 i 1 g M X D u f c y 7 3 3 u C F n S t v 2 p 5 V b W V 1 b 3 8 h v F r a 2 d 3 b 3 i v s H H R V E k t A 2 C X g g e y 5 W l D N B 2 5 p p T n u h p N h 3 O e 2 6 0 + v E 7 z 5 Q q V g g W n o W U s f H Y 8 E 8 R r A 2 0 t 2 g O W H 3 c b l 1 O h 8 W S 3 b F T o G W S T U j J c j Q H B Y / B q O A R D 4

7 F
I v w = " > A A A B 8 X i c b V D L S s N A F L 2 p r 1 p f V Z d u B o t Q N y W 1 x c e u 6 M Z l B f v A N p b J d N I O n U z C z E Q o o X / h x o U i b v 0 b d / 6 N k z S I W g 9 c O J x z L / f e 4 4 a c K W 3 bn 1 Z u a X l l d S 2 / X t j Y 3 N r e K e 7 u t V U Q S U J b J O C B 7 L p Y U c 4 E b W m m O e 2 G k m L f 5 b T j T q 4 S v / N A p W K B u N X T k D o + H g n m M Y K 1 k e 7 6 z T G 7 j 8 u X x 7 N B s W R X 7 B R o k V Q z U o I M z U H x o z 8 M S O R T o Q n H S v W q d q i d G E v N C K e z Q j 9 S N M R k g k e 0 Z 6 j A P l V O n F 4 8 Q 0 d G G S I v k K a E R q n 6 c y L G v l J T 3 z W d P t Z j 9 d d L x P + 8 X q S 9 c y d m I o w 0 F W S + y I s 4 0 g F K 3 k d D J i n R f G o I J p K Z W x E Z Y 4 m J N i E V 0 h A u E p x + v 7 x I 2 i e V a q 1 S u 6 m X G v U s j j w c w C G U o Q p n 0 I B r a E I L C A h 4 h G d 4 s Z T 1 Z L 1 a b / P W n J X N 7 M M v W O 9 f y B q Q b Q = = < / l a t e x i t > (B)< l a t e x i t s h a 1 _ b a s e 6 4 = " 0 3 + I l e v t t I g U U z r i 7 x R X 1 3 7F I v w = " > A A A B 8 X i c b V D L S s N A F L 2 p r 1 p f V Z d u B o t Q N y W 1 x c e u 6 M Z l B f v A N p b J d N I O n U z C z E Q o o X / h x o U i b v 0 b d / 6 N k z S I W g 9 c O J x z L / f e 4 4 a c K W 3 b n 1 Z u a X l l d S 2 / X t j Y 3 N r e K e 7 u t V U Q S U J b J O C B 7 L p Y U c 4 E b W m m O e 2 G k m L f 5 b T j T q 4 S v / N A p W K B u N X T k D o + H g n m M Y K 1 k e 7 6 z T G 7 j 8 u X x 7 N B s W R X 7 B R o k V Q z U o I M z U H x o z 8 M S O R T o Q n H S v W q d q i d G E v N C K e z Q j 9 S N M R k g k e 0 Z 6 j A P l V O n F 4 8 Q 0 d G G S I v k K a E R q n 6 c y L G v l J T 3 z W d P t Z j 9 d d L x P + 8 X q S 9 c y d m I o w 0 F W S + y I s 4 0 g F K 3 k d D J i n R f G o I J p K Z W x E Z Y 4 m J N i E V 0 h A u E p x + v 7 x I 2 i e V a q 1 S u 6 m X G v U s j j w c w C G U o Q p n 0 I B r a E I L C A h 4 h G d 4 s Z T 1 Z L 1 a b / P W n J X N 7 M M v W O 9 f y B q Q b Q = = </ l a t e x i t > (T ) < l a t e x i t s h a 1 _ b a s e 6 4 = " C 2 x x H 3 F o + 8 b 5 y B X V i t z 0 b 9 t D Z M s = " > A A A B 8 X i c b V D L S s N A F L 2 p r 1 p f V Z d u B o t Q N y W 1 x c e u 4 M Z l h b 6 w j W U y n b R D J 5 M w M x F K 6 F + 4 c a G I W / / G n X / j J A 2 i 1 g M X D u f c y 7 3 3 u C F n S t v 2 p 5 V b W V 1 b 3 8 h v F r a 2 d 3 b 3 i v s H H R V E k t A 2 C X g g e y 5 W l D N B 2 5 p p T n u h p N h 3 O e 2 6 0 + v E 7 z 5 Q q V g g W n o W U s f H Y 8 E 8 R r A 2 0 t 2 g O W H 3 c b l 1 O h 8 W S 3 b F T o G W S T U j J c j Q H B Y / B q O A R D 4

7 F
I v w = " > A A A B 8 X i c b V D L S s N A F L 2 p r 1 p f V Z d u B o t Q N y W 1 x c e u 6 M Z l B f v A N p b J d N I O n U z C z E Q o o X / h x o U i b v0 b d / 6 N k z S I W g 9 c O J x z L / f e 4 4 a c K W 3 b S m f 2 y S 9 Y 7 1 8 z S p g O < / l a t e x i t > Entangled strategy < l a t e x i t s h a 1 _ b a s e 6 4 = " d Q w w L Y u G o + C / C 0 w g x I x j k 2 S I e 3 w = " h 5 J 4 8 k m f y Y j 1 Y T 9 a r 9 T Z r z V j p z C 7 5 B e v 9 C z g m m B E = < / l a t e x i t > ?< l a t e x i t s h a 1 _ b a s e 6 4 = " h B / 4 h s m S q n a l B e y 2 S X d 6 P y r D y m U P 0 C 9 b 7 F 6 X o j P E = < / l a t e x i t > ?< l a t e x i t s h a 1 _ b a s e 6 4 = " h B / 4 h s m S q n a l B e y 2 S X d 6 P y r D y m U P 0 C 9 b 7 F 6 X o j P E = < / l a t e x i t > ?< l a t e x i t s h a 1 _ b a s e 6 4 = " h B / 4 h s m S q n a l B e y 2 S X d 6 P y

1 <
r D y m U P 0 C 9 b 7 F 6 X o j P E = < / l a t e x i t > S l a t e x i t s h a 1 _ b a s e 6 4 = " + i 5 n I E u 8 Q P n w s l r s O 6 z h c V U U 9 S A = " > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l s U X s r e P F Y q f 2 A N p T N d t M u 3 W z C 7 k Y o o T / B i w d F v P q L v P l v 3 K R B 1 P p g 4 P H e D D P z v I g z p W 3 7 0 y q s r W 9 s b h W 3 S z u 7 e / s H 5 c O j r g p j S W i H h D y U f Q 8 r y p m g H c 0 0 p / 1 I U h x 4 n P a 8 2 U 3 q 9 x 6 o V C w U 9 3 o e U T f A E 8 F 8 R r A 2 U r s 9 c k b B 1 P p g 4 P H e D D P z v I g z p W 3 7 0 y q s r W 9 s b h W 3 S z u 7 e / s H 5 c O j r g p j S W i H h D y U f Q 8 r y p m g H c 0 0 p / 1 I U h x 4 n P a 8 2 U 3 q 9 x 6 o V C w U 9 3 o e U T f A

3 <
4 Z g I p m 5 F Z E J l p h o k 0 4 p C + E y x f n 3 y 8 u k U 6 s 6 9 W r 9 9 q z S b O R x F O E I j u E U H G h A E 6 6 h B W 0 g M I Z H e I Y X i 1 t P 1 q v 1 t m g t W P n M I f y C 9 f 4 F 2 w S N n g = = < / l a t e x i t > I l a t e x i t s h a 1 _ b a s e 6 4 = " i H x S e b 2 t V P A c x m c r R + k 8 s t d y

S 1 < 2 <
l a t e x i t s h a 1 _ b a s e 6 4 = " + i 5 n I E u 8 Q P n w s l r s O 6 z h c V U U 9 S A = " > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l s U X s r e P F Y q f 2 A N p T N d t M u 3 W z C 7 k Y o o T / B i w d F v P q L v P l v 3 K R B 1 P p g 4 P H e D D P z v I g z p W 3 7 0 y q s r W 9 s b h W 3 S z u 7 e / s H 5 c O j r g p j S W i H h D y U f Q 8 r y p m g H c 0 0 p / 1 I U h x 4 n P a 8 2 U 3 q 9 x 6 o V C w U 9 3 o e U T f A E 8 F 8 R r A 2 U r s 9 c k b l i l 2 1 M 6 B V 4 u S k A j l a o / L H c B y S O K B C E 4 6 V G j h 2 p N 0 E S 8 0 I p 4 v S M F Y 0 w m S G J 3 R g q M A B V W 6 S n b p A Z 0 Y Z I z + U p o R G m f p z I s G B U v P A M 5 0 B 1 l P 1 1 0 v F / 7 x B r P 1 r N 2 E i i j U V Z L n I j z n S I U r / R m M m K d F 8 b g g m k p l b E Z l i i Y k 2 6 Z S y E B o p L r 9 f X i X d i 6 p T q 9 b u 6 p V m I 4 + j C C d w C u f g w B U 0 4 R Z a 0 A E C E 3 i E Z 3 i x u P V k v V p v y 9 a C l c 8 c w y 9 Y 7 1 / p V o 2 p < / l a t e x i t > S l a t e x i t s h a 1 _ b a s e 6 4 = " n A t u v R X R u E 3 m N 2 j I Q H L 6 F u H M q y o = " > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l a U X s r e P F Y q f 2 A N p T N d t M u 3 W z C 7 k Y o o T / B i w d F v P q L v P l v 3 K R B 1 P p g 4 P H e D D P z v I g z p W 3 7 0 y q s r W 9 s b h W 3 S z u 7 e / s H 5 c O j r g p j S W i H h D y U f Q 8 r y p m g H c 0 0 p / 1 I U h x 4 n P a 8 2 U 3 q 9 x 6 o V C w U 9 3 o e U T f A T b y O o p k n x y Q I 1 I j D d I k l 6 R F 2 o S R m D y S Z / J i P B h P x q v x N o 8 W j H x m j / y C 8 f 4 F f S y T u w = = < / l a t e x i t > Position-based quantum reading < l a t e x i t s h a 1 _ b a s e 6 4 = " I a Y 1 U k z a d v g R 8 7 V r o c + j I 0 w J 7 9 0 e n Y 9 p a 8 6 Z z e y j P 3 A + f w D z M 5 l v < / l a t e x i t > / < l a t e x i t s h a 1 _ b a s e 6 4 = " y Y n W x K 8 + V 3 s m H B Y n 0 5 H E 1 O 2 9 5 T g = " > A A A B 6 H i c b V D L T g J B E O z F F + I L 9 e h l I j H x h L u o 0 S O J F 4 + Q y C O B D Z k d e m F k d n Y z M 2 t C C F / g x Y P G e P W T v P k 3 D r A H B S v p p F L V n e 6 u I B F c G 9 f 9 d n J r 6 x u b W / n t w s 7 u 3 v 5 B 8 f C o q e N U M W y w W

Figure 1 .
Figure 1.Channel-position finding (CPF) schematics.CPF represents a fundamental model of pattern recognition with quantum channels.(a) Example for m = 3 subsystems.Global channels E1, E2, E3 consist of sub-channels Φ on subsystems S1, S2, S3.Each sub-channel can be chosen to be a background channel Φ (B) or a target channel Φ (T ) .Channel En (for n = 1, • • • , m) means that the target channel is applied to subsystem Sn while all the other subsystems undergo background channels.(b) The classical strategy sends coherent-state signals (red, S k ), while the entangled strategy sends signals (red, S k ) entangled with locally stored idlers (blue, I k ).(c) Bosonic applications to quantum reading of position-based data and quantum-enhanced direction finding of a remote target.Entangled pairs of signal (red) and idler (blue) are used.In position-based quantum reading, each sub-channel corresponds to a memory cell with reflectivity rB (background) or rT (target); in quantum target finding, each sub-channel corresponds to a sector on a fixed-radius sphere where a target with reflectivity η can be present or absent.If the target is absent, the returning signal is replaced by environmental noise with NB mean thermal photons per mode.

2 .
If the outcome from S n is 'T', measure all the remaining subsystems {S k } m k=n+1 in the b-POVM {Π (T ) b , Π (B) b }.If we get outcome 'T' for some S k then select the hypothesis h k .Otherwise, select h n .3. If the outcome from S n is 'B', then discard h n and repeat from point 1 with the replacement n → n + 1.If n + 1 = m, then select hypothesis h m .

3 <
h 3 C Z o f 7 1 8 l / S O T P t m l m 7 c a p N p 4 i j B I d w B C d g w w U 0 4 R p a 0 A Y C P j z A E z w b U + P R e D F e F 6 1 L R j F z A D 9 g v H 0 C k k y N f w = = < / l a t e x i t > l a t e x i t s h a 1 _ b a s e 6 4 = " s x U a k q

2 <
h 3 C Z o f 7 1 8 l / S O T P t m l m 7 c a p N p 4 i j B I d w B C d g w w U 0 4 R p a 0 A Y C P j z A E z w b U + P R e D F e F 6 1 L R j F z A D 9 g v H 0 C k k y N f w = = < / l a t e x i t > l a t e x i t s h a 1 _ b a s e 6 4 = " 9 Z b X R Z z 8 y w U 7 I G Y 5 K

Figure 2 .
Figure 2. Position-based quantum reading.Quantum advantage shown for a block of m = 100 cells and NS = 5 mean photons per mode.(a) We consider the log ratio of the error probabilities (log 10 [P QRCN /P CR H ]), between quantum reading with conditional-nulling receiver P QR CN and classical reading in the Helstrom limit P CR H .This ratio is plotted as a function of the background and target reflectivities, rB and rT , for M = 10 modes per cell.Note that since Eq.(6) is not symmetric in rB and rT , we observe asymmetric patterns.(b) Error probabilities P QR CN (black solid) and P CR H (black dashed) versus number of modes M , for reflectivities rB = 0.95 and rT = 0.9.We also include the ultimate classical benchmark given by the lower bound for classical reading P CR H,LB (gray dashed).(c) As in panel (b) but with rB = 1 and rT = 0.4.

4 <
0 j m 3 3 a p 9 c V O r N N 0 8 j i I c w T G c g g t 1 a M I 1 t K A N B A J 4 g C d 4 t q b W o / V i v S 5 b C 1 Y + c w g / Y L 1 9 A r l L j X c = < / l a t e x i t > l a t e x i t s h a 1 _ b a s e 6 4 = " S l t m N z W 0p d U B Y e X W u M / s f U h D U t k = " > A A A B 6 X i c d V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B i y G x l d p b w Y v H K v Y D 2 l A 2 2 0 2 7 d L M J u x u h h P 4 D L x 4 U 8 e o / 8 u a / c Z t G U N E H A 4 / 3 Z p i Z 5 8 e c K e 0 4 H 1 Z h Z X V t f a O 4 W dr a 3 t n d K + 8 f d F S U S E L b J O K R 7 P l Y U c 4 E b W u m O e 3 F k u L Q 5 7 T r T 6 8 W f v e e S s U i c a d n M f V C P B Y s Y A R r I 9 2 e 1 Y b l

Figure 3 .
Figure 3. Position-based quantum reading with ideal background.Quantum advantage for ideal background reflectivity (rB = 1) and considering m = 100 cells.(a) We consider the log ratio of the error probabilities (log 10 [P QR CN * /P CR H ]), between quantum reading with improved conditional-nulling receiver P QR CN * and classical reading in the Helstrom limit P CR H .This ratio is plotted as a function of the target reflectivity rT and mean photon number per mode NS for fixed M NS = 12, where M is the number of modes.(b) We show the various error probabilities, i.e., quantum reading with the improved conditional nulling receiver P QR CN * (including measurements of the idlers, gray solid), quantum reading with the conditional nulling receiver P QR CN (based on the measurement of the signals only, black solid), the classical performance P CR H (black dashed), and the ultimate classical benchmark P CR H,LB (gray dashed).These are plotted versus the number of modes M , for rT = 0.95 and NS = 5.(c) As in panel (b) but choosing parameters rT = 0.4 and NS = 5.

Figure 4 .
Figure 4. Target direction finding with classical and entangled light.We plot the error probabilities in terms of number of modes M , considering m = 50 sectors, NS = 10 −3 photons per mode, NB = 20 thermal photons per environmental mode, and η = 0.1 round-trip loss.We consider the performance of classical target finding via direct detection from Eq. (31) (CTF-DD, solid black line) and assuming the lower bound of Eq. (28) (CTF-LB, black dashed line).We then consider the performance of quantum target finding assuming the upper bound of Eq. (35) (QTF-UB, red dashed line) and via the generalized CN receiver from Eq. (37) (QTF-CN, solid red line).

Figure 5 .
Figure 5. Error probability versus number of modes M for binary quantum reading.Background and target reflectivities are respectively rB = 1 and rT = 0.4.Comparisons are done for a number of photons per mode NS = 0.1 in panel (a) and NS = 10 in panel (b).We plot the performance of the original Bell receiver [12] (solid black line), the asymptotically tight quantum Chernoff bound (QCB, solid blue line), the generalized conditional nulling receiver with performance ζ QR 1 /2 (CN, solid orange line), and the generalized conditional nulling receiver with improved performance ζ QR 1 * /2 (CN*, red dashed line).
Φ (B/T ) S k acting on cell S k .For M -mode probing of the cell, we have the target channel Φ (T ) = L N B r T ⊗M and the background channel Φ (B) = L N B r B ⊗M , where L N B r is a single-mode thermal-loss channel with reflectivity r and thermal noise N B .
(k ) n e iθ (k ) n and covariance matrix (2E T +1)I; the background state (ρ C B ) S k is a product of other M displaced thermal states, each with amplitude µ B x (k ) k e iθ (k ) k and covariance matrix (2E B + 1)I.