A Quasipolynomial-Time Algorithm for the Quantum Separability Problem

Fernando G. S. L. Brandao, Matthias Christandl, Jon Yard

Research output: Chapter in Book/Report/Conference proceedingBook chapterResearchpeer-review

35 Citations (Scopus)
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 20118 Jun 2011
Conference number: 43

Conference

Conference43rd ACM Symposium on Theory of Computing
Number43
Country/TerritoryUnited States
CitySan Jose, California
Period06/06/201108/06/2011

Keywords

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

Cite this