A Quasipolynomial-Time Algorithm for the Quantum Separability Problem

Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review

Original languageEnglish
Title of host publicationSTOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING
Publication date2011
Pages343-351
ISBN (Print)978-1-4503-0691-1
Publication statusPublished - 2011
Externally publishedYes
Event43rd ACM Symposium on Theory of Computing - San Jose, California, United States
Duration: 6 Jun 2011 → 8 Jun 2011
Conference number: 43

Conference

Conference43rd ACM Symposium on Theory of Computing
Nummer43
LandUnited States
BySan Jose, California
Periode06/06/2011 → 08/06/2011

    Research areas

  • quantum computation, separability problem, interactive proofs, squashed entanglement, conditional mutual information

ID: 192790329