We study quantum hypothesis testing between orthogonal states under restricted local measurements in the many-copy scenario. For testing arbitrary multipartite entangled pure state against its orthogonal complement state via the local operation and classical communication (LOCC) operation, we prove that the optimal average error probability always decays exponentially in the number of copies. Second, we provide a sufficient condition for the LOCC operations to achieve the same performance as the positive-partial-transpose (PPT) operations. We further show that testing a maximally entangled state against its orthogonal complement and testing extremal Werner states both fulfill the above-mentioned condition. Hence, we determine the explicit expressions for the optimal average error probability, the optimal trade-off between the type-I and type-II errors, and the associated Chernoff, Stein, Hoeffding, and strong converse exponents.
Then, we show an infinite asymptotic separation between the separable (SEP) and PPT operations by providing a pair of states constructed from an unextendible product basis (UPB). The quantum states can be distinguished perfectly by PPT operations, while the optimal error probability, with SEP operations, admits an exponential lower bound. On the technical side, we prove this result by providing a quantitative version of the well-known statement that the tensor product of UPBs is a UPB.
We focus on the non-locality concerning local copying and local discrimination, especially for a set of orthogonal maximally entangled states in prime dimensional systems, as a study of non-locality of a set of states. As a result, for such a set, we completely characterize deterministic local copiability and show that local copying is more difficult than local discrimination. From these result, we can conclude that lack algebraic symmetry causes extra non-locality of a set.
We demonstrate an optical receiver that achieves the quantum Chernoff bound for discriminating coherent states from thermal states in the multi-copy scenario. In contrast, we find that repeated use of the receiver approaching the Helstrom bound for single-copy measurement is sub-optimal in this multi-copy case. Furthermore, for a large class of multi-copy discrimination tasks between a pure and a mixed state, we prove that any Helstrom-bound achieving single-copy receiver is suboptimal by a factor of at least two in error-probability exponent compared to the multi-copy quantum Chernoff bound. …
Multiple-copy state discrimination is a fundamental task in quantum information processing. If there are two, pure, non-orthogonal states then both local and collective schemes are known to reach the Helstrom bound, the maximum probability of successful discrimination allowed by quantum theory. For mixed states, it is known that only collective schemes can perform optimally, so it might be expected that these schemes are more resilient to preparation noise. We calculate the probability of success for two schemes, one local and one collective, in the regime of imperfect preparation fidelity. We…
We consider the problem of discriminating between two quantum coherent states by interpreting a single state like being a collection of several successive copies of weaker coherent states. By means of recent results on multiple-copy state discrimination, it is possible to give a reinterpretation of the Dolinar receiver, and carry out a quite straightforward analysis of its behavior. We also propose and investigate a suboptimal detection scheme derived from the Dolinar's architecture, which is shown to slightly outperform some other near-optimal schemes available in literature.
There are two common settings in a quantum-state discrimination problem. One is minimum-error discrimination where a wrong guess (error) is allowed and the discrimination success probability is maximized. The other is unambiguous discrimination where errors are not allowed but the inconclusive result "I don't know" is possible. We investigate discrimination problem with a finite margin imposed on the error probability. The two common settings correspond to the error margins 1 and 0. For arbitrary error margin, we determine the optimal discrimination probability for two pure states with equal o…
We investigate optimal discrimination between two projective quantum measurements on a single qubit. We consider scenario where the measurement that should be identified can be performed twice and we show that adaptive discrimination strategy, entangled probe states, and feed-forward all help to increase the probability of correct identification of the measurement. We also experimentally demonstrate the studied discrimination strategies and test their performance. The employed experimental setup involves projective measurements on polarization states of single photons and preparation of requir…
Ensembles of composite quantum states can exhibit nonlocal behaviour in the sense that their optimal discrimination may require global operations. Such an ensemble containing N pairwise orthogonal pure states, however, can always be perfectly distinguished under adaptive local scheme if (N-1) copies of the state are available. In this letter, we provide examples of orthonormal bases in two-qubit Hilbert space whose adaptive discrimination require 3 copies of the state. For this composite system we analyze multi-copy adaptive local distinguishability of orthogonal ensembles in full generality w…
We address the problem of non-orthogonal two-state discrimination when multiple copies of the unknown state are available. We give the optimal strategy when only fixed individual measurements are allowed and show that its error probability saturates the collective (lower) bound asymptotically. We also give the optimal strategy when adaptivity of individual von Neumann measurements is allowed (which requires classical communication), and show that the corresponding error probability is exactly equal to the collective one for any number of copies. We show that this strategy can be regarded as Ba…
In the quantum system, perfect copying is impossible without prior knowledge. But, perfect copying is possible, if it is known that unknown states to be copied is contained by the set of orthogonal states, which is called the copied set. However, if our operation is limited to local operations and classical communications, this problem is not trivial. Recently, F. Anselmi, A. Chefles and M.B. Plenio constructed theory of local copying when the copied set consists of maximally entangled states. They also classified the copied set when it consists of two orthogonal states (New. J. Phys. 6, 164 (…
Quantum state discrimination is a fundamental primitive in quantum statistics where one has to correctly identify the state of a system that is in one of two possible known states. A programmable discrimination machine performs this task when the pair of possible states is not a priori known, but instead the two possible states are provided through two respective program ports. We study optimal programmable discrimination machines for general qubit states when several copies of states are available in the data or program ports. Two scenarios are considered: one in which the purity of the possi…
The discrimination between two unknown states can be performed by a universal programmable discriminator, where the copies of the two possible states are stored in two program systems respectively and the copies of data, which we want to confirm, are provided in the data system. In the present paper, we propose a group-theretic approach to the multi-copy programmable state discrimination problem. By equivalence of unknown pure states to known mixed states and with the representation theory of U(n) group, we construct the Jordan basis to derive the analytical results for both the optimal unambi…
We address the one-dimensional quantum Ising model as an example of system exhibiting criticality and study in some details the discrimination problem for pairs of states corresponding to different values of the coupling constant. We evaluate the error probability for single-copy discrimination, the Chernoff bound for $n$-copy discrimination in the asymptotic limit, and the Chernoff metric for the discrimination of infinitesimally close states. We point out scaling properties of the above quantities, and derive the external field optimizing state discrimination for short chains as well as in t…
We consider discriminating between bipartite boxes with 2 binary inputs and 2 binary outputs (2x2) using the class of completely locality preserving operations i.e. those, which transform boxes with local hidden variable model (LHVM) into boxes with LHVM, and have this property even when tensored with identity operation. Following approach developed in entanglement theory we derive linear program which gives an upper bound on the probability of success of discrimination between different isotropic boxes. In particular we provide an upper bound on the probability of success of discrimination be…
We theoretically investigate schemes to discriminate between two nonorthogonal quantum states given multiple copies. We consider a number of state discrimination schemes as applied to nonorthogonal, mixed states of a qubit. In particular, we examine the difference that local and global optimization of local measurements makes to the probability of obtaining an erroneous result, in the regime of finite numbers of copies $N$, and in the asymptotic limit as $N \rightarrow \infty$. Five schemes are considered: optimal collective measurements over all copies, locally optimal local measurements in a…
This paper constructs a LOCC protocol that achieves the global optimality in conclusive discrimination of any two states with arbitrary a priori probability. This can be interpreted that there is no ``non-locality'' in the conclusive discrimination of two multipartite states.
Bell's theorem depends crucially on counterfactual reasoning, and is mistakenly interpreted as ruling out a local explanation for the correlations which can be observed between the results of measurements performed on spatially-separated quantum systems. But in fact the Everett interpretation of quantum mechanics, in the Heisenberg picture, provides an alternative local explanation for such correlations. Measurement-type interactions lead, not to many worlds but, rather, to many local copies of experimental systems and the observers who measure their properties. Transformations of the Heisenbe…
Motivated by the recent discovery of a quantum Chernoff theorem for asymptotic state discrimination, we investigate the distinguishability of two bipartite mixed states under the constraint of local operations and classical communication (LOCC), in the limit of many copies. While for two pure states a result of Walgate et al. shows that LOCC is just as powerful as global measurements, data hiding states (DiVincenzo et al.) show that locality can impose severe restrictions on the distinguishability of even orthogonal states. Here we determine the optimal error probability and measurement to dis…
In this paper, we consider the LOCC distinguishability of product states. We employ polygons to analyze orthogonal product states in any system to show that with LOCC protocols, to distinguish seven orthogonal product states, one can exclude four states via a single copy. In bipartite systems, this result implies that N orthogonal product states are LOCC distinguishable if $\left \lceil \frac{N}{4} \right \rceil$ copies are allowed, where $\left \lceil l\right \rceil$ for a real number $l$ means the smallest integer not less than $l$. In multipartite systems, this result implies that N orthogo…
We consider one copy of a quantum system prepared in one of two non-orthogonal pure product states of multipartite distributed among separated parties. We show that there exist protocols which obtain optimal probability in the sense of conclusive discrimination by means of local operations and classical communications(LOCC) as good as by global operations. Also, we show a protocol which minimezes the average number of local operations. Our result implies that two product pure multipartite states might not have the non-local property though more than two can have.
Power and Limits of Collective Local Measurements in Multicopy State Discrimination
School of Mathematics, South China University of Technology(华南理工大学数学学院);School of Computer Science and Technology, Dongguan University of Technology(东莞理工学院计算机科学与技术学院)
This expository article gives an overview of the theory of hypothesis testing of quantum states in finite dimensional Hilbert spaces. Optimal measurement strategy for testing binary quantum hypotheses, which result in minimum error probability, is discussed. Collective and individual adaptive measurement strategies in testing hypotheses in the multiple copy scenario, with various upper and lower bounds on error probability, are outlined. A brief account on quantum channel discrimination and the role of entangled states in achieving enhanced precision in the task of channel discrimination is gi…
We consider one copy of a quantum system prepared with equal prior probability in one of two non-orthogonal entangled states of multipartite distributed among separated parties. We demonstrate that these two states can be optimally distinguished in the sense of conclusive discrimination by local operations and classical communications(LOCC) alone. And this proves strictly the conjecture that Virmani et.al. [8] confirmed numerically and analytically. Generally, the optimal protocol requires local POVM operations which are explicitly constructed. The result manifests that the distinguishable inf…
The quantum state discrimination problem is to distinguish between non-orthogonal quantum states. This problem has many applications in quantum information theory, quantum communication and quantum cryptography. In this paper a quantum algorithm using weak measurement and partial negation will be proposed to solve the quantum state discrimination problem using a single copy of an unknown qubit. The usage of weak measurement makes it possible to reconstruct the qubit after measurement since the superposition will not be destroyed due to measurement. The proposed algorithm will be able to determ…
We present theory and experiment for the task of discriminating two nonorthogonal states, given multiple copies. We implement several local measurement schemes, on both pure states and states mixed by depolarizing noise. We find that schemes which are optimal (or have optimal scaling) without noise perform worse with noise than simply repeating the optimal single-copy measurement. Applying optimal control theory, we derive the globally optimal local measurement strategy, which outperforms all other local schemes, and experimentally implement it for various levels of noise.
We provide rigorous, efficiently computable and tight bounds on the average error probability of multiple-copy discrimination between qubit mixed states by Local Operations assisted with Classical Communication (LOCC). In contrast to the pure-state case, these experimentally feasible protocols perform strictly worse than the general collective ones. Our numerical results indicate that the gap between LOCC and collective error rates persists in the asymptotic limit. In order for LOCC and collective protocols to achieve the same accuracy, the former requires up to twice the number of copies of t…
In this paper we consider the conditions under which a given ensemble of two-qubit states can be optimally distinguished by local operations and classical communication (LOCC). We begin by completing the \emph{perfect} distinguishability problem of two-qubit ensembles - both for separable operations and LOCC - by providing necessary and sufficient conditions for the perfect discrimination of one pure and one mixed state. Then for the well-known task of minimum error discrimination, it is shown that \textit{almost all} two-qubit ensembles consisting of three pure states cannot be optimally disc…
We first present a protocol for deterministically distilling non-locality, building upon a recent result of Forster et al. [Phys. Rev. Lett. 102, 120401 (2009)]. Our protocol, which is optimal for two-copy distillation, works efficiently for a specific class of post-quantum non-local boxes, which we term correlated non-local boxes. In the asymptotic limit, all correlated non-local boxes are distilled to the maximally non-local box of Popescu and Rohrlich. Then, taking advantage of a result of Brassard \textit{et al.} [Phys. Rev. Lett. 96, 250401 (2006)] we show that all correlated non-local bo…
The observation of the non-local properties of multipartite entangled states is of great importance for quantum information protocols. Such properties, however, are fragile and may not be observed in the presence of decoherence exhibited by practical physical systems. In this work, we investigate the robustness of the non-locality of symmetric states experiencing phase and amplitude damping, using suitable Bell inequalities based on an extended version of Hardy's paradox. We derive thresholds for observing non-locality in terms of experimental noise parameters, and demonstrate the importance o…
Oblivious transfer, a central functionality in modern cryptography, allows a party to send two one-bit messages to another who can choose one of them to read, remaining ignorant about the other, whereas the sender does not learn the receiver's choice. Oblivious transfer the security of which is information-theoretic for both parties is known impossible to achieve from scratch. - The joint behavior of certain bi-partite quantum states is non-local, i.e., cannot be explained by shared classical information. In order to better understand such behavior, which is classically explainable only by com…
In $2 \otimes 2$, more than 2 orthogonal Bell states with single copy can never be discriminated with certainty if only local operations and classical communication (LOCC) are allowed. More than $d$ orthogonal maximally entangled states in $d \otimed d$, which are in cannonical form, used by Bennett et. al. [Phys. Rev. Lett. 70 (1993) 1895] can never be discriminated with certainty when a single copy of the states is provided. Interestingly we show that all orthogonal maximally entangled states, which are in cannonical form, can be discriminated with certainty if and only if two copies of each…
Multipartite nonlocality in a network is conceptually different from standard multipartite Bell nonlocality. In recent times, network nonlocality has been studied for various topologies. We consider a linear-chain topology of the network and demonstrate the quantum nonlocality (the non-$n$-locality). Such a network scenario involves $n$ number of independent sources and $n+1$ parties, two edge parties (Alice and Charlie), and $n-1$ central parties (Bobs). It is commonly assumed that each party receives only two inputs. In this work, we consider a generalized scenario where the edge parties rec…
Standard multiparty Bell experiments involve a single source shared by a set of observers. In contrast, network Bell experiments feature multiple independent sources, and each of them may distribute physical systems to a set of observers who perform randomly chosen measurements. The $n$-locality scenario in star-network configuration involves $n$ number of edge observers (Alices), a central observer (Bob), and $n$ number of independent sources having no prior correlation. Each Alice shares an independent state with the central observer Bob. Usually, in network Bell experiments, one considers t…
Suppose we want to identify an input state with one of two unknown reference states, where the input state is guaranteed to be equal to one of the reference states. We assume that no classical knowledge of the reference states is given, but a certain number of copies of them are available instead. Two reference states are independently and randomly chosen from the state space in a unitary invariant way. This is called the quantum state identification problem, and the task is to optimize the mean identification success probability. In this paper, we consider the case where each reference state …
Coherent states of light, and methods for distinguishing between them, are central to all applications of laser light. We obtain the ultimate quantum limit on the error probability exponent for discriminating among any M multimode coherent-state waveforms via the quantum Chernoff exponent in M-ary multi-copy state discrimination. A receiver, i.e., a concrete realization of a quantum measurement, called the Sequential Waveform Nulling (SWN) receiver, is proposed for discriminating an arbitrary coherent-state ensemble using only auxiliary coherent-state fields, beam splitters, and non-number-res…
Laser light is widely used for communication and sensing applications, so the optimal discrimination of coherent states--the quantum states of light emitted by a laser--has immense practical importance. However, quantum mechanics imposes a fundamental limit on how well different coher- ent states can be distinguished, even with perfect detectors, and limits such discrimination to have a finite minimum probability of error. While conventional optical receivers lead to error rates well above this fundamental limit, Dolinar found an explicit receiver design involving optical feedback and photon c…
State-dependent cloning machines that have so far been considered either deterministically copy a set of states approximately, or probablistically copy them exactly. In considering the case of two equiprobable pure states, we derive the maximum global fidelity of $N$ approximate clones given $M$ initial exact copies, where $N>M$. We also consider strategies which interpolate between approximate and exact cloning. A tight inequality is obtained which expresses a trade-off between the global fidelity and success probability. This inequality is found to tend, in the limit as $N{\to}{\infty}$, to …
We consider a general version of the phenomenon of more nonlocality with less entanglement, within the framework of the unambiguous (i.e., conclusive) quantum state discrimination problem under local quantum operations and classical communication. We show that although the phenomenon was obtained before for two qutrits, it can also be observed for two qubits, while still being at the single-copy level. We establish that the phenomenon is intrinsically connected to the concept of unextendible entangled bases, in the two-qubit case. In the process, we demonstrate a hierarchy of nonlocality among…
We consider online strategies for discriminating between symmetric pure states with zero error when $n$ copies of the states are provided. Optimized online strategies involve local, possibly adaptive measurements on each copy and are optimal at each step, which makes them robust in front of particle losses or an abrupt termination of the discrimination process. We first review previous results on binary minimum and zero error discrimination with local measurements that achieve the maximum success probability set by optimizing over global measurements, highlighting their online features. We the…
We investigate performances of pure continuous variable states in discriminating thermal and identity channels by comparing their M-copy error probability bounds. This offers us a simplified mathematical analysis for quantum target detection with slightly modified features: the object -- if it is present -- perfectly reflects the signal beam irradiating it, while thermal noise photons are returned to the receiver in its absence. This model facilitates us to obtain analytic results on error-probability bounds i.e., the quantum Chernoff bound and the lower bound constructed from the Bhattacharya…
Operational interpretation of the reverse sandwiched Renyi divergences in composite quantum hypothesis testing
School of Data Science, The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳)数据科学学院);International Quantum Academy(国际量子学院);Graduate School of Mathematics, Nagoya University(名古屋大学大学院数学研究科)
Rényi divergences and binary state discrimination error exponents for fermionic quasi-free states
HUN-REN Wigner Research Centre for Physics(匈牙利科学院维格纳物理研究中心);Department of Analysis and Operations Research, Institute of Mathematics, Budapest University of Technology and Economics(布达佩斯科技大学数学研究所分析与运筹学系)