A Quasipolynomial-Time Algorithm for the Quantum Separability Problem

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

Standard

A Quasipolynomial-Time Algorithm for the Quantum Separability Problem. / Brandao, Fernando G. S. L.; Christandl, Matthias; Yard, Jon.

STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING. 2011. p. 343-351.

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

Harvard

Brandao, FGSL, Christandl, M & Yard, J 2011, A Quasipolynomial-Time Algorithm for the Quantum Separability Problem. in STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING. pp. 343-351, 43rd ACM Symposium on Theory of Computing, San Jose, California, United States, 06/06/2011.

APA

Brandao, F. G. S. L., Christandl, M., & Yard, J. (2011). A Quasipolynomial-Time Algorithm for the Quantum Separability Problem. In STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING (pp. 343-351)

Vancouver

Brandao FGSL, Christandl M, Yard J. A Quasipolynomial-Time Algorithm for the Quantum Separability Problem. In STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING. 2011. p. 343-351

Author

Brandao, Fernando G. S. L. ; Christandl, Matthias ; Yard, Jon. / A Quasipolynomial-Time Algorithm for the Quantum Separability Problem. STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING. 2011. pp. 343-351

Bibtex

@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 = "null ; Conference date: 06-06-2011 Through 08-06-2011",

}

RIS

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

Y2 - 6 June 2011 through 8 June 2011

ER -

ID: 192790329