Quantum states must be distinguished every time information is extracted from a system.Local distinguishability is on par with entanglement as being a defining characteristic of quantum mechanics.In this thesis, I optimize state distiguishability of a tripartite system with different measurement settings.Specifically, I analyze the smallest tripartite Unextendible Product Basis (UPB), known as SHIFTS.This UPB has interesting symmetries and exhibits nonlocality without entanglement.I consider the case in which the parties are restricted to Local Operations and Classical Communication, which makes perfect distinguishability impossible here.My work is an important step towards a full quantitative analysis of local information available in locally indistinguishable sets of states.I discuss my discovery of optimal (maximal mutual information) protocols for partially distinguishing SHIFTS.In particular, I present a protocol which is optimal among all protocols consisting only of projective measurements.I show that a certain type of three-outcome measurement can outperform projective measurements for certain input states probability distributions.I claim that this is not the case for SHIFTS.D Calculation of (H) and Generation of a Corresponding C Programming Language Function 130 D.1 Initialization 130 D.2 Definitions 130 D.2.1 Normalization of a discrete probability distribution 131 D.2.2 Shannon entropy 132 D.2.3 Non-deterministic projective measurements/probabilities 134 D.2.4 Non-deterministic POVM measurements/probabilities 136 vii D.2. 5 Probability distributions normalized weighting D.2.6 States D.2.7 Assumptions D.3 Calculations D.3.1 Initial situation D.3.2 Alice's measurement D.3.3 Bob's measurement D.3.4 Charlie's measurement D.3.5 Shannon entropies IE Discussion of Precision of Numerical Results E.1 Evaluation of (H) E.2 Finding a Global Minimum in One Dimension E.3 Finding a Global Minimum in Multi-dimensions E.4 Precision of Individual Results E.4.1 Protocol 1 E.4.2 Protocol 2 E.4.3 Protocol 3 E.4.4 Protocol 4 and Claim 5.1 E.4.5 Proposition 5.4 E.4.6 Claim 5.5 viii List of Tables 1.1 Four states and corresponding binary representations 3.1 SHIFTS UPB labels 4.1 Bob's prior distribution when Alice measures 0 5.1 Prior distribution leading to superiority of trine over projective measurements B. 1 Output from optimization of an isosceles trifle measurements protocol . . .ix List of Figures 1.1 Decomposition of a choice with three possibilities into two steps 2.1 Pentagonal base pyramid used to construct the PYRAMID UPB 3.1 Bloch circle on the Bloch sphere 3.2 Stern-Gerlach apparatuses implementation of a protocol 3.3 Example of a tree representation of a protocol 3.4 Four transformations of a simplex 4.1 Projective measurement on the Bloch circle 4.2 Measurement tree for Protocol 1 4.3 Measurement tree for Protocol 2 4.4 Bob's Shannon entropy when distinguishing local states 5.1 Bloch circle representation of a general trine measurement 5.2 Optimal projective and equilateral trifle optimal measurements 5.3 Shannon entropy after projective and equilateral trifle measurements .5.4 Isosceles trine measurement representation x
Quantum states must be distinguished every time information is extracted from a system.Local distinguishability is on par with entanglement as being a defining characteristic of quantum mechanics.In this thesis, I optimize state distiguishability of a tripartite system with different measurement settings.Specifically, I analyze the smallest tripartite Unextendible Product Basis (UPB), known as SHIFTS.This UPB has interesting symmetries and exhibits nonlocality without entanglement.I consider the case in which the parties are restricted to Local Operations and Classical Communication, which makes perfect distinguishability impossible here.My work is an important step towards a full quantitative analysis of local information available in locally indistinguishable sets of states.I discuss my discovery of optimal (maximal mutual information) protocols for partially distinguishing SHIFTS.In particular, I present a protocol which is optimal among all protocols consisting only of projective measurements.I show that a certain type of three-outcome measurement can outperform projective measurements for certain input states probability distributions.I claim that this is not the case for SHIFTS.D Calculation of (H) and Generation of a Corresponding C Programming Language Function 130 D.1 Initialization 130 D.2 Definitions 130 D.2.1 Normalization of a discrete probability distribution 131 D.2.2 Shannon entropy 132 D.2.3 Non-deterministic projective measurements/probabilities 134 D.2.4 Non-deterministic POVM measurements/probabilities 136 vii D.2. 5 Probability distributions normalized weighting D.2.6 States D.2.7 Assumptions D.3 Calculations D.3.1 Initial situation D.3.2 Alice's measurement D.3.3 Bob's measurement D.3.4 Charlie's measurement D.3.5 Shannon entropies IE Discussion of Precision of Numerical Results E.1 Evaluation of (H) E.2 Finding a Global Minimum in One Dimension E.3 Finding a Global Minimum in Multi-dimensions E.4 Precision of Individual Results E.4.1 Protocol 1 E.4.2 Protocol 2 E.4.3 Protocol 3 E.4.4 Protocol 4 and Claim 5.1 E.4.5 Proposition 5.4 E.4.6 Claim 5.5 viii List of Tables 1.1 Four states and corresponding binary representations 3.1 SHIFTS UPB labels 4.1 Bob's prior distribution when Alice measures 0 5.1 Prior distribution leading to superiority of trine over projective measurements B. 1 Output from optimization of an isosceles trifle measurements protocol . . .ix List of Figures 1.1 Decomposition of a choice with three possibilities into two steps 2.1 Pentagonal base pyramid used to construct the PYRAMID UPB 3.1 Bloch circle on the Bloch sphere 3.2 Stern-Gerlach apparatuses implementation of a protocol 3.3 Example of a tree representation of a protocol 3.4 Four transformations of a simplex 4.1 Projective measurement on the Bloch circle 4.2 Measurement tree for Protocol 1 4.3 Measurement tree for Protocol 2 4.4 Bob's Shannon entropy when distinguishing local states 5.1 Bloch circle representation of a general trine measurement 5.2 Optimal projective and equilateral trifle optimal measurements 5.3 Shannon entropy after projective and equilateral trifle measurements .5.4 Isosceles trine measurement representation x
It is known that the states in an unextendible product basis (UPB) cannot be distinguished perfectly when the parties are restricted to local operations and classical communication (LOCC). Previous discussions of such bases have left open the following question: What entanglement resources are necessary and/or sufficient for this task to be possible with LOCC? In this paper, I present protocols which use entanglement more efficiently than teleportation to distinguish certain classes of UPB's. The ideas underlying my approach to this problem offer rather general insight into why entanglement is useful for such tasks.
Any set of states which cannot be perfectly distinguished by local operations and classical communication (LOCC) alone can always be locally distinguished using quantum teleportation with a maximally entangled state as resource. However, in quantum information theory, entanglement is a very valuable resource, so it leaves the following problem: How to accomplish this task more efficiently than teleportation, that is, design the local discrimination protocol using less entanglement. In this paper, we first present two protocols to locally distinguish a particular unextendible product bases (UPB) in $5\ensuremath{\bigotimes}5$ by using different entanglement resource. Then, we generalize the distinguishing methods for a class of UPB in $d\ensuremath{\bigotimes}d$, where d is odd and $d\ensuremath{\geqslant}3$. Furthermore, for a class of UPB in $d\ensuremath{\bigotimes}d$, where d is even and $d\ensuremath{\geqslant}4$, we prove that these states can also be distinguished by LOCC with multiple copies of low-dimensional entanglement resource. These results offer rather general insight into how to use entanglement resource more efficiently and also reveal the phenomenon of less nonlocality with more entanglement.
Entanglement and nonlocality play a fundamental role in quantum computing. To understand the interplay between these phenomena, researchers have considered the model of local operations and classical communication, or LOCC for short, which is a restricted subset of all possible operations that can be performed on a multipartite quantum system. The task of distinguishing states from a set that is known a priori to all parties is one of the most basic problems among those used to test the power of LOCC protocols, and it has direct applications to quantum data hiding, secret sharing and quantum channel capacity. The focus of this thesis is on state distinguishability problems for classes of quantum operations that are more powerful than LOCC, yet more restricted than global operations, namely the classes of separable and positive-partial-transpose (PPT) measurements. We \nbuild a framework based on convex optimization (on cone programming, in particular) to study such problems. Compared to previous approaches to the problem, the method described in this thesis provides precise numerical bounds and quantitative analytic results. By combining the duality theory of cone programming with the channel-state duality, we also establish a novel connection between the state distinguishability problem and the study of positive linear maps, which is a topic of independent interest in quantum information theory. \n \nWe apply our framework to several questions that were left open in previous works regarding the distinguishability of maximally entangled states and unextendable product sets. First, we exhibit small sets of orthogonal maximally entangled states in that are not perfectly distinguishable by LOCC. As a consequence of this, we show a gap between the power of PPT and separable measurements for the task of distinguishing sets consisting only of maximally entangled states. Furthermore, we prove tight bounds on the entanglement cost that is necessary to distinguish any sets of Bell states, thus showing that quantum teleportation is optimal for this task. Finally, we provide 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 set that cannot be perfectly discriminated by separable measurements.
Quantum nonlocality is associated with the local indistinguishability of orthogonal states. Unextendible product basis (UPB), a widely used tool in quantum information, exhibits nonlocality, which is the powerful resource for quantum information processing. In this work, we extend the definitions of nonlocality and genuine nonlocality from states to operators. We also extend UPB to the notions of unextendible product operator basis, unextendible product unitary operator basis (UPUOB), and strongly UPUOB. We construct their examples and show the nonlocality of some strongly UPUOBs under local operations and classical communications. We study the phenomenon of these operators acting on quantum states. As an application, we distinguish the two-dimensional strongly UPUOB, which only consumes three ebits of entanglement. Our results imply that such UPUOBs exhibit nonlocality as UPBs, and the distinguishability of them requires entanglement resources.
We study the local distinguishability of general multiqubit states and show that local projective measurements and classical communication are as powerful as the most general local measurements and classical communication. Remarkably, this indicates that the local distinguishability of multiqubit states can be decided efficiently. Another useful consequence is that a set of orthogonal n-qubit states is locally distinguishable only if the summation of their orthogonal Schmidt numbers is less than the total dimension 2n. Employing these results, we show that any orthonormal basis of a subspace spanned by arbitrary three-qubit orthogonal unextendible product bases (UPB) cannot be exactly distinguishable by local operations and classical communication. This not only reveals another intrinsic property of three-qubit orthogonal UPB but also provides a class of locally indistinguishable subspaces with dimension 4. We also explicitly construct locally indistinguishable subspaces with dimensions 3 and 5, respectively. Similar to the bipartite case, these results on multipartite locally indistinguishable subspaces can be used to estimate the one-shot environment-assisted classical capacity of a class of quantum broadcast channels.
Entanglement is a central resource in quantum information science, and it is therefore important to design local discrimination protocols that minimize entanglement cost. In this paper, we propose several entanglement-assisted discrimination schemes for the local discrimination of a representative strongly nonlocal unextendible product basis (UPB) in a 3⊗3⊗3 system. By exploiting the structure of the UPB and the properties of maximally entangled resources, we generalize the protocols to a family of strongly nonlocal UPBs in d⊗d⊗d systems. In particular, we show that these UPBs can be perfectly distinguished using two bipartite maximally entangled states, distributed between different pairs of parties, without employing quantum teleportation. We further compare the total supplied and average consumed entanglement under a clearly specified accounting convention. The results demonstrate that avoiding teleportation can reduce the required entanglement in suitable resource-allocation scenarios and clarify the operational role of low-dimensional maximally entangled resources.