Published in: LIPIcs, Volume 22, 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)
Nathaniel Johnston. The Minimum Size of Qubit Unextendible Product Bases. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 93-105, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{johnston:LIPIcs.TQC.2013.93,
author = {Johnston, Nathaniel},
title = {{The Minimum Size of Qubit Unextendible Product Bases}},
booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)},
pages = {93--105},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-55-2},
ISSN = {1868-8969},
year = {2013},
volume = {22},
editor = {Severini, Simone and Brandao, Fernando},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.93},
URN = {urn:nbn:de:0030-drops-43173},
doi = {10.4230/LIPIcs.TQC.2013.93},
annote = {Keywords: unextendible product basis; quantum entanglement; graph factorization}
}
Feedback for Dagstuhl Publishing