Discrimination between unknown processes chosen from a finite set is experimentally shown to be possible even in the case of non-orthogonal processes. We demonstrate unambiguous deterministic quantum process discrimination (QPD) of non-orthogonal processes using properties of entanglement, additional known unitaries, or higher dimensional systems. Single qubit measurement and unitary processes and multipartite unitaries (where the unitary acts non-separably across two distant locations) acting on photons are discriminated with a confidence of $\geq97%$ in all cases.
The problem of quantum state discrimination, which is a foundational aspect of quantum information theory, and its relation to the theory of majorization are discussed. The purpose of this study is to review different approaches to the problem and analyze different cases of quantum-state discrimination, most importantly the discrimination of bipartite entangled quantum states under local operations and classical communication. Two partial results on using entanglement as a resource for quantum-state discrimination and discrimination with remaining entanglement is given. The important points ar…
Roa et al. showed that quantum state discrimination between two nonorthogonal quantum states does not require quantum entanglement but quantum dissonance only. We find that quantum coherence can also be utilized for unambiguous quantum state discrimination. We present a protocol and quantify the required coherence for this task. We discuss the optimal unambiguous quantum state discrimination strategy in some cases. In particular, our work illustrates an avenue to find the optimal strategy for discriminating two nonorthogonal quantum states by measuring quantum coherence.
We propose a numerical algorithm for finding optimal measurements for quantum-state discrimination. The theory of the semidefinite programming provides a simple check of the optimality of the numerically obtained results.
We quantify the usefulness of a bipartite quantum state in the ancilla-assisted channel discrimination of arbitrary quantum channels, formally defining a worst-case-scenario channel discrimination power for bipartite quantum states. We show that such a quantifier is deeply connected with the operator Schmidt decomposition of the state. We compute the channel discrimination power exactly for pure states, and provide upper and lower bounds for general mixed states. We show that highly entangled states can outperform any state that passes the realignment criterion for separability. Furthermore, w…
We consider quantum-memory assisted protocols for discriminating quantum channels. We show that for optimal discrimination of memory channels, memory assisted protocols are needed. This leads to a new notion of distance for channels with memory. For optimal discrimination and estimation of sets of unitary channels memory-assisted protocols are not required.
We show that quantum state discrimination sits neatly in the framework of Bayesian experimental design. In this setting, the two main branches of quantum state discrimination (minimal error and maximal confidence) simply correspond to two different utility functions. This view allows straightforward extensions and mixing of different discrimination tasks by examining the utility functions, and to describe multi-objective discrimination tasks. In addition, the probability of success and the total confidence are resource monotones quantifying the usefulness of measurements. We give general condi…
The discrimination of quantum measurements is an important subject of quantum information processes. In this paper we present a novel protocol for local quantum measurement discrimination with multi-qubit entanglement systems. It is shown that, in the case of Bob did not know Alice's result of measurement, if both two observers (Alice and Bob) agreed in advance that Alice should measure her qubits before an appointed time t, the local discrimination of two different kinds of measurement can be completed via numerous eight-qubit GHZ entangled states and selective projective measurement.
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 present a general scheme to realize the POVMs for the unambiguous discrimination of quantum states. For any set of pure states it enables us to set up a feasible linear optical circuit to perform their optimal discrimination, if they are prepared as single-photon states. An example of unknown states discrimination is discussed as the illustration of the general scheme.
We consider the unambiguous discrimination of multipartite quantum states and provide an upper bound for the maximum success probability of optimal local discrimination. We also provide a necessary and sufficient condition to realize the upper bound. We further establish a necessary and sufficient condition for this upper bound to be saturated. Finally, we illustrate our results using examples in multidimensional multipartite quantum systems.
We address the problem of unambiguous discrimination and identification among quantum observables. We set a general framework and investigate in details the case of qubit observables. In particular, we show that perfect discrimination with two shots is possible only for sharp qubit observables (e.g. Stern-Gerlach apparatuses) associated with mutually orthogonal directions. We also show that for sharp qubit observables associated to nonorthogonal directions unambiguous discrimination with an inconclusive result is always possible.
We consider two different optimized measurement strategies for the discrimination of nonorthogonal quantum states. The first is conclusive discrimination with a minimum probability of inferring an erroneous result, and the second is unambiguous, i. e. error-free, discrimination with a minimum probability of getting an inconclusive outcome, where the measurement fails to give a definite answer. For distinguishing between two mixed quantum states, we investigate the relation between the minimum error probability achievable in conclusive discrimination, and the minimum failure probability that ca…
We propose a generalized discrimination scheme for mixed quantum states. In the present scenario we allow for certain fixed fraction of inconclusive results and we maximize the success rate of the quantum-state discrimination. This protocol interpolates between the Ivanovic-Dieks-Peres scheme and the Helstrom one. We formulate the extremal equations for the optimal positive operator valued measure describing the discrimination device and establish a criterion for its optimality. We also devise a numerical method for efficient solving of these extremal equations.
We study the discrimination of multipartite quantum states by local operations and classical communication. We derive that any optimal discrimination of quantum states spanning a two-dimensional Hilbert space in which each party's space is finite dimensional is possible by local operations and one-way classical communication, regardless of the optimality criterion used and how entangled the states are.
We formulate minimum-error and unambiguous discrimination problems for quantum processes in the language of process positive operator valued measures (PPOVM). In this framework we present the known solution for minimum-error discrimination of unitary channels. We derive a "fidelity-like" lower bound on the failure probability of the unambiguous discrimination of arbitrary quantum processes. This bound is saturated (in a certain range of apriori probabilities) in the case of unambiguous discrimination of unitary channels. Surprisingly, the optimal solution for both tasks is based on the optimiz…
Quantum Stochastic Walks (QSW) allow for a generalization of both quantum and classical random walks by describing the dynamic evolution of an open quantum system on a network, with nodes corresponding to quantum states of a fixed basis. We consider the problem of quantum state discrimination on such a system, and we solve it by optimizing the network topology weights. Finally, we test it on different quantum network topologies and compare it with optimal theoretical bounds.
We address the problem of discriminating with minimal error probability two given quantum operations. We show that the use of entangled input states generally improves the discrimination. For Pauli channels we provide a complete comparison of the optimal strategies where either entangled or unentangled input states are used.
We address the problem of unambiguous discrimination among a given set of quantum operations. The necessary and sufficient condition for them to be unambiguously distinguishable is derived in the cases of single use and multiple uses respectively. For the latter case we explicitly construct the input states and corresponding measurements that accomplish the task. It is found that the introduction of entanglement can improve the discrimination.
Quantum mechanics forbids deterministic discrimination among non-orthogonal states. Nonetheless, the capability to distinguish nonorthogonal states unambiguously is an important primitive in quantum information processing. In this work, we experimentally implement generalized measurements in an optical system and demonstrate the first optimal unambiguous discrimination between three nonorthogonal states, with a success rate of 55%, to be compared with the 25% maximum achievable using projective measurements. Furthermore we present the first realization of unambiguous discrimination between a p…
We give a lower bound on the probability of error in quantum state discrimination. The bound is a weighted sum of the pairwise fidelities of the states to be distinguished.
Nonlocality without entanglement(NLWE) is a nonlocal phenomenon that occurs in quantum state discrimination of multipartite separable states. In the discrimination of orthogonal separable states, the term NLWE is used when the quantum states cannot be discriminated perfectly by local operations and classical communication. In this case, the occurrence of NLWE is independent of nonzero prior probabilities of quantum states being prepared. Recently, it has been found that the occurrence of NLWE can depend on nonzero prior probabilities in minimum-error discrimination of nonorthogonal separable s…
One of the most fundamental results in quantum information theory is that no measurement can perfectly discriminate between non-orthogonal quantum states. In this work, we investigate quantum advantages for discrimination tasks over noncontextual theories by considering a maximum confidence measurement that unifies different strategies of quantum state discrimination, including minimum-error and unambiguous discrimination. We first show that maximum confidence discrimination, as well as unambiguous discrimination, contains contextual advantages. We then consider a semi-device independent scena…
Discriminating between orthogonal quantum systems without destroying their entanglement is of interest to quantum computation and communication. In this paper, we explicate the schemes for the non-destructive discrimination (NDD) of 16 orthogonal four qubit cluster states and 32 orthogonal five qubit cluster states respectively. This technique will find its applications in various branches of quantum information theory.
We consider the optimal discrimination of bipartite quantum states and provide an upper bound for the maximum success probability of optimal local discrimination. We also provide a necessary and sufficient condition for a measurement to realize the upper bound. We further establish a necessary and sufficient condition for this upper bound to be saturated. Finally, we illustrate our results using an example.
The need of discriminating between different quantum states is a fundamental issue in Quantum Information and Communication. The actual realization of generally optimal strategies in this task is often limited by the need of supplemental resources and very complex receivers. We have experimentally implemented two discrimination schemes in a minimum-error scenario based on a receiver featured by a network structure and a dynamical processing of information. The first protocol implemented in our experiment, directly inspired to a recent theoretical proposal, achieves binary optimal discriminatio…
We study discrimination of m quantum measurements in the scenario when the unknown measurement with n outcomes can be used only once. We show that ancilla-assisted discrimination procedures provide a nontrivial advantage over simple (ancilla-free) schemes for perfect distinguishability and we prove that inevitably m <= n. We derive necessary and sufficient conditions of perfect distinguishability of general binary measurements. We show that the optimization of the discrimination of projective qubit measurements and their mixtures with white noise is equivalent to the discrimination of specific…
There are fundamental limits to the accuracy with which one can determine the state of a quantum system. I give an overview of the main approaches to quantum state discrimination. Several strategies exist. In quantum hypothesis testing, a quantum system is prepared in a member of a known, finite set of states, and the aim is to guess which one with the minimum probability of error. Error free discrimination is also sometimes possible, if we allow for the possibility of obtaining inconclusive results. If no prior information about the state is provided, then it is impractical to try to determin…
In this paper, we introduce a mixed form of ambiguous and unambiguous quantum state discriminations, and show that the mixed form has higher success probability than the unambiguous quantum state discriminations.
We provide a simple example that illustrates the advantage of adaptive over non-adaptive strategies for quantum channel discrimination. In particular, we give a pair of entanglement-breaking channels that can be perfectly discriminated by means of an adaptive strategy that requires just two channel evaluations, but for which no non-adaptive strategy can give a perfect discrimination using any finite number of channel evaluations.
An algorithm based on quantum phase estimation, which discriminates quantum states nondestructively within a set of arbitrary orthogonal states, is described and experimentally verified by a NMR quantum information processor. The procedure is scalable and can be applied to any set of orthogonal states. Scalability is demonstrated through Matlab simulation.
Strategies to optimally discriminate between quantum states are critical in quantum technologies. We present an experimental demonstration of minimum error discrimination between entangled states, encoded in the polarization of pairs of photons. Although the optimal measurement involves projecting onto entangled states, we use a result of Walgate et al. to design an optical implementation employing only local polarization measurements and feed-forward, which performs at the Helstrom bound. Our scheme can achieve perfect discrimination of orthogonal states and minimum error discrimination of no…
The phenomenon of nonlocality without entanglement(NLWE) arises in discriminating multi-party quantum separable states. Recently, it has been found that the post-measurement information about the prepared subensemble can lock or unlock NLWE in minimum-error discrimination of non-orthogonal separable states. Thus, it is natural to ask whether the availability of the post-measurement information can influence on the occurrence of NLWE even in other state-discrimination strategies. Here, we show that the post-measurement information can be used to lock as well as unlock the occurrence of NLWE in …
We derive general discrimination of quantum states chosen from a certain set, given initial $M$ copies of each state, and obtain the matrix inequality, which describe the bound between the maximum probability of correctly determining and that of error. The former works are special cases of our results.
We investigate optimal discrimination between two projective single-qubit measurements in a scenario where the measurement can be performed only once. We consider general setting involving a tunable fraction of inconclusive outcomes and we prove that the optimal discrimination strategy requires an entangled probe state for any nonzero rate of inconclusive outcomes. We experimentally implement this optimal discrimination strategy for projective measurements on polarization states of single photons. Our setup involves a real-time electrooptical feed-forward loop which allows us to fully harness …
We introduce and study norms in the space of hermitian operators, obtained from base norms in positively generated subspaces. These norms are closely related to discrimination of so-called generalized quantum channels, including quantum states, channels and networks. We further introduce generalized quantum decision problems and show that the maximal average payoff of decision procedures is again given by these norms. We also study optimality of decision procedures, in particular, we obtain a necessary and sufficient condition under which an optimal 1-tester for discrimination of quantum chann…
Distinguishing different quantum states is a fundamental task having practical applications for information processing. Despite the efforts devoted so far, however, strategies for optimal discrimination are known only for specific examples. We here consider the problem of minimum-error quantum state discrimination where the average error is attempted to be minimized. We show the general structure of minimum-error state discrimination as well as useful properties to derive analytic solutions. Based on the general structure, we present a geometric formulation of the problem, which can be applied…
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…
Quantum state discrimination underlies various applications in quantum information processing tasks. It essentially describes the distinguishability of quantum systems in different states, and the general process of extracting classical information from quantum systems. It is also useful in quantum information applications, such as the characterisation of mutual information in cryptographic protocols, or as a technique to derive fundamental theorems in quantum foundations. It has deep connections to physical principles such as relativistic causality. Quantum state discrimination traces a long …
We solve the problem of quantum state discrimination with "general (symmetric) figures of merit" for an even number of symmetric quantum bits with use of the no-signaling principle. It turns out that conditional probability has the same form for any figure of merit. Optimal measurement and corresponding conditional probability are the same for any monotonous figure of merit.
Unambiguous discrimination and exact cloning reduce the square-overlap between quantum states, exemplifying the more general type of procedure we term state separation. We obtain the maximum probability with which two equiprobable quantum states can be separated by an arbitrary degree, and find that the established bounds on the success probabilities for discrimination and cloning are special cases of this general bound. The latter also gives the maximum probability of successfully producing N exact copies of a quantum system whose state is chosen secretly from a known pair, given M initial re…
Distinguishing physical processes is one of the fundamental problems in quantum physics. Although distinguishability of quantum preparations and quantum channels have been studied considerably, distinguishability of quantum measurements remains largely unexplored. We investigate the problem of single-shot discrimination of quantum measurements using two strategies, one based on single quantum systems and the other one based on entangled quantum systems. First, we formally define both scenarios. We then construct sets of measurements (including non-projective) in arbitrary finite dimensions tha…
A fundamental problem in Quantum Information Processing is the discrimination amongst a set of quantum states of a system. In this paper, we address this problem on an open quantum system described by a graph, whose evolution is defined by a Quantum Stochastic Walk. In particular, the structure of the graph mimics those of neural networks, with the quantum states to discriminate encoded on input nodes and with the discrimination obtained on the output nodes. We optimize the parameters of the network to obtain the highest probability of correct discrimination. Numerical simulations show that af…
We provide a general framework of utilizing the no-signaling principle in derivation of the guessing probability in the minimum-error quantum state discrimination. We show that, remarkably, the guessing probability can be determined by the no-signaling principle. This is shown by proving that in the semidefinite programming for the discrimination, the optimality condition corresponds to the constraint that quantum theory cannot be used for a superluminal communication. Finally, a general bound to the guessing probability is presented in a closed form.
We investigate the performance of discrimination strategy in the comparison task of known quantum states. In the discrimination strategy, one infers whether or not two quantum systems are in the same state on the basis of the outcomes of separate discrimination measurements on each system. In some cases with more than two possible states, the optimal strategy in minimum-error comparison is that one should infer the two systems are in different states without any measurement, implying that the discrimination strategy performs worse than the trivial "no-measurement" strategy. We present a suffic…
In this paper we present the solution to the problem of optimally discriminating among quantum states, i.e., identifying the states with maximum probability of success when a certain fixed rate of inconclusive answers is allowed. By varying the inconclusive rate, the scheme optimally interpolates between Unambiguous and Minimum Error discrimination, the two standard approaches to quantum state discrimination. We introduce a very general method that enables us to obtain the solution in a wide range of cases and give a complete characterization of the minimum discrimination error as a function o…
Using the necessary and sufficient conditions, minimum error discrimination among two sets of similarity transformed equiprobable quantum qudit states is investigated. In the case that the unitary operators are generating sets of two irreducible representations, the optimal set of measurements and the corresponding maximum success probability of discrimination are determined in closed form. In the case of reducible representations, there exists no closed-form formula in general, but the procedure can be applied in each case accordingly. Finally, we give the maximum success probability of optim…
