Detecting Entanglement by Pure Bosonic Extension
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2022
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908402278465536 |
|---|---|
| author | Zhu, Xuanran Zhang, Chao Cao, Chenfeng Li, Youning Poon, Yiu Tung Zeng, Bei |
| author_facet | Zhu, Xuanran Zhang, Chao Cao, Chenfeng Li, Youning Poon, Yiu Tung Zeng, Bei |
| contents | 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$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2209_10934 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Detecting Entanglement by Pure Bosonic Extension Zhu, Xuanran Zhang, Chao Cao, Chenfeng Li, Youning Poon, Yiu Tung Zeng, Bei Quantum Physics 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$. |
| title | Detecting Entanglement by Pure Bosonic Extension |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2209.10934 |