A Quasipolynomial-Time Algorithm for the Quantum Separability Problem

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

32 Citations (Scopus)

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	43rd ACM Symposium on Theory of Computing
Number	43
Country/Territory	United States
City	San Jose, California
Period	06/06/2011 → 08/06/2011

Keywords

@inbook{60723cec51e24abdabfd05c5f02fd68c,

title = "A Quasipolynomial-Time Algorithm for the Quantum Separability Problem",

keywords = "quantum computation, separability problem, interactive proofs, squashed entanglement, conditional mutual information",

author = "Brandao, {Fernando G. S. L.} and Matthias Christandl and Jon Yard",

year = "2011",

language = "English",

isbn = "978-1-4503-0691-1",

pages = "343--351",

booktitle = "STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING",

note = "43rd ACM Symposium on Theory of Computing ; Conference date: 06-06-2011 Through 08-06-2011",

}

TY - CHAP

T1 - A Quasipolynomial-Time Algorithm for the Quantum Separability Problem

AU - Brandao, Fernando G. S. L.

AU - Christandl, Matthias

AU - Yard, Jon

N1 - Conference code: 43

PY - 2011

Y1 - 2011

KW - quantum computation

KW - separability problem

KW - interactive proofs

KW - squashed entanglement

KW - conditional mutual information

M3 - Book chapter

SN - 978-1-4503-0691-1

SP - 343

EP - 351

BT - STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING

T2 - 43rd ACM Symposium on Theory of Computing

Y2 - 6 June 2011 through 8 June 2011

ER -