Free versus bound entanglement, a NP-hard problem tackled by machine learning
Abstract Entanglement detection in high dimensional systems is a NP-hard problem since it is lacking an efficient way. Given a bipartite quantum state of interest free entanglement can be detected efficiently by the PPT-criterion (Peres-Horodecki criterion), in contrast to detecting bound entangleme...
Saved in:
| Main Author: | |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Nature Portfolio
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/636ea1ea90104a98a623300f4d0a620a |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!