Indistinguishability of bipartite states by positive-partial-transpose operations in the many-copy scenario
arXiv:1702.00231 · doi:10.1103/PhysRevA.95.052346
Abstract
A bipartite subspace is called strongly positive-partial-transpose-unextendible (PPT-unextendible) if for every positive integer , there is no PPT operator supporting on the orthogonal complement of . We show that a subspace is strongly PPT-unextendible if it contains a PPT-definite operator (a positive semidefinite operator whose partial transpose is positive definite). Based on these, we are able to propose a simple criterion for verifying whether a set of bipartite orthogonal quantum states is indistinguishable by PPT operations in the many copy scenario. Utilizing this criterion, we further point out that any entangled pure state and its orthogonal complement cannot be distinguished by PPT operations in the many copy scenario. On the other hand, we investigate that the minimum dimension of strongly PPT-unextendible subspaces in an system is , which involves a generalization of the result that non-positive-partial-transpose (NPT) subspaces can be as large as any entangled subspace [N. Johnston, Phys. Rev. A 87: 064302 (2013)].
arXiv comment6 pages, comments are welcome!
References in corpus (41)
- Separability Criterion for Density Matrices
- Separability of Mixed States: Necessary and Sufficient Conditions
- Mixed-state entanglement and distillation: is there a ``bound'' entanglement in nature?
- Quantum Nonlocality without Entanglement
- Unextendible Product Bases and Bound Entanglement
- Einstein-Podolsky-Rosen steering provides the advantage in entanglement-assisted subchannel discrimination with one-way measurements
- Local Distinguishability of Multipartite Orthogonal Quantum States
- Quantifying Einstein-Podolsky-Rosen steering
- Distinguishing separable and entangled states
- Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement
- Distinguishability of the Bell states
- Distinguishability and indistinguishability by LOCC
- Local indistinguishability: more nonlocality with less entanglement
- Local indistinguishability and LOCC monotones
- Bounds on Multipartite Entangled Orthogonal State Discrimination Using Local Operations and Classical Communication
- Distinguishing Bipartitite Orthogonal States using LOCC: Best and Worst Cases
- Distinguishability of maximally entangled states
- Four Locally Indistinguishable Ququad-Ququad Orthogonal Maximally Entangled States
- Bipartite subspaces having no LOCC-distinguishable bases
- Distinguishing Arbitrary Multipartite Basis Unambiguously Using Local Operations and Classical Communication
- Distinguishability of complete and unextendible product bases
- On the dimension of subspaces with bounded Schmidt rank
- LOCC distinguishability of unilaterally transformable quantum states
- Condition for unambiguous state discrimination with local operations and classical communication
- On the power of PPT-preserving and non-signalling codes
- PPT-indistinguishable states via semidefinite programming
- Limitations on separable measurements by convex optimization
- Distinguishability of Quantum States by Positive Operator-Valued Measures with Positive Partial Transpose
- More nonlocality with less purity
- No-Signalling Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovasz Number
- Any subspace is locally distinguishable
- Bound entanglement provides convertibility of pure entangled states
- Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel
- Improved Semidefinite Programming Upper Bound on Distillable Entanglement
- When do Local Operations and Classical Communication Suffice for Two-Qubit State Discrimination?
- Local copying and local discrimination as a study for non-locality of a set
- Non-Positive Partial Transpose Subspaces Can be as Large as Any Entangled Subspace
- Local Distinguishability of Any Three Quantum States
- Distinguishing multi-partite states by local measurements
- Quantum Bilinear Optimization
- Pure-state transformations and catalysis under operations that completely preserve positivity of partial transpose
Cited by in corpus (13)
- Semidefinite programming strong converse bounds for classical capacity
- Semidefinite programming relaxations for quantum correlations
- Non-asymptotic entanglement distillation
- Practical distributed quantum information processing with LOCCNet
- Nonadditivity of Rains' bound for distillable entanglement
- Locally distinguishing quantum states with limited classical communication
- Separation between quantum Lovász number and entanglement-assisted zero-error classical capacity
- Limitations of Classically-Simulable Measurements for Quantum State Discrimination
- Entanglement fluctuation theorems
- Approximate broadcasting of quantum correlations
- Locally-Measured Rényi Divergences
- Locality of Orthogonal Product States via Multiplied Copies
- Dynamic LOCC Circuits for Automated Entanglement Manipulation