--- http_interactions: - request: method: get uri: https://doi.org/10.4230/lipics.tqc.2013.93 body: encoding: US-ASCII string: '' headers: User-Agent: - Maremma - https://github.com/datacite/maremma Accept: - application/vnd.datacite.datacite+xml response: status: code: 303 message: '' headers: Server: - Apache-Coyote/1.1 Vary: - Accept Location: - http://data.datacite.org/10.4230%2Flipics.tqc.2013.93 Expires: - Sat, 18 Feb 2017 08:28:49 GMT Content-Type: - text/html;charset=utf-8 Content-Length: - '191' Date: - Sat, 18 Feb 2017 08:05:59 GMT body: encoding: UTF-8 string: |- Handle Redirect http://data.datacite.org/10.4230%2Flipics.tqc.2013.93 http_version: recorded_at: Sat, 18 Feb 2017 08:06:00 GMT - request: method: get uri: http://data.datacite.org/10.4230%2Flipics.tqc.2013.93 body: encoding: US-ASCII string: '' headers: User-Agent: - Maremma - https://github.com/datacite/maremma Accept: - application/vnd.datacite.datacite+xml response: status: code: 301 message: '' headers: Server: - openresty/1.11.2.2 Date: - Sat, 18 Feb 2017 08:06:00 GMT Content-Type: - text/html Content-Length: - '191' Connection: - keep-alive Location: - https://data.datacite.org/10.4230%2Flipics.tqc.2013.93 body: encoding: UTF-8 string: "\r\n301 Moved Permanently\r\n\r\n

301 Moved Permanently

\r\n
openresty/1.11.2.2
\r\n\r\n\r\n" http_version: recorded_at: Sat, 18 Feb 2017 08:06:00 GMT - request: method: get uri: https://data.datacite.org/10.4230%2Flipics.tqc.2013.93 body: encoding: US-ASCII string: '' headers: User-Agent: - Maremma - https://github.com/datacite/maremma Accept: - application/vnd.datacite.datacite+xml response: status: code: 200 message: '' headers: Server: - openresty/1.11.2.2 Date: - Sat, 18 Feb 2017 08:06:00 GMT Content-Type: - application/vnd.datacite.datacite+xml Content-Length: - '1919' Connection: - keep-alive Cache-Control: - no-transform, max-age=3600 Last-Modified: - Wed, 13 Nov 2013 13:42:17 GMT Vary: - Accept Access-Control-Allow-Origin: - "*" Access-Control-Allow-Methods: - GET, POST, OPTIONS body: encoding: UTF-8 string: "\n\n10.4230/LIPIcs.TQC.2013.93\n\n\nJohnston, Nathaniel\n\n\n\n\tThe Minimum Size of Qubit Unextendible Product Bases\n\nSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany\n2013\n\n\tComputer Science\n\t000 Computer science, knowledge, general works\n\n\n\t\n\t\tHerbstritt, Marc\n\t\n\n\n\t2013-11-05\n\neng\nConferencePaper\n\n\t13 pages\n\n\n\tapplication/pdf\n\n1.0\nCreative Commons Attribution 3.0 Unported license (CC-BY 3.0)\n\n\t\n\tWe investigate the problem of constructing unextendible product bases in the qubit case - that is, when each local dimension equals 2. The cardinality of the smallest unextendible product basis is known in all qubit cases except when the number of parties is a multiple of 4 greater than 4 itself. We construct small unextendible product bases in all of the remaining open cases, and we use graph theory techniques to produce a computer-assisted proof that our constructions are indeed the smallest possible.\n\t\n\n\n" http_version: recorded_at: Sat, 18 Feb 2017 08:06:00 GMT - request: method: get uri: https://doi.org/10.4230/lipics.tqc.2013.93 body: encoding: US-ASCII string: '' headers: User-Agent: - Maremma - https://github.com/datacite/maremma Accept: - text/html,application/json,application/xml;q=0.9, text/plain;q=0.8,image/png,*/*;q=0.5 response: status: code: 303 message: '' headers: Server: - Apache-Coyote/1.1 Vary: - Accept Location: - http://drops.dagstuhl.de/opus/volltexte/2013/4317/ Expires: - Sat, 18 Feb 2017 08:28:49 GMT Content-Type: - text/html;charset=utf-8 Content-Length: - '185' Date: - Sat, 18 Feb 2017 08:05:59 GMT body: encoding: UTF-8 string: |- Handle Redirect http://drops.dagstuhl.de/opus/volltexte/2013/4317/ http_version: recorded_at: Sat, 18 Feb 2017 08:06:00 GMT - request: method: get uri: http://drops.dagstuhl.de/opus/volltexte/2013/4317/ body: encoding: US-ASCII string: '' headers: User-Agent: - Maremma - https://github.com/datacite/maremma Accept: - text/html,application/json,application/xml;q=0.9, text/plain;q=0.8,image/png,*/*;q=0.5 response: status: code: 200 message: '' headers: Date: - Sat, 18 Feb 2017 08:06:00 GMT Server: - Apache/2.0.55 (Unix) Embperl/2.0.1 mod_ssl/2.0.55 OpenSSL/0.9.8o PHP/5.1.4 mod_perl/2.0.2 Perl/v5.8.8 Last-Modified: - Fri, 06 Nov 2015 12:44:15 GMT Etag: - '"15601a-1ddd-99e225c0"' Accept-Ranges: - bytes Content-Length: - '7645' Content-Type: - text/html body: encoding: UTF-8 string: "\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nDROPS - The Minimum Size of Qubit Unextendible Product Bases\n\n\n \n \n \n\n\n
\n
\nSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH\nSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH\nscholarly article \nen\nJohnston, Nathaniel\nhttp://www.dagstuhl.de/lipics\nLicense
\nwhen quoting this document, please refer to the following
\nDOI: 10.4230/LIPIcs.TQC.2013.93
\nURN: urn:nbn:de:0030-drops-43173
\nURL: http://drops.dagstuhl.de/opus/volltexte/2013/4317/ \n\n
\n\nJohnston, Nathaniel\n\n

