Detecting Entanglement by Pure Bosonic Extension

Abstract

In the realm of quantum information theory, the detection and quantification of quantum entanglement stand as paramount tasks. The relative entropy of entanglement (REE) serves as a prominent measure of entanglement, with extensive applications spanning numerous related fields. The positive partial transpose (PPT) criterion, while providing an efficient method for the computation of REE, unfortunately, falls short when dealing with bound entanglement. In this study, we propose a method termed "pure bosonic extension" to enhance the practicability of $k$-bosonic extensions, which approximates the set of separable states from the "outside", through a hierarchical structure. It enables efficient characterization of the set of $k$-bosonic extendible states, facilitating the derivation of accurate lower bounds for REE. Compared to the Semi-Definite Programming (SDP) approach, such as the symmetric/bosonic extension function in QETLAB, our algorithm supports much larger dimensions and higher values of extension $k$.

11 pages, 8 figures

References in corpus (26)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• 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?
• The Role of Relative Entropy in Quantum Information Theory
• Entanglement Measures under Symmetry
• A complete family of separability criteria
• Bloch vectors for qudits
• Distinguishing separable and entangled states
• Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement
• An improved bound on distillable entanglement
• Quantum marginal problem and N-representability
• N-representability is QMA-complete
• Quantum computation based on d-level cluster states
• A Separability-Entanglement Classifier via Machine Learning
• Semidefinite approximations of the matrix logarithm
• A comparative study of relative entropy of entanglement, concurrence and negativity
• The power of symmetric extensions for entanglement detection
• Efficient optimization of the quantum relative entropy
• Detecting and quantifying entanglement on near-term quantum devices
• Symmetric Extension of Two-Qubit States
• Noisy intermediate-scale quantum algorithm for semidefinite programming
• Compatible quantum correlations: on extension problems for Werner and isotropic states
• On convex optimization problems in quantum information theory
• Upper bounds for relative entropy of entanglement based on active learning
• Symmetric vs. bosonic extension for bipartite states