Discrimination task is treated in the case of only partial prior information from measurements of unknown states. The construction of the optimal discrimination device and estimation of unknown states is performed simultaneously. A communication through a noisy quantum channel is formulated in terms of the proposed discrimination protocol.
We address perfect discrimination of two separable states. When available states are restricted to separable states, we can theoretically consider a larger class of measurements than the class of measurements allowed in quantum theory. The framework composed of the class of separable states and the above extended class of measurements is a typical example of general probabilistic theories. In this framework, we give a necessary and sufficient condition to discriminate two separable pure states perfectly. In particular, we derive measurements explicitly to discriminate two separable pure states…
Distinguishability is a fundamental and operational task generally connected to information applications. In quantum information theory, from the postulates of quantum mechanics it often has an intrinsic limitation, which then dictates and also characterises capabilities of related information tasks. In this work, we consider discrimination between bipartite two-qubit unitary transformations by local operations and classical communication (LOCC) and its relations to entangling capabilities of given unitaries. We show that a pair of entangling unitaries which do not contain local parts, if they…
It is shown that while entanglement remains a significant factor in discriminating a set of mutually orthogonal entangled states perfectly by local operations and classical communication (LOCC), entanglement content is not. In particular, for a class of entangled multi-qubit states, the maximum number of perfectly LOCC distinguishable orthogonal states is shown to be independent of the average entanglement of the states, and the spatial configuration with respect to which LOCC operations may be carried out. It is also pointed out that the make-up of an ensemble, that is, whether it consists on…
The intrinsic idea of superdense coding is to find as many gates as possible such that they can be perfectly discriminated. In this paper, we consider a new scheme of discrimination of quantum gates, called ancilla-assisted discrimination, in which a set of quantum gates on a $d-$dimensional system are perfectly discriminated with assistance from an $r-$dimensional ancilla system. The main contribution of the present paper is two-fold: (1) The number of quantum gates that can be discriminated in this scheme is evaluated. We prove that any $rd+1$ quantum gates cannot be perfectly discriminated …
We show that there exist sets of three mutually orthogonal $d$-dimensional maximally entangled states which cannot be perfectly distinguished using one-way local operations and classical communication (LOCC) for arbitrarily large values of $d$. This contrasts with several well-known families of maximally entangled states, for which any three states can be perfectly distinguished. We then show that two-way LOCC is sufficient to distinguish these examples. We also show that any three mutually orthogonal $d$-dimensional maximally entangled states can be perfectly distinguished using measurements …
In this work we relate the well-known no-go theorem that two non-orthogonal (mixed) quantum states cannot be perfectly discriminated, to the general principle in physics, the no-signalling condition. In fact, we derive the minimum error in discrimination between two quantum states, using the no-signalling condition.
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.
We prove that the states secretly chosen from a mixed state set can be perfectly discriminated if and only if these states are orthogonal. The sufficient and necessary condition when nonorthogonal quantum mixed states can be unambiguously discriminated is also presented. Furthermore, we derive a series of lower bounds on the inconclusive probability of unambiguous discrimination of states from a mixed state set with \textit{a prior} probabilities.
In this paper, we address the problem of discriminating two given quantum operations. Firstly, based on the Bloch representation of single qubit systems, we give the exact minimum error probability of discriminating two single qubit quantum operations by unentangled input states. In particular, for the Pauli channels discussed in [Phys. Rev. A {\bf 71}, 062340 (2005)], we use a more intuitional and visual method to deal with their discrimination problem. Secondly, we consider the condition for perfect discrimination of two quantum operations. Specially, we get that two generalized Pauli channe…
Spatially resolving two incoherent point sources whose separation is well below the diffraction limit dictated by classical optics has recently been shown possible using techniques that decompose the incoming radiation into orthogonal transverse modes. Such a demultiplexing procedure, however, must be perfectly calibrated to the transverse profile of the incoming light as any misalignment of the modes effectively restores the diffraction limit for small source separations. We study by how much can one mitigate such an effect at the level of measurement which, after being imperfectly demultiple…
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…
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound applies. In particular, the following special case plays an important role in quantum cryptographic protocols in the bounded storage model: Given a string x encoded in an unknown basis chosen from a set of mutually unbiased bases, you may perform any measurement, but then store at most q qubits of quantum information. Later on, you learn which basis was used. How well can you compute a function f(x) of x, given the i…
Recently, the problem of discriminating multipartite unitary operations by local operations and classical communication (LOCC) has attracted significant attention. The latest work in the literature on this problem showed that two multipartite unitary operations can always be perfectly distinguished by LOCC when a finite number of runs are allowable. However, in these schemes, local entanglement (an entangled state holden by one party) was required, which seems to imply that local entanglement is necessary for perfect discrimination between unitary operations by LOCC. In this article, we show t…
It is known that a party with access to a Deutschian closed timelike curve (D-CTC) can perfectly distinguish multiple non-orthogonal quantum states. In this paper, we propose a practical method for discriminating multiple non-orthogonal states, by using a previously known quantum circuit designed to simulate D-CTCs. This method relies on multiple copies of an input state, multiple iterations of the circuit, and a fixed set of unitary operations. We first characterize the performance of this circuit and study its asymptotic behavior. We also show how it can be equivalently recast as a local, ad…
The indistinguishability of non-orthogonal pure states lies at the heart of quantum information processing. Although the indistinguishability reflects the impossibility of measuring complementary physical quantities by a single measurement, we demonstrate that the distinguishability can be perfectly retrieved simply with the help of posterior classical partial information. We demonstrate this by showing an ensemble of non-orthogonal pure states such that a state randomly sampled from the ensemble can be perfectly identified by a single measurement with help of the post-processing of the measur…
It has been recently shown (Bartlett et al. 2003) that information encoded into relative degrees of freedom enables communication without a common reference frame using entangled bipartite states. In this case the relative information stored in the two-qubit system is shared between the polarization degrees of freedom and the degree of entanglement. In the present article a specific state discrimination problem is envisioned where the degree of entanglement carries the only relative parameter, so that certain maximally entangled states are perfectly distinguishable, while discrimination of pro…
We provide a feasible necessary and sufficient condition for when an unknown quantum operation (quantum device) secretely selected from a set of known quantum operations can be identified perfectly within a finite number of queries, and thus complete the characterization of the perfect distinguishability of quantum operations. We further design an optimal protocol which can achieve the perfect discrimination between two quantum operations by a minimal number of queries. Interestingly, employing the techniques from the theory of $q$-numerical range we find that an optimal perfect discrimination…
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…
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…
Using the convex optimization method and Helstrom family of ensembles introduced in Ref. [1], we have discussed optimal ambiguous discrimination in qubit systems. We have analyzed the problem of the optimal discrimination of N known quantum states and have obtained maximum success probability and optimal measurement for N known quantum states with equiprobable prior probabilities and equidistant from center of the Bloch ball, not all of which are on the one half of the Bloch ball and all of the conjugate states are pure. An exact solution has also been given for arbitrary three known quantum s…
We consider the unambiguous discrimination between two unknown qudit states in $n$-dimensional ($n\geqslant2$) Hilbert space. By equivalence of unknown pure states to known mixed states and with the Jordan-basis method, we demonstrate that the optimal success probability of the discrimination between two unknown states is independent of the dimension $n$. We also give a scheme for a physical implementation of the programmable state discriminator that unambiguously discriminate between two unknown states with optimal probability of success.
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.
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…
We present the first full demonstration of unambiguous state discrimination between non-orthogonal quantum states. Using a novel free space interferometer we have realised the optimum quantum measurement scheme for two non-orthogonal states of light, known as the Ivanovic-Dieks-Peres (IDP) measurement. We have for the first time gained access to all three possible outcomes of this measurement. All aspects of this generalised measurement scheme, including its superiority over a standard von Neumann measurement, have been demonstrated within 1.5% of the IDP predictions.
Using the known necessary and sufficient conditions for minimum error discrimination (MED), first it is shown that a Helstrom family of ensembles is equivalent to these conditions and then by a convex combination of the initial states (the states which we try to discriminate them) and the corresponding conjugate states, a more suitable and convenient form for the MED conditions is extracted, so that optimal set of measurements and corresponding optimal success probability of discrimination can be determined. Then, using the introduced identity, MED between N similarity transformed equiprobable…
We show that the quantum measurement known as the pretty good measurement can be used to identify an unknown quantum state picked from any set of $n$ mixed states that have pairwise fidelities upper-bounded by a constant below 1, given $O(\log n)$ copies of the unknown state, with high success probability in the worst case. If the unknown state is promised to be pure, there is an explicit measurement strategy which solves this worst-case quantum state discrimination problem with $\widetilde{O}(\|G\|)$ copies, where $G$ is the Gram matrix of the states.
We accomplish studies of properly quantifying eavesdropper's information gain in individual attacks on the BB84 system of quantum key distribution. A noticeable sensitivity of conclusions to the choice of information measures is brightly revealed, when generalized state discrimination is used at the last stage. To realize her aims, Eve intrudes into the communication channel with some entangling probe. The Fuchs-Peres-Brandt (FPB) probe is known as a powerful individual attack on the BB84 protocol. In the simplest formulation, Eve uses the Helstrom scheme to distinguish output probe states. In…
Many quantum mechanical experiments can be viewed as multi-round interactive protocols between known quantum circuits and an unknown quantum process. Fully quantum "coherent" access to the unknown process is known to provide an advantage in many discrimination tasks compared to when only incoherent access is permitted, but it is unclear if this advantage persists when the process is noisy. Here, we show that a quantum advantage can be maintained when distinguishing between two noisy single qubit rotation channels. Numerical and analytical calculations reveal a distinct transition between optim…
When a photon is detected after passing through an interferometer one might wonder which path it took, and a meaningful answer can only be given if one has the means of monitoring the photon's whereabouts. We report the realization of a single-photon experiment for a two-path interferometer with path marking. In this experiment, the path of a photon ("signal") through a Mach--Zehnder interferometer becomes known by unambiguous discrimination between the two paths. We encode the signal path in the polarization state of a partner photon ("idler") whose polarization is examined by a three-outcome…
Absorption-free (also known as ``interaction-free'') measurement aims to detect the presence of an opaque object using a test particle without that particle being absorbed by the object. Here we consider semi-transparent objects which have an amplitude $α$ of transmitting a particle while leaving the state of the object unchanged and an amplitude $β$ of absorbing the particle. The task is to devise a protocol that can decide which of two known transmission amplitudes is present while ensuring that no particle interacts with the object. We show that the probabilities of being able to achieve th…
We study the power of measurements implementable with local quantum operations and classical communication (or LOCC measurements for short) in the setting of quantum channel discrimination. More precisely, we consider discrimination procedures that attempt to identify an unknown channel, chosen uniformly from two known alternatives, that take the following form: (i) the input to the unknown channel is prepared in a possibly entangled state with an ancillary system, (ii) the unknown channel is applied to the input system, and (iii) an LOCC measurement is performed on the output and ancillary sy…
We derive a general lower bound on the minimum-error probability for {\it ambiguous discrimination} between arbitrary $m$ mixed quantum states with given prior probabilities. When $m=2$, this bound is precisely the well-known Helstrom limit. Also, we give a general lower bound on the minimum-error probability for discriminating quantum operations. Then we further analyze how this lower bound is attainable for ambiguous discrimination of mixed quantum states by presenting necessary and sufficient conditions related to it. Furthermore, with a restricted condition, we work out a upper bound on th…
The problem of quantum state filtering consists of determining whether an unknown quantum state, which is chosen from a known set of states, is either a particular, specified state, or not. We consider this problem for the case that the filtering procedure is required to be unambiguous, which necessitates admitting inconclusive answers when the given states are not orthogonal. As an application, we propose an efficient, probabilistic procedure for distinguishing between sets of Boolean functions, which is an extension of the Deutsch-Jozsa algorithm.
It is known that unambiguous discrimination among non-orthogonal but linearly independent quantum states is possible with a certain probability of success. Here, we consider a variant of that problem. Instead of discriminating among all of the different states, we shall only discriminate between two subsets of them. In particular, for the case of three non-orthogonal states, we show that the optimal strategy to distinguish between a set containing one of the states from the set containing the other two has a higher success rate than if we wish to discriminate among all three states. Somewhat s…
An important task for quantum information processing is optimal discrimination between two non-orthogonal quantum states, which until now has only been realized optically. Here, we present and compare experimental realizations of optimal quantum measurements for distinguishing between two non-orthogonal quantum states encoded in a single ^14 N nuclear spin. Implemented measurement schemes are the minimum-error measurement (known as Helstrom measurement), unambiguous state discrimination using a standard projective measurement, and optimal unambiguous state discrimination (known as IDP measurem…
Unambiguously distinguishing between nonorthogonal but linearly independent quantum states is a challenging problem in quantum information processing. In this work, an exact analytic solution to an optimum measurement problem involving an arbitrary number of pure linearly independent quantum states is presented. To this end, the relevant semi-definite programming task is reduced to a linear programming one with a feasible region of polygon type which can be solved via simplex method. The strength of the method is illustrated through some explicit examples. Also using the close connection betwe…
In this thesis we study the problem of unambiguously discriminating two mixed quantum states. We first present reduction theorems for optimal unambiguous discrimination of two generic density matrices. We show that this problem can be reduced to that of two density matrices that have the same rank $r$ in a 2$r$-dimensional Hilbert space. These reduction theorems also allow us to reduce USD problems to simpler ones for which the solution might be known. As an application, we consider the unambiguous comparison of $n$ linearly independent pure states with a simple symmetry. Moreover, lower bound…
We investigate quantum state discrimination with confidentiality. $N$ observers share a given quantum state belonging to a finite set of known states. The observers want to determine the state as accurately as possible and send a discrimination result to a receiver. However, the observers are not allowed to get any information about which state was given. $N-1$ or fewer observers might try to steal the information, but if $N$ observers coexist, the honest ones will keep the dishonest ones from doing anything wrong. Assume that the state set has a certain symmetry, or more precisely, is Abelian…
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…
For the optimal success probability under minimum-error discrimination between $r\geq2$ arbitrary quantum states prepared with any a priori probabilities, we find new general analytical lower and upper bounds and specify the relations between these new general bounds and the general bounds known in the literature. We also present the example where the new general analytical bounds, lower and upper, on the optimal success probability are tighter than most of the general analytical bounds known in the literature. The new upper bound on the optimal success probability explicitly generalizes to $r…
We consider the class of protocols that can be implemented by local quantum operations and classical communication (LOCC) between two parties. In particular, we focus on the task of discriminating a known set of quantum states by LOCC. Building on the work in the paper "Quantum nonlocality without entanglement" [BDF+99], we provide a framework for bounding the amount of nonlocality in a given set of bipartite quantum states in terms of a lower bound on the probability of error in any LOCC discrimination protocol. We apply our framework to an orthonormal product basis known as the domino states…
We present a measurement protocol for discriminating between two different quantum states of a qubit with high fidelity. The protocol, called null value, is comprised of a projective measurement performed on the system with a small probability (also known as partial-collapse), followed by a tuned postselection. We report on an optical experimental implementation of the scheme. We show that our protocol leads to an amplified signal-to-noise ratio (as compared with a straightforward strong measurement) when discerning between the two quantum states.
We solve the long-standing problem of making n perfect clones from m copies of one of two known pure states with minimum failure probability in the general case where the known states have arbitrary a priori probabilities. The solution emerges from a geometric formulation of the problem. This formulation also reveals a deeper connection between cloning and state discrimination. The convergence of cloning to state discrimination as the number of clones goes to infinity exhibits a phenomenon analogous to a second order symmetry breaking phase transition.