\n

The Minimum Size of Qubit Unextendible Product Bases

\n \n\n\n\n\n
\npdf-format: \n\n\n\n\n
\n20.pdf (0.5 MB) \n
\n
\n

\n

\n\n
\n

Abstract

\nWe investigate the problem of constructing unextendible product bases in the qubit case - that is, when each local dimension equals 2. The cardinality of the smallest unextendible product basis is known in all qubit cases except when the number of parties is a multiple of 4 greater than 4 itself. We construct small unextendible product bases in all of the remaining open cases, and we use graph theory techniques to produce a computer-assisted proof that our constructions are indeed the smallest possible. \n
\n

\n

BibTeX - Entry

\n
@InProceedings{johnston:LIPIcs:2013:4317,\n
        \ author =\t{Nathaniel Johnston},\n  title =\t{{The Minimum Size of Qubit
        Unextendible Product Bases}},\n  booktitle =\t{8th Conference on the Theory
        of Quantum Computation, Communication and Cryptography (TQC 2013)},\n  pages
        =\t{93--105},\n  series =\t{Leibniz International Proceedings in Informatics
        (LIPIcs)},\n  ISBN =\t{978-3-939897-55-2},\n  ISSN =\t{1868-8969},\n  year
        =\t{2013},\n  volume =\t{22},\n  editor =\t{Simone Severini and Fernando Brandao},\n
        \ publisher =\t{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},\n  address
        =\t{Dagstuhl, Germany},\n  URL =\t\t{http://drops.dagstuhl.de/opus/volltexte/2013/4317},\n
        \ URN =\t\t{urn:nbn:de:0030-drops-43173},\n  doi =\t\t{http://dx.doi.org/10.4230/LIPIcs.TQC.2013.93},\n
        \ annote =\t{Keywords: unextendible product basis; quantum entanglement; graph
        factorization}\n}\n
\n

\n \n \n \n\n \n \n\n \n \n \n\n \n \n \n\n \n \n \n\n2013\n \n
\nKeywords:\nunextendible product basis; quantum entanglement; graph factorization
\nSeminar:\n8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013) \n
\nRelated Scholarly Article:\n
\nIssue date:\n2013
\nDate of publication:\n2013
\n

\n

\n

\n
\nDROPS-Home |\nFulltext Search |\nImprint\n\"Published\n
\n

\n

\n\n\n\n" http_version: recorded_at: Sat, 18 Feb 2017 08:06:00 GMT - request: method: get uri: https://doi.org/10.4230/lipics.tqc.2013.93 body: encoding: US-ASCII string: '' headers: User-Agent: - Maremma - https://github.com/datacite/maremma Accept: - text/html,application/json,application/xml;q=0.9, text/plain;q=0.8,image/png,*/*;q=0.5 response: status: code: 303 message: '' headers: Server: - Apache-Coyote/1.1 Vary: - Accept Location: - http://drops.dagstuhl.de/opus/volltexte/2013/4317/ Expires: - Sat, 18 Feb 2017 08:28:49 GMT Content-Type: - text/html;charset=utf-8 Content-Length: - '185' Date: - Sat, 18 Feb 2017 08:06:00 GMT body: encoding: UTF-8 string: |- Handle Redirect http://drops.dagstuhl.de/opus/volltexte/2013/4317/ http_version: recorded_at: Sat, 18 Feb 2017 08:06:01 GMT - request: method: get uri: http://drops.dagstuhl.de/opus/volltexte/2013/4317/ body: encoding: US-ASCII string: '' headers: User-Agent: - Maremma - https://github.com/datacite/maremma Accept: - text/html,application/json,application/xml;q=0.9, text/plain;q=0.8,image/png,*/*;q=0.5 response: status: code: 200 message: '' headers: Date: - Sat, 18 Feb 2017 08:06:01 GMT Server: - Apache/2.0.55 (Unix) Embperl/2.0.1 mod_ssl/2.0.55 OpenSSL/0.9.8o PHP/5.1.4 mod_perl/2.0.2 Perl/v5.8.8 Last-Modified: - Fri, 06 Nov 2015 12:44:15 GMT Etag: - '"15601a-1ddd-99e225c0"' Accept-Ranges: - bytes Content-Length: - '7645' Content-Type: - text/html body: encoding: UTF-8 string: "\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nDROPS - The Minimum Size of Qubit Unextendible Product Bases\n\n\n \n \n \n\n\n
\n
\nSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH\nSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH\nscholarly article \nen\nJohnston, Nathaniel\nhttp://www.dagstuhl.de/lipics\nLicense
\nwhen quoting this document, please refer to the following
\nDOI: 10.4230/LIPIcs.TQC.2013.93
\nURN: urn:nbn:de:0030-drops-43173
\nURL: http://drops.dagstuhl.de/opus/volltexte/2013/4317/ \n\n
\n\nJohnston, Nathaniel\n\n

\n

The Minimum Size of Qubit Unextendible Product Bases

\n \n\n\n\n\n
\npdf-format: \n\n\n\n\n
\n20.pdf (0.5 MB) \n
\n
\n

\n

\n\n
\n

Abstract

\nWe investigate the problem of constructing unextendible product bases in the qubit case - that is, when each local dimension equals 2. The cardinality of the smallest unextendible product basis is known in all qubit cases except when the number of parties is a multiple of 4 greater than 4 itself. We construct small unextendible product bases in all of the remaining open cases, and we use graph theory techniques to produce a computer-assisted proof that our constructions are indeed the smallest possible. \n
\n

\n

BibTeX - Entry

\n
@InProceedings{johnston:LIPIcs:2013:4317,\n
        \ author =\t{Nathaniel Johnston},\n  title =\t{{The Minimum Size of Qubit
        Unextendible Product Bases}},\n  booktitle =\t{8th Conference on the Theory
        of Quantum Computation, Communication and Cryptography (TQC 2013)},\n  pages
        =\t{93--105},\n  series =\t{Leibniz International Proceedings in Informatics
        (LIPIcs)},\n  ISBN =\t{978-3-939897-55-2},\n  ISSN =\t{1868-8969},\n  year
        =\t{2013},\n  volume =\t{22},\n  editor =\t{Simone Severini and Fernando Brandao},\n
        \ publisher =\t{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},\n  address
        =\t{Dagstuhl, Germany},\n  URL =\t\t{http://drops.dagstuhl.de/opus/volltexte/2013/4317},\n
        \ URN =\t\t{urn:nbn:de:0030-drops-43173},\n  doi =\t\t{http://dx.doi.org/10.4230/LIPIcs.TQC.2013.93},\n
        \ annote =\t{Keywords: unextendible product basis; quantum entanglement; graph
        factorization}\n}\n
\n

\n \n \n \n\n \n \n\n \n \n \n\n \n \n \n\n \n \n \n\n2013\n \n
\nKeywords:\nunextendible product basis; quantum entanglement; graph factorization
\nSeminar:\n8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013) \n
\nRelated Scholarly Article:\n
\nIssue date:\n2013
\nDate of publication:\n2013
\n

\n

\n

\n
\nDROPS-Home |\nFulltext Search |\nImprint\n\"Published\n
\n

\n

\n\n\n\n" http_version: recorded_at: Sat, 18 Feb 2017 08:06:01 GMT recorded_with: VCR 3.0.3