A Quasipolynomial-Time Algorithm for the Quantum Separability Problem
Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
Original language | English |
---|---|
Title of host publication | STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING |
Publication date | 2011 |
Pages | 343-351 |
ISBN (Print) | 978-1-4503-0691-1 |
Publication status | Published - 2011 |
Externally published | Yes |
Event | 43rd ACM Symposium on Theory of Computing - San Jose, California, United States Duration: 6 Jun 2011 → 8 Jun 2011 Conference number: 43 |
Conference
Conference | 43rd ACM Symposium on Theory of Computing |
---|---|
Nummer | 43 |
Land | United States |
By | San Jose, California |
Periode | 06/06/2011 → 08/06/2011 |
- quantum computation, separability problem, interactive proofs, squashed entanglement, conditional mutual information
Research areas
ID: 192790329