A quasipolynomial-time algorithm for the quantum separability problem


METADATA ONLY
Loading...

Date

2011

Publication Type

Conference Proceedings

ETH Bibliography

yes

Citations

Altmetric
METADATA ONLY

Data

Rights / License

Publication status

published

Editor

Book title

Proceedings of the 43rd annual ACM symposium on Theory of computing

Journal / series

Volume

Pages / Article No.

343 - 351

Publisher

Association for Computing Machinery

Event

43rd ACM Symposium on Theory of Computing (STOC 2011)

Edition / version

Methods

Software

Geographic location

Date collected

Date created

Subject

Quantum computation; Separability problem; Interactive proofs; Squashed entanglement; Conditional mutual information

Organisational unit

03879 - Christandl, M. (SNF-Professur) (ehem.) check_circle

Notes

Funding

Related publications and datasets