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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2021-10-01
|
| Series: | Scientific Reports |
| Online Access: | https://doi.org/10.1038/s41598-021-98523-6 |