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 that a perfect discrimination between two unitary operations acting on a two-qudits can always be achieved without exploiting any entanglement. As a result, we conclude that local entanglement is not necessary for perfect discrimination between unitary operations acting on two-qudits by LOCC.
A novel criterion of extracting thermodynamical work from a bipartite pure qudit-entangled state by means of local operation and classical communication (LOCC) has been presented. We have shown that non-vanishing $G$-concurrence is a necessary condition to extract work from an higher dimensional entangled state in LOCC paradigm.
We revisit the problem of discriminating orthogonal quantum states within the local quantum operation and classical communication (LOCC) paradigm. Our particular focus is on the asymptotic situation where the parties have infinite resources and the protocol may become arbitrarily long. Our main result is a necessary condition for perfect asymptotic LOCC discrimination. As an application, we prove that for complete product bases, unlimited resources are of no advantage. On the other hand, we identify an example, for which it still remains undecided whether unlimited resources are superior.
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…
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 paper, we consider the problem of discriminating quantum states by local operations and classical communication (LOCC) when an arbitrarily small amount of error is permitted. This paradigm is known as asymptotic state discrimination, and we derive necessary conditions for when two multipartite states of any size can be discriminated perfectly by asymptotic LOCC. We use this new criterion to prove a gap in the LOCC and separable distinguishability norms. We then turn to the operational advantage of using two-way classical communication over one-way communication in LOCC processing. With…
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…
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…
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…
We consider an infinite class of unambiguous quantum state discrimination problems on multipartite systems, described by Hilbert space $\cal{H}$, of any number of parties. Restricting consideration to measurements that act only on $\cal{H}$, we find the optimal global measurement for each element of this class, achieving the maximum possible success probability of $1/2$ in all cases. This measurement turns out to be both separable and unique, and by our recently discovered necessary condition for local quantum operations and classical communication (LOCC), it is easily shown to be impossible b…
We consider the problem of local operations and classical communication (LOCC) discrimination between two bipartite pure states of fermionic systems. We show that, contrary to the case of quantum systems, for fermionic systems it is generally not possible to achieve the ideal state discrimination performances through LOCC measurements. On the other hand, we show that an ancillary system made of two fermionic modes in a maximally entangled state is a sufficient additional resource to attain the ideal performances via LOCC measurements. The stability of the ideal results is studied when the prob…
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…
The paper studies unambiguous discrimination of Fermionic states through local operations and classical communication (LOCC). In the task of unambiguous discrimination, no error is tolerated but an inconclusive result is allowed. We show that contrary to the quantum case, it is not always possible to distinguish two Fermionic states through LOCC unambiguously with the same success probability as if global measurements were allowed. Furthermore, we prove that we can overcome such a limit through an ancillary system made of two Fermionic modes, independently of the dimension of the system, prepa…
Global versus Local Discrimination of Locally Implementable Multipartite Unitaries
Indian Institute of Science Education and Research Thiruvananthapuram（印度科学教育研究所特里凡得琅分校）；Indian Institute of Technology Bhubaneswar（印度技术学院布巴内斯瓦尔分校）；S. N. Bose National Centre for Basic Sciences（S.N. 玻色基础科学国家中心）
We discuss a scheme in which sequential state-discrimination measurements are performed on qudits to determine the quantum state in which they were initially prepared. The qudits belong to a set of nonorthogonal quantum states and hence cannot be distinguished with certainty. Unambiguous state discrimination allows error-free measurements at the expense of occasionally failing to give a conclusive answer about the state of the qudit. Qudits have the potential to carry more information per transmission than qubits. We considered the situation in which Alice sends one of N qudits, where the dime…
We consider the problem of establishing entangled states of optimal singlet fraction and negativity between two remote parties for every use of a noisy quantum channel and trace-preserving LOCC under the assumption that the parties do not share prior correlations. We show that for a family of quantum channels in every finite dimension $d\geq3$, one-shot optimal singlet fraction and entanglement negativity are attained only with appropriate nonmaximally entangled states. We further show that the generalization of the formula that exactly computes one-shot optimal singlet fraction for qubit chan…
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.
Entangled states can help in quantum state discrimination by local operations and classical communication (LOCC). For example, a Bell state is necessary (and sufficient) to perfectly discriminate a set of either three or four Bell states by LOCC. In this paper, we consider the task of LOCC discrimination of the states of noisy Bell ensembles, where a given ensemble consists of the states obtained by mixing the Bell states with an arbitrary two-qubit state with nonzero probabilities. It is proved that a Bell state is required for optimal discrimination by LOCC, even though the ensembles do not …
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 consider bipartite LOCC, the class of operations implementable by local quantum operations and classical communication between two parties. Surprisingly, there are operations that cannot be implemented with finitely many messages but can be approximated to arbitrary precision with more and more messages. This significantly complicates the analysis of what can or cannot be approximated with LOCC. Towards alleviating this problem, we exhibit two scenarios in which allowing vanishing error does not help. The first scenario involves implementation of measurements with projective product measure…
We investigate how originally localized two pieces of quantum information represented by a tensor product of two unknown qudit states are delocalized by performing two-qudit global unitary operations. To characterize the delocalization power of global unitary operations on quantum information, we analyze the necessary and sufficient condition to deterministically relocalize one of the two pieces of quantum information to its original Hilbert space by using only LOCC. We prove that this LOCC one-piece relocalization is possible if and only if the global unitary operation is local unitary equiva…
The question of the discrimination of the Bell states of two qudits (i.e., d-dimensional quantum systems) by means of passive linear optical elements and conditional measurements is discussed. A qudit is supposed to be represented by d optical modes containing exactly one photon altogether. From recent results of Calsamiglia it follows that there is no way how to distinguish the Bell states of two qudits for d>2 - not even with the probability of success lower than one - without any auxiliary photons in ancillary modes. Following the results of Carollo and Palma it is proved that it is impossi…
We explore the question of using an entangled state as a universal resource for implementing quantum measurements by local operations and classical communication (LOCC). We show that for most systems consisting of three or more subsystems, there is no entangled state from the same space that can enable all measurements by LOCC. This is in direct contrast to the bipartite case, where a maximally entangled state is an universal resource. Our results are obtained showing an equivalence between the problem of local state transformation and that of entanglement-assisted local unambiguous state disc…
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…
Unambiguous state discrimination of two mixed bipartite states via local operations and classical communications (LOCC) is studied and compared with the result of a scheme realized via global measurement. We show that the success probability of a global scheme for mixed-state discrimination can be achieved perfectly by the local scheme. In addition, we simulate this discrimination via a pair of pure entangled bipartite states. This simulation is perfect for local rather than global schemes due to the existence of entanglement and global coherence in the pure states. We also prove that LOCC pro…
Local quantum operations and classical communication (LOCC) put considerable constraints on many quantum information processing tasks such as cloning and discrimination. Surprisingly however, discrimination of any two pure states survives such constraints in some sense. In this paper, we show that cloning is not that lucky; namely, conclusive LOCC cloning of two product states is strictly less efficient than global cloning.
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.
The existence of distinguishable bases in three-dimensional subspaces of qutrit-qudit systems under one-way local operations and classical communication
In this paper, we treat a local discrimination problem in the framework of asymmetric hypothesis testing. We choose a known bipartite pure state $\ketΨ$ as an alternative hypothesis, and the completely mixed state as a null hypothesis. As a result, we analytically derive an optimal type 2 error and an optimal POVM for one-way LOCC POVM and Separable POVM. For two-way LOCC POVM, we study a family of simple three-step LOCC protocols, and show that the best protocol in this family has strictly better performance than any one-way LOCC protocol in all the cases where there may exist difference betw…
We study the maximum-confidence (MC) measurement strategy for discriminating among nonorthogonal symmetric qudit states. Restricting to linearly dependent and equally likely pure states, we find the optimal positive operator valued measure (POVM) that maximizes our confidence in identifying each state in the set and minimizes the probability of obtaining inconclusive results. The physical realization of this POVM is completely determined and it is shown that after an inconclusive outcome, the input states may be mapped into a new set of equiprobable symmetric states, restricted, however, to a …
We prove limitations on LOCC and separable measurements in bipartite state discrimination problems using techniques from convex optimization. Specific results that we prove include: an exact formula for the optimal probability of correctly discriminating any set of either three or four Bell states via LOCC or separable measurements when the parties are given an ancillary partially entangled pair of qubits; an easily checkable characterization of when an unextendable product set is perfectly discriminated by separable measurements, along with the first known example of an unextendable product s…
In this paper, we treat an asymptotic hypothesis testing (or state discrimination with asymmetric treatment of errors) between an arbitrary fixed bipartite pure state and the completely mixed state by one-way LOCC, two-way LOCC, and separable POVMs. As a result, we derive single-letterized formulas for the Stein's lemma type of optimal error exponents under one-way LOCC, two-way LOCC and separable POVMs, the Chernoff bounds under one-way LOCC POVMs and separable POVMs, and the Hoeffding bounds under one-way LOCC POVMs in the whole region of a parameter and under separable POVMs on a restricted…
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 analyze the difference in the local distinguishability among the following three restrictions; (i) Local operations and only one-way classical communications (one-way LOCC) are permitted. (ii) Local operations and two-way classical communications (two-way LOCC) are permitted. (iii) All separable operations are permitted. We obtain two main results concerning the discrimination between a given bipartite pure state and the completely mixed state with the condition that the given state should be detected perfectly. As the first result, we derive the optimal discrimination protocol for a bipart…
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.
The problem behind this paper is, if the number of queries to unitary operations is fixed, say $k$, then when do local operations and classical communication (LOCC) suffice for optimally distinguishing bipartite unitary operations? We consider the above problem for two-qubit unitary operations in the case of $k=1$, showing that for two two-qubit entangling unitary operations without local parties, LOCC achieves the same distinguishability as the global operations. Specifically, we obtain: (i) if such two unitary operations are perfectly distinguishable by global operations, then they are perfe…
Distributed quantum information processing protocols such as quantum entanglement distillation and quantum state discrimination rely on local operations and classical communications (LOCC). Existing LOCC-based protocols typically assume the availability of ideal, noiseless, communication channels. In this paper, we study the case in which classical communication takes place over noisy channels, and we propose to address the design of LOCC protocols in this setting via the use of quantum machine learning tools. We specifically focus on the important tasks of quantum entanglement distillation an…
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…
It is shown that local distinguishability of orthogonal mixed states can be completely characterized by local distinguishability of their supports irrespective of entanglement and mixedness of the states. This leads to two kinds of upper bounds on the number of perfect LOCC distinguishable orthogonal mixed states. The first one depends only on pure-state entanglement within the supports of the states, and therefore may be easy to compute in many instances. The second bound is optimal in the sense that it optimizes the bounding quantities, not necessarily function of entanglement alone, over al…
In this work, we study the local distinguishability of maximally entangled states (MESs). In particular, we are concerned with whether any fixed number of MESs can be locally distinguishable for sufficiently large dimensions. Fan and Tian \emph{et al.} have already obtained two satisfactory results for the generalized Bell states (GBSs) and the qudit lattice states when applied to prime or prime power dimensions. We construct a general twist-teleportation scheme for any orthonormal basis with MESs that is inspired by the method used in [Phys. Rev. A \textbf{70}, 022304 (2004)]. Using this tele…
Quantum separable operations are defined as those that cannot produce entanglement from separable states, and it is known that they strictly surpass local operations and classical communication (LOCC) in a number of tasks, which is sometimes referred to as "quantum nonlocality without entanglement." Here we consider a task with such a gap regarding the trade-off between state discrimination and preservation of entanglement. We show that this task along with the gap has an analogue in a purely classical setup, indicating that the quantum properties are not essential in the existence of a nonzer…
An orthogonal product basis of a composite Hilbert space is genuinely nonlocal if the basis states are locally indistinguishable across every bipartition. From an operational point of view such a basis corresponds to a separable measurement that cannot be implemented by local operations and classical communication (LOCC) unless all the parties come together in a single location. In this work we classify genuinely nonlocal product bases into different categories. Our classification is based on state elimination property of the set via orthogonality-preserving measurements when all the parties a…
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…
In this thesis, we investigate two different aspects of entanglement and classical communication in distributed quantum computation (DQC). In the first part, we analyze implementable computation over a given quantum network resource by introducing a new concept, quantum network coding for quantum computation. We consider a setting of networks where quantum communication for each edge of a network is restricted to sending one-qubit, but classical communication is unrestricted. Specifically, we analyze implementable $k$-qubit unitary operations over a certain class of networks, called cluster ne…
