Difference between revisions of "MinUPBSize"
Jump to navigation
Jump to search
m |
|||
| (2 intermediate revisions by the same user not shown) | |||
| Line 2: | Line 2: | ||
|name=MinUPBSize | |name=MinUPBSize | ||
|desc=Gives the minimum cardinality of an [[unextendible product basis]] in given dimensions | |desc=Gives the minimum cardinality of an [[unextendible product basis]] in given dimensions | ||
| − | |||
|rel=[[UPB]] | |rel=[[UPB]] | ||
| + | |cat=[[List of functions#Unextendible_product_bases|Unextendible product bases]] | ||
|upd=June 22, 2013 | |upd=June 22, 2013 | ||
| − | |v= | + | |v=0.50}} |
<tt>'''MinUPBSize'''</tt> is a [[List of functions|function]] that returns that minimum numbers of vectors required in an [[unextendible product basis]] (UPB), given the dimensions of the local Hilbert spaces. If the minimum size of a UPB in the given space is not known, and error will be produced. | <tt>'''MinUPBSize'''</tt> is a [[List of functions|function]] that returns that minimum numbers of vectors required in an [[unextendible product basis]] (UPB), given the dimensions of the local Hilbert spaces. If the minimum size of a UPB in the given space is not known, and error will be produced. | ||
| Line 18: | Line 18: | ||
==Examples== | ==Examples== | ||
The following code tells the user that the smallest UPB in <math>\mathbb{C}^5 \otimes \mathbb{C}^6</math> has <math>10</math> states, and points to the reference <ref>N. Alon and L. Lovasz. Unextendible product bases. ''J. Combinatorial Theory, Ser. A'', 95:169–179, 2001.</ref> for a proof of this fact: | The following code tells the user that the smallest UPB in <math>\mathbb{C}^5 \otimes \mathbb{C}^6</math> has <math>10</math> states, and points to the reference <ref>N. Alon and L. Lovasz. Unextendible product bases. ''J. Combinatorial Theory, Ser. A'', 95:169–179, 2001.</ref> for a proof of this fact: | ||
| − | < | + | <syntaxhighlight> |
>> MinUPBSize([5,6]) | >> MinUPBSize([5,6]) | ||
A proof of the minimal size in this case can be found in: | A proof of the minimal size in this case can be found in: | ||
| Line 26: | Line 26: | ||
10 | 10 | ||
| − | </ | + | </syntaxhighlight> |
The following code gives the same information, but without displaying the reference: | The following code gives the same information, but without displaying the reference: | ||
| − | < | + | <syntaxhighlight> |
>> MinUPBSize([5,6],0) | >> MinUPBSize([5,6],0) | ||
| Line 35: | Line 35: | ||
10 | 10 | ||
| − | </ | + | </syntaxhighlight> |
The minimum size of UPBs is also known in many multipartite cases: | The minimum size of UPBs is also known in many multipartite cases: | ||
| − | < | + | <syntaxhighlight> |
>> MinUPBSize([2,2,2,2,2,2,2,2]) | >> MinUPBSize([2,2,2,2,2,2,2,2]) | ||
A proof of the minimal size in this case can be found in: | A proof of the minimal size in this case can be found in: | ||
| − | N. Johnston. The minimum size of qubit unextendible product bases. E-print: arXiv:1302.1604 [quant-ph], 2013. | + | N. Johnston. The minimum size of qubit unextendible product bases. In Proceedings of the 8th Conference on the |
| + | Theory of Quantum Computation, Communication and Cryptography (TQC 2013). E-print: arXiv:1302.1604 [quant-ph], 2013. | ||
ans = | ans = | ||
11 | 11 | ||
| − | </ | + | </syntaxhighlight> |
Unfortunately, there are also many cases where the minimum size of a UPB is not currently known. In these cases, and error is returned: | Unfortunately, there are also many cases where the minimum size of a UPB is not currently known. In these cases, and error is returned: | ||
| − | < | + | <syntaxhighlight> |
>> MinUPBSize([2,2,2,4]) | >> MinUPBSize([2,2,2,4]) | ||
??? Error using ==> MinUPBSize at 69 | ??? Error using ==> MinUPBSize at 69 | ||
The minimum size of UPBs in the specified space is not currently known. | The minimum size of UPBs in the specified space is not currently known. | ||
| − | </ | + | </syntaxhighlight> |
==Notes== | ==Notes== | ||
| − | The minimum size of UPBs is not known in full generality yet! If you know of another case that has been solved that isn't contained in this script, please e-mail me (my e-mail address is in the header of | + | The minimum size of UPBs is not known in full generality yet! If you know of another case that has been solved that isn't contained in this script, please e-mail me (my e-mail address is in the header of the source code below) the article reference. |
| + | |||
| + | {{SourceCode|name=MinUPBSize}} | ||
==References== | ==References== | ||
<references /> | <references /> | ||
Latest revision as of 16:36, 29 September 2014
| MinUPBSize | |
| Gives the minimum cardinality of an unextendible product basis in given dimensions | |
| Other toolboxes required | none |
|---|---|
| Related functions | UPB |
| Function category | Unextendible product bases |
MinUPBSize is a function that returns that minimum numbers of vectors required in an unextendible product basis (UPB), given the dimensions of the local Hilbert spaces. If the minimum size of a UPB in the given space is not known, and error will be produced.
Syntax
- S = MinUPBSize(DIM)
- S = MinUPBSize(DIM,VERBOSE)
Argument descriptions
- DIM: A vector that specifies the local Hilbert space dimensions.
- VERBOSE (optional, default 1): A flag (either 1 or 0) indicating that a reference to a journal article that provides a proof of the minimal size claimed by this script will or will not be displayed.
Examples
The following code tells the user that the smallest UPB in \(\mathbb{C}^5 \otimes \mathbb{C}^6\) has \(10\) states, and points to the reference [1] for a proof of this fact:
>> MinUPBSize([5,6])
A proof of the minimal size in this case can be found in:
N. Alon and L. Lovasz. Unextendible product bases. J. Combinatorial Theory, Ser. A, 95:169-179, 2001.
ans =
10The following code gives the same information, but without displaying the reference:
>> MinUPBSize([5,6],0)
ans =
10The minimum size of UPBs is also known in many multipartite cases:
>> MinUPBSize([2,2,2,2,2,2,2,2])
A proof of the minimal size in this case can be found in:
N. Johnston. The minimum size of qubit unextendible product bases. In Proceedings of the 8th Conference on the
Theory of Quantum Computation, Communication and Cryptography (TQC 2013). E-print: arXiv:1302.1604 [quant-ph], 2013.
ans =
11Unfortunately, there are also many cases where the minimum size of a UPB is not currently known. In these cases, and error is returned:
>> MinUPBSize([2,2,2,4])
??? Error using ==> MinUPBSize at 69
The minimum size of UPBs in the specified space is not currently known.Notes
The minimum size of UPBs is not known in full generality yet! If you know of another case that has been solved that isn't contained in this script, please e-mail me (my e-mail address is in the header of the source code below) the article reference.
Source code
Click here to view this function's source code on github.
References
- ↑ N. Alon and L. Lovasz. Unextendible product bases. J. Combinatorial Theory, Ser. A, 95:169–179, 2001.