Until now, the length of minimal superpermutations has only been known when n ≤ 4: they have length 1, 3, 9, and 33 in these cases, respectively. It has been conjectured that minimal superpermutations have length for all n, and I am happy to announce that Ben Chaffin has proved this conjecture when n = 5. More specifically, he showed that minimal superpermutations in the n = 5 case have length 153, and there are exactly 8 such superpermutations (previously, it was only known that minimal superpermutations have either length 152 or 153 in this case, and there are at least 2 superpermutations of length 153).

The eight superpermutations that Ben found are available here (they’re too large to include in the body of this post). Notice that the first superpermutation is the well-known “easy-to-construct” superpermutation described here, and the second superpermutation is the one that was found in [1]. The other six superpermutations are new.

One really interesting thing about the six new superpermutations is that they are the first known minimal superpermutations to break the “gap pattern” that previously-known constructions have. To explain what I mean by this, consider the minimal superpermutation “123121321″ on three symbols. We can think about generating this superpermutation greedily: we start with “123″, then we append the character “1″ to add the permutation “231″ to the string, and then we append the character “2″ to add the permutation “312″ to the string. But now we are stuck: we have “12312″, and there is no way to append just one character to this string in such a way as to add another permutation to it: we have to append the *two* characters “13″ to get the new permutation “213″.

This phenomenon seemed to be fairly general: in all known small superpermutations on n symbols, there was always a point (approximately halfway through the superpermutation) where n-2 consecutive characters were “wasted”: they did not add any new permutations themselves, but only “prepared” the next symbol to add a new permutation.

However, none of the six new minimal superpermutations have this property: they all never have more than 2 consecutive “wasted” characters, whereas the two previously-known superpermutations each have a run of n-2 = 3 consecutive “wasted” characters. Thus these six new superpermutations are really quite different from any superpermutations that we currently know and love.

The idea of Ben’s search is to do a depth-first search on the placement of the “wasted” characters (recall that “wasted” characters were defined and discussed in the previous section). Since the shortest known superpermutation on 5 symbols has length 153, and there are 120 permutations of 5 symbols, and the first n-1 = 4 characters of the superpermutation *must* be wasted, we are left with the problem of trying to place 153 – 120 – 4 = 29 wasted characters. If we can find a superpermutation with only 28 wasted characters (other than the initial 4), then we’ve found a superpermutation of length 152; if we really need all 29 wasted characters, then minimal superpermutations have length 153.

So now we do the depth-first search:

- Find (via brute-force) the maximum number of permutations that we can fit in a string if we are allowed only 1 wasted character: the answer is 10 permutations (for example, the string “123451234152341″ does the job).
- Now find the maximum number of permutations that we can fit in a string if we are allowed 2 wasted characters. To speed up the search, once we have found a string that contains some number (call it p) of permutations, we can ignore all other strings that use a wasted character before p-10 permutations, since we know from the previous bullet point that the second wasted character can add at most 10 more permutations, for a total of (p-10)+10 = p permutations.
- We now repeat this process for higher and higher numbers of wasted characters: we find the maximum number of permutations that we can fit in a string with 3 wasted characters, using the results from the previous two bullets to speed up the search by ignoring strings that place 1 or 2 wasted characters too early.
- Etc.

The results of this computation are summarized in the following table:

Wasted characters | Maximum # of permutations |
---|---|

0 | 5 |

1 | 10 |

2 | 15 |

3 | 20 |

4 | 23 |

5 | 28 |

6 | 33 |

7 | 36 |

8 | 41 |

9 | 46 |

10 | 49 |

11 | 53 |

12 | 58 |

13 | 62 |

14 | 66 |

15 | 70 |

16 | 74 |

17 | 79 |

18 | 83 |

19 | 87 |

20 | 92 |

21 | 96 |

22 | 99 |

23 | 103 |

24 | 107 |

25 | 111 |

26 | 114 |

27 | 116 |

28 | 118 |

29 | 120 |

As we can see, it is not possible to place all 120 permutations in a string with 28 or fewer wasted characters, which proves that there is no superpermutation of length 152 in the n = 5 case. C code that computes the values in the above table is available here.

**Update [August 18, 2014]:** Robin Houston has found a superpermutation on 6 symbols of length 873 (i.e., the conjectured minimal length) with the interesting property that it never has more than one consecutive wasted character! The superpermutation is available here.

**References**

- N. Johnston. Non-uniqueness of minimal superpermutations.
*Discrete Mathematics*, 313:1553–1557, 2013.

where each is a real scalar and the sets and form orthonormal bases of .

The Schmidt decomposition theorem isn’t anything fancy: it is just the singular value decomposition in disguise (the ‘s are singular values of some matrix and the sets and are its left and right singular vectors). However, it tells us everything we could ever want to know about the entanglement of : it is entangled if and only if it has more than one non-zero , and in this case the question of “how much” entanglement is contained within is answered by a certain function of the ‘s.

Well, we can find a similar decomposition of mixed quantum states. If is a mixed quantum state then it can be written in its *operator-Schmidt decomposition*:

where each is a real scalar and the sets and form orthonormal bases of Hermitian matrices in (under the Hilbert–Schmidt inner product ).

Once again, we haven’t really done anything fancy: the operator-Schmidt decomposition is also just the singular value decomposition in disguise in almost the exact same way as the regular Schmidt decomposition. However, its relationship with entanglement of mixed states is much weaker (as we might expect from the fact that the singular value decomposition can be computed in polynomial time, but determining whether a mixed state is entangled or separable (i.e., not entangled) is expected to be hard [1]). In this post, we’ll investigate some cases when the operator-Schmidt decomposition *does* let us conclude that is separable or entangled.

One reasonably well-known method for proving that a mixed state is entangled is the *realignment criterion* [2,3]. What is slightly less well-known is that the realignment criterion can be phrased in terms of the coefficients in the operator-Schmidt decomposition of .

**Theorem 1 (realignment criterion).** Let have operator-Schmidt decomposition

If then is entangled.

*Proof.* The idea is to construct a specific entanglement witness that detects the entanglement in . In particular, the entanglement witness that we will use is . To see that is indeed an entanglement witness, we must show that for all and . Well, some algebra shows that

so it suffices to show that . To see this notice that

where the inequality is the Cauchy–Schwarz inequality and the equality comes from the fact that the sets and are orthonormal bases, so (and similarly for ).

Now that we know that is an entanglement witness, we must check that it detects the entanglement in (that is, we want to show that ). This is straightforward to show by making use of the fact that the sets and are orthonormal:

It follows that is entangled, which completes the proof.

A more popular formulation of the realignment criterion says that if we define the *realignment map* by and extending by linearity, and let denote the *trace norm* (i.e., the sum of the singular values), then implies that is entangled. The equivalence of these two formulations of the realignment criterion comes from the fact that the singular values of are exactly the coefficients in its operator-Schmidt decomposition.

We might naturally wonder whether we can prove that even more states are entangled based on their operator-Schmidt decomposition than those detected by the realignment criterion. The following theorem gives one sense in which the answer to this question is “no”: if we only look at “nice” functions of the coefficients then the realignment criterion gives the best method of entanglement detection possible.

**Theorem 2.** Let be a symmetric gauge function (i.e., a norm that is invariant under permutations and sign changes of the entries of the input vector). If we can conclude that is entangled based on the value of then it must be the case that .

*Proof.* Without loss of generality, we scale so that . We first prove two facts about .

**Claim 1:** for all mixed states . This follows from the fact that (which itself is kind of a pain to prove: it follows from the fact that the Schatten norm of the realignment map is , but if anyone knows of a more direct and/or simpler way to prove this, I’d love to see it). If we assume without loss of generality that then

as desired.

**Claim 2:** There exists a separable state for which equals any given value in the interval . To see why this is the case, first notice that there exists a separable state with and for all : the state is one such example. Similarly, there is a separable state with and for all : the state is one such example. Furthermore, it is straightforward to interpolate between these two extremes to find separable states (even product states) with for all and any value of . For such states we have

which can take any value in the interval as claimed.

By combining claims 1 and 2, we see that we could only ever use the value of to conclude that is entangled if . However, in this case we have

which completes the proof.

Theorem 2 can be phrased naturally in terms of the other formulation of the realignment criterion as well: it says that there is no unitarily-invariant matrix norm with the property that we can use the value of to conclude that is entangled, except in those cases where the trace norm (i.e., the realignment criterion) itself already tells us that is entangled.

Nonetheless, we can certainly imagine using functions of the coefficients that are *not* symmetric gauge functions. Alternatively, we could take into account some (hopefully easily-computable) properties of the matrices and . One such method for detecting entanglement that depends on the coefficients and the trace of each and is as follows.

**Theorem 3 [4,5].** Let have operator-Schmidt decomposition

If

then is entangled.

I won’t prove Theorem 3 here, but I will note that it is strictly stronger than the realignment criterion, which can be seen by showing that the left-hand side of Theorem 3 is at least as large as the left-hand side of Theorem 1. To show this, observe that

and

which is nonnegative.

Much like we can use the operator-Schmidt decomposition to sometimes prove that a state is entangled, we can also use it to sometimes prove that a state is separable. To this end, we will use the *operator-Schmidt rank* of , which is the number of non-zero coefficients in its operator-Schmidt decomposition. One trivial observation is as follows:

**Proposition 4.** If the operator-Schmidt rank of is then is separable.

*Proof.* If the operator-Schmidt rank of is then we can write for some . Since is positive semidefinite, it follows that either and are both positive semidefinite or both negative semidefinite. If they are both positive semidefinite, we are done. If they are both negative semidefinite then we can write and then we are done.

Somewhat surprisingly, however, we can go further than this: it turns out that all states with operator-Schmidt rank are also separable, as was shown in [6].

**Theorem 5 [6].** If the operator-Schmidt rank of is then is separable.

*Proof.* If has operator-Schmidt rank then it can be written in the form for some . Throughout this proof, we use the notation , and so on.

Since is positive semidefinite, so are each of its partial traces. Thus and are both positive semidefinite operators. It is then straightforward to verify that

What is important here is that we have found a rank- tensor decomposition of in which one of the terms is positive semidefinite. Now we define

and notice that for some (in order to do this, we actually need the partial traces of to be nonsingular, but this is easily taken care of by standard continuity arguments, so we’ll sweep it under the rug). Furthermore, is also positive semidefinite, and it is separable if and only if is separable. Since is positive semidefinite, we know that for all eigenvalues of and of . If we absorb scalars between and so that then this implies that for all . Thus and are both positive semidefinite. Furthermore, a straightforward calculation shows that

We now play a similar game as before: we define a new matrix

and notice that for some (similar to before, we note that there is a standard continuity argument that can be used to handle the fact that and might be singluar). The minimum eigenvalue of is then , which is non-negative as a result of being positive semidefinite. It then follows that

Since each term in the above decomposition is positive semidefinite, it follows that is separable, which implies that is separable, which finally implies that is separable.

In light of Theorem 6, it seems somewhat natural to ask how far we can push things: what values of the operator-Schmidt rank imply that a state is separable? Certainly we cannot expect all states with an operator-Schmidt rank of to be separable, since every state in has operator-Schmidt rank or less, and there are entangled states in this space (more concretely, it’s easy to check that the maximally-entangled pure state has operator-Schmidt rank ).

This left the case of operator-Schmidt rank open. Very recently, it was shown in [7] that a mixed state in with operator-Schmidt rank is indeed separable, yet there are entangled states with operator-Schmidt rank in .

**References**

- L. Gurvits. Classical deterministic complexity of Edmonds’ problem and quantum entanglement. In
*Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing*, pages 10–19, 2003. E-print: arXiv:quant-ph/0303055 - K. Chen and L.-A. Wu. A matrix realignment method for recognizing entanglement.
*Quantum Inf. Comput.*, 3:193–202, 2003. E-print: arXiv:quant-ph/0205017 - O. Rudolph. Some properties of the computable cross norm criterion for separability.
*Phys. Rev. A*, 67:032312, 2003. E-print: E-print: arXiv:quant-ph/0212047 - C.-J. Zhang, Y.-S. Zhang, S. Zhang, and G.-C. Guo. Entanglement detection beyond the cross-norm or realignment criterion.
*Phys. Rev. A*, 77:060301(R), 2008. E-print: arXiv:0709.3766 [quant-ph] - O. Gittsovich, O. Gühne, P. Hyllus, and J. Eisert. Unifying several separability conditions using the covariance matrix criterion.
*Phys. Rev. A*, 78:052319, 2008. E-print: arXiv:0803.0757 [quant-ph] - D. Cariello. Separability for weak irreducible matrices. E-print: arXiv:1311.7275 [quant-ph]
- D. Cariello. Does symmetry imply PPT property?. E-print: arXiv:1405.3634 [math-ph]

**Question.** How many different possible orderings are there of the numbers ?

To help illustrate what we mean by this question, consider the n = 2 case, where . Then the 3 possible products of and are , and it is straightforward to see that we must have , so there is only one possible ordering in the n = 2 case.

In the n = 3 case, we have and 6 possible products: . Some relationships between these 6 numbers are immediate, such as . However, it could be the case that either or (we ignore the degenerate cases where two products are equal to each other), so there are two different possible orderings in this case:

In this post, we will consider the problem of how many such orderings exist for larger values of n. This problem arises naturally from a problem in quantum entanglement: the number of such orderings is exactly the minimum number of linear matrix inequalities needed to characterize the eigenvalues of quantum states that are “PPT from spectrum” [1].

We now begin constructing upper bounds on the number of possible orderings of . Since we are counting orderings between numbers, a trivial upper bound is given by , since that is the number of possible orderings of arbitrary numbers. However, this quantity is a gross overestimate.

We can improve this upper bound by creating an matrix whose -entry is (note that this matrix is symmetric, positive semidefinite, and has rank 1, which is roughly how the connection to quantum entanglement arises). For example, in the n = 4 case, this matrix is as follows:

where we have used asterisks (*) to indicate entries that are determined by symmetry. The fact that implies that the rows and columns of the upper-triangular part of this matrix are decreasing. Thus we can get an upper bound to the solution to our problem by counting the number of ways that we can place the numbers (exactly once each) in the upper-triangular part of a matrix in such a way that the rows and columns of that upper-triangular part are decreasing. For example, this can be done in 2 different ways in the n = 3 case:

The matrix above on the left corresponds to the case discussed earlier, while the matrix above on the right corresponds to the case .

A formula for the number of such ways to place the integers in a matrix was derived in [2] (see also A003121 in the OEIS), which immediately gives us the following upper bound on the number of orderings of the products :

For n = 1, 2, 3, …, this formula gives the values 1, 1, 2, 12, 286, 33592, 23178480, …

Before improving the upper bound that we just presented, let’s first discuss why it is not actually a solution to the original question. In the n = 4 case, our best upper bound so far is 12, since there are 12 different ways to place the integers in the upper-triangular part of a matrix such that the rows and columns of that upper-triangular part are decreasing. However, one such placement is as follows:

The above matrix corresponds to the following inequalities in terms of :

The problem here is that there actually do not exist real numbers that satisfy the above string of inequalities. To see this, notice in particular that we have the following three inequalities: , , and . However, multiplying the first two inequalities together gives , so , which contradicts the third inequality.

More generally, there can not be indices such that we simultaneously have the following three inequalities:

, , and .

I am not aware of a general formula for the number integer matrices that do not lead to these types of “bad” inequalities, but I have computed this quantity for n ≤ 7 (C code is available here), which gives the following better upper bound on the number of possible orderings of the products for n = 1, 2, 3, …: 1,1,2,10,114,2612,108664, …, which we see is significantly smaller than the upper bound found in the previous section for n ≥ 5.

It is straightforward to write a script that generates random numbers and determines the resulting ordering of the pairwise products . By doing this, we can verify that the upper bounds from the previous section are in fact tight when n ≤ 5. However, when n = 6, we find that 4 of the 2612 potential orderings do not seem to actually be attained by any choice of . One of these “problematic” orderings is the one that arises from the following matrix:

The problem here is that the above matrix implies the following 5 inequalities:

However, multiplying the first four inequalities gives , so , which contradicts the fifth inequality above. We can similarly prove that the other 3 seemingly problematic orderings are in fact not attainable, so there are exactly 2608 possible orderings in the n = 6 case.

I haven’t been able to compute the number of orderings when n ≥ 7, as my methods for obtaining upper and lower bounds are both much too slow in these cases. The best bounds that I have in the n = 7 case say that the number of orderings is between 50900 and 108664, inclusive.

**Update [Feb. 13, 2014]:** Giovanni Resta has improved the lower bound in the n = 7 case to 107498, which narrows the n = 7 region down considerably. I’ve also improved the upper bound to 108146 (see this improved version of the C script). In all likelihood, 107498 is the correct number of orderings in this case, and it’s the upper bound 108146 that needs to be further improved.

**Update [Feb. 14, 2014]:** This sequence is now in the OEIS. See A237749.

**Update [Feb. 18, 2014]:** Hans Havermann has found a couple of references that talk about this problem (in the language of Golomb rulers) and compute all values for n ≤ 7. See [3] and [4].

**References**

- R. Hildebrand. Positive partial transpose from spectra.
*Phys. Rev. A*, 76:052325, 2007. E-print: arXiv:quant-ph/0502170 - R. M. Thrall. A combinatorial problem.
*Michigan Math. J.*, 1:81–88, 1952. - M. Beck, T. Bogart, and T. Pham. Enumeration of Golomb rulers and acyclic orientations of mixed graphs.
*Electron. J. Combin.*, 19:42, 2012. E-print: arXiv:1110.6154 [math.CO] - T. Pham.
*Enumeration of Golomb rulers*. Master’s Thesis, San Francisco State University, 2011.

After spinning my wheels on a problem for far too long, I’ve decided that it’s time to enlist the help of the mathematical and programming geniuses of the world wide web. The problem I’m interested in asks for a 4-by-11 matrix whose columns satisfy certain relationships. While the conditions are relatively easy to state, the problem size seems to be just slightly too large for me to solve myself.

The question I’m interested in (for reasons that are explained later in this blog post) is, given positive integers p and s, whether or not there exists a p-by-s matrix M with the following three properties:

- Every entry of M is a nonzero integer;
- The sum of any two columns of M contains a 0 entry; and
- There is no way to append a (s+1)th column to M so that M still has property 2.

In particular, I’m interested in whether or not such a matrix M exists when p = 4 and s = 11. But to help illustrate the above three properties, let’s consider the p = 3, s = 4 case first, where one such matrix M is:

The fact that M satisfies condition 2 can be checked by hand easily enough. For example, the sum of the first two columns of M is [0, -1, 3]^{T} which contains a 0 entry, and it is similarly straightforward to check that the other 5 sums of two columns of M each contain a 0 entry as well.

Checking property 3 is slightly more technical (NP-hard, even), but is still doable in small cases such as this one. For the above example, suppose that we could add a 5th column (which we will call z = [z_{1}, z_{2}, z_{3}]^{T}) to M such that its sum with any of the first 4 columns has a 0 entry. By looking at M’s first column, we see that one of z’s entries must be -1 (and by the cyclic symmetry of the entries of the last 3 columns of M, we can assume without loss of generality that z_{1} = -1). By looking at the last 3 columns of M, we then see that either z_{2} = 2 or z_{3} = -2, either z_{2} = 1 or z_{3} = 2, and either z_{2} = -2 or z_{3} = 1. Since there is no way to simultaneously satisfy all 3 of these requirements, no such column z exists.

As I mentioned earlier, the instance of this problem that I’m really interested in is when p = 4 and s = 11. Let’s first back up and briefly discuss what is known for different values of p and s:

**If s ≤ p then M does not exist.**To see this, simply note that property 3 can never be satisfied since you can always append one more column. If we denote the (i,j)-entry of M by m_{ij}and the i-th entry of the new column z by z_{i}, then you can choose z_{i}= -m_{ii}for i = 1, 2, …, s.**Given p, the smallest value of s for which M exists is:**(a) s = p+1 if p is odd, (b) s = p+2 if p = 4 or p ≡ 2 (mod 4), (c) s = p+3 if p = 8, and (d) s = p+4 otherwise. This result was proved in [1] (the connection between that paper and this blog post will be explained in the “Motivation” section below).**If s > 2**In this case, there is no way to satisfy property 2. This fact is trivial when p = 1 and can be proved for all p by induction (an exercise left to the reader?).^{p}then M does not exist.**If s = 2**To see this claim, let the columns of M be the 2^{p}then M exists.^{p}different columns consisting only of the entries 1 and -1. To see that property 2 is satisfied, simply notice that each column is different, so for any pair of columns, there is a row in which one column is 1 and the other column is -1. To see that property 3 is satisfied, observe that any new column must also consist entirely of 1′s and -1′s. However, every such column is already a column of M itself, and the sum of a column with itself will not have any 0 entries.**If s = 2**There is an inductive construction (with the p = 3, s = 4 example from the previous section as the base case) that works here. More specifically, if we let M^{p}– 4 (and p ≥ 3) then M exists._{p}denote a matrix M that works for a given value of p and s = 2^{p}– 4, we let B_{p}be the matrix from the s = 2^{p}case above, and 1_{k}denotes the row vector with k ones, then

is a solution to the problem for p’ = p+1 and s’ = 2^{p+1}– 4.**If 2**This is a non-trivial result that follows from [2].^{p}– 3 ≤ s ≤ 2^{p}– 1 then M does not exist.

Given p, the above results essentially tell us the largest and smallest values of s for which a solution M to the problem exists. However, we still don’t really know much about when solutions exist for intermediate values of s – we just have scattered results that say a solution does or does not exist in certain specific cases, without really illuminating what is going on. The following table summarizes what we know about when solutions do and do not exist for small values of p and s (a check mark ✓ means that a solution exists, a dash - means no solution exists, and ? means we don’t know).

s \ p | 1 | 2 | 3 | 4 | 5 |
---|---|---|---|---|---|

1 | - | - | - | - | - |

2 | ✓ | - | - | - | - |

3 | - | - | - | - | - |

4 | - | ✓ | ✓ | - | - |

5 | - | - | - | - | - |

6 | - | - | - | ✓ | ✓ |

7 | - | - | - | ✓ | - |

8 | - | - | ✓ | ✓ | ✓ |

9 | - | - | - | ✓ | ? |

10 | - | - | - | ✓ | ? |

11 | - | - | - | ? | ? |

12 | - | - | - | ✓ | ✓ |

13 | - | - | - | - | ✓ |

14 | - | - | - | - | ✓ |

15 | - | - | - | - | ✓ |

16 | - | - | - | ✓ | ✓ |

17 – 26 | - | - | - | - | ✓ |

27 | - | - | - | - | ? |

28 | - | - | - | - | ✓ |

29 | - | - | - | - | - |

30 | - | - | - | - | - |

31 | - | - | - | - | - |

32 | - | - | - | - | ✓ |

The table above shows why I am interested in the p = 4, s = 11 case: it is the only case when p ≤ 4 whose solution still is not known. The other unknown cases (i.e., p = 5 and s ∈ {9,10,11,27}, and far too many to list when p ≥ 6) would be interesting to solve as well, but are a bit lower-priority.

Some assumptions about the matrix M can be made without loss of generality, in order to reduce the search space a little bit. For example, since the values of the entries of M don’t really matter (other than the fact that they come in positive/negative pairs), the first column of M can always be chosen to consist entirely of ones (or any other value). Similarly, permuting the rows or columns of M does not affect whether or not it satisfies the three desired properties, so you can assume (for example) that the first row is in non-decreasing order.

Finally, since there is no advantage to having the integer k present in M unless -k is also present somewhere in M (i.e., if M does not contain any -k entries, you could always just replace every instance of k by 1 without affecting any of the three properties we want), we can assume that the entries of M are between -floor(s/2) and floor(s/2), inclusive.

The given problem arises from *unextendible product bases (UPBs)* in quantum information theory. A set of pure quantum states forms a UPB if and only if the following three properties hold:

- (product) Each state is a
*product state*(i.e., can be written in the form , where for all i); - (basis) The states are mutually orthogonal (i.e., for all i ≠ j); and
- (unextendible) There does not exist a product state with the property that for all j.

UPBs are useful because they can be used to construct quantum states with very strange entanglement properties [3], but their mathematical structure still isn’t very well-understood. While we can’t really expect an answer to the question of what sizes of UPBs are possible when the local dimensions are arbitrary (even just the *minimum* size of a UPB is still not known in full generality!), we might be able to hope for an answer if we focus on multi-qubit systems (i.e., the case when ).

In this case, the 3 properties above are isomorphic in a sense to the 3 properties listed at the start of this post. We associate each state with the j-th column of the matrix M. To each state in the product state decomposition of , we associate a unique integer in such a way that orthogonal states are associated with negatives of each other. The fact that for all i ≠ j is then equivalent to the requirement that te sum of any two columns of M has a 0 entry, and unextendibility of the product basis corresponds to not being able to add a new column to M without destroying property 2.

Thus this blog post is really asking whether or not there exists an 11-state UPB on 4 qubits. In order to illustrate this connection more explicitly, we return to the p = 3, s = 4 example from earlier. If we associate the matrix entries 1 and -1 with the orthogonal standard basis states and the entries 2 and -2 with the orthogonal states , then the matrix M corresponds to the following set of s = 4 product states in :

The fact that these states form a UPB is well-known – this is the “Shifts” UPB from [3], and was one of the first UPBs found.

**References**

- 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. - L. Chen and D. Ž. Ðjoković. Separability problem for multipartite states of rank at most four.
*J. Phys. A: Math. Theor.*, 46:275304, 2013. E-print: arXiv:1301.2372 [quant-ph] - C. H. Bennett, D. P. DiVincenzo, T. Mor, P. W. Shor, J. A. Smolin, and B. M. Terhal. Unextendible product bases and bound entanglement.
*Phys. Rev. Lett.*, 82:5385–5388, 1999. E-print: arXiv:quant-ph/9808030 - N. Johnston. The structure of qubit unextendible product bases. E-print: arXiv:1401.7920 [quant-ph], 2014.

In fact, even though is positive semidefinite (since it is a density matrix), the matrix in general can have negative eigenvalues. To see this, define and let , where

is the standard maximally-entangled pure state. It then follows that

,

which has eigenvalues equal to , eigenvalues equal to , and eigenvalues equal to .

The fact that can have negative eigenvalues is another way of saying that the transpose map is positive but not completely positive, and thus plays a big role in entanglement theory. In this post we consider the question of how exactly the partial transpose map can transform the eigenvalues of :

**Question.** For which ordered lists does there exist a density matrix such that has eigenvalues ?

In the case when is a pure state (i.e., has rank 1), we can completely characterize the eigenvalues of by making use of the Schmidt decomposition. In particular, we have the following:

**Theorem 1.** Let have Schmidt rank and Schmidt coefficients . Then the spectrum of is

,

together with the eigenvalue with multiplicity .

*Proof.* If has Schmidt decomposition

then

It is then straightforward to verify, for all , that:

- is an eigenvector with eigenvalue ;
- is an eigenvector with eigenvalue ; and
- , from which it follows that the remaining eigenvalues are .

Despite such a simple characterization in the case of rank-1 density matrices, there is no known characterization for general density matrices, since eigenvalues aren’t well-behaved under convex combinations.

Instead of asking for a complete characterization of the possible spectra of , for now we focus on the simpler question that asks how many of the eigenvalues of can be negative. Theorem 1 answers this question when is a pure state: the number of negative eigenvalues is , where r is the Schmidt rank of . Since , it follows that has at most negative eigenvalues when is a pure state.

It was conjectured in [1] that a similar fact holds for general (not necessarily pure) density matrices as well. In particular, they conjectured that if then has at most negative eigenvalues. However, this conjecture is easily shown to be false just by randomly-generating many density matrices and then counting the number of negative eigenvalues of ; density matrices whose partial transposes have more than negative eigenvalues are very common.

In [2,3], it was shown that if then can not have more than negative eigenvalues. In [4], this bound was shown to be tight when by explicitly constructing density matrices such that has negative eigenvalues. Similarly, this bound was shown to be tight via explicit construction when in [3]. Finally, it was shown in [5] that this bound is tight in general. That is, we have the following result:

**Theorem 2.** The maximum number of negative eigenvalues that can have when is .

It is worth pointing out that the method used in [5] to prove that this bound is tight is not completely analytic. Instead, a numerical method was presented that is proved to always generate a density matrix such that has negative eigenvalues. Code that implements this numerical procedure in MATLAB is available here, but no general analytic form for such density matrices is known.

Unfortunately, not a whole lot more is known about the spectrum of . Here are some miscellaneous other results that impose certain restrictions on its maximal and minimal eigenvalues (which we denote by and , respectively):

**Theorem 3 [3].** .

**Theorem 4 [2].** .

**Theorem 5 [6].** If has negative eigenvalues then

and

.

However, these bounds in general are fairly weak and the question of what the possible spectra of are is still far beyond our grasp.

**References**

- R. Xi-Jun, H. Yong-Jian, W. Yu-Chun, and G. Guang-Can. Partial transposition on bipartite system.
*Chinese Phys. Lett.*, 25:35, 2008. - N. Johnston and D. W. Kribs. A family of norms with applications in quantum information theory.
*J. Math. Phys.*, 51:082202, 2010. E-print: arXiv:0909.3907 [quant-ph] - S. Rana. Negative eigenvalues of partial transposition of arbitrary bipartite states.
*Phys. Rev. A*, 87:054301, 2013. E-print: arXiv:1304.6775 [quant-ph] - L. Chen, D. Z. Djokovic. Qubit-qudit states with positive partial transpose.
*Phys. Rev. A*, 86:062332, 2012. E-print: arXiv:1210.0111 [quant-ph] - N. Johnston. Non-positive-partial-transpose subspaces can be as large as any entangled subspace.
*Phys. Rev. A*, 87:064302, 2013. E-print: arXiv:1305.0257 [quant-ph] - N. Johnston.
*Norms and Cones in the Theory of Quantum Entanglement*. PhD thesis, University of Guelph, 2012.

Suppose that you want to watch the episodes of the TV series, consecutively, in the correct order. The question is: how many episodes must you watch in order to do this?

To illustrate what we mean by this question, suppose for now that n = 2 (i.e., the show was so terrible that it was cancelled after only 2 episodes). If we arbitrarily label one of the episodes “1″ and the other episode “2″, then we could watch the episodes in the order “1″, “2″, and then “1″ again. Then, regardless of which episode is really the first episode, we’ve seen the two episodes consecutively in the correct order. Furthermore, this is clearly minimal – there is no way to watch fewer than 3 episodes while ensuring that you see both episodes in the correct order.

So what is the minimal number of episodes we must watch for a TV show consisting of n episodes? Somewhat surprisingly, no one knows. So let’s discuss what *is* known.

Rephrased a bit more mathematically, we are interested in finding a shortest possible string on the symbols “1″, “2″, …, “n” that contains every permutation of those symbols as a contiguous substring. We call a string that contains every permutation in this way a *superpermutation*, and one of minimal length is called a *minimal superpermutation*. Minimal superpermutations when n = 1, 2, 3, 4 are easily found via brute-force computer search, and are presented here:

n | Minimal Superpermutation | Length |
---|---|---|

1 | 1 | 1 |

2 | 121 | 3 |

3 | 123121321 | 9 |

4 | 123412314231243121342132413214321 | 33 |

By the time n = 5, the strings we are looking for are much too long to find via brute-force. However, the strings in the n ≤ 4 cases provide some insight that we can hope might generalize to larger n. For example, there is a natural construction that allows us to construct a short superpermutation on n+1 symbols from a short superpermutation on n symbols (which we will describe in the next section), and this construction gives the minimal superpermutations presented in the above table when n ≤ 4.

Similarly, the minimal superpermutations in the above table can be shown via brute-force to be unique (up the relabeling the characters – for example, we don’t count the string “213212312″ as distinct from “123121321″, since they are related to each other simply by interchanging the roles of “1″ and “2″). Are minimal superpermutations unique for all n?

A trivial lower bound on the length of a superpermutation on n symbols is n! + n – 1, since it must contain each of the n! permutations as a substring – the first permutation contributes a length of n characters to the string, and each of the remaining n! – 1 permutations contributes a length of at least 1 character more.

It is not difficult to improve this lower bound to n! + (n-1)! + n – 2 (I won’t provide a proof here, but the idea is to note that when building the superpermutation, you can not add more than n-1 permutations by appending just 1 character each to the string – you eventually have to add 2 or more characters to add a permutation that is not already present). In fact, this argument can be stretched further to show that n! + (n-1)! + (n-2)! + n – 3 is a lower bound as well (a rough proof is provided here). However, the same arguments do **not** seem to extend to lower bounds like n! + (n-1)! + (n-2)! + (n-3)! + n – 4 and so on.

There is also a trivial upper bound on the length of a minimal superpermutation: n×n!, since this is the length of the string obtained by writing out the n! permutations in order without overlapping. However, there is a well-known construction of small superpermutations that provides a much better upper bound, which we now describe.

Suppose we know a small superpermutation on n symbols (such as one of the superpermutations provided in the table in the previous section) and we want to construct a small superpermutation on n+1 symbols. To do so, simply replace each permutation in the n-symbol superpermutation by: (1) that permutation, (2) the symbol n+1, and (3) that permutation again. For example, if we start with the 2-symbol superpermutation “121″, we replace the permutation “12″ by “12312″ and we replace the permutation “21″ by “21321″, which results in the 3-symbol superpermutation “123121321″. The procedure for constructing a 4-symbol superpermutation from this 3-symbol superpermutation is illustrated in the following diagram:

It is a straightforward inductive argument to show that the above method produces n-symbol superpermutations of length for all n. Although it has been conjectured that this superpermutation is minimal [1], this is only known to be true when n ≤ 4.

As a result of minimal superpermutations being unique when n ≤ 4, it has been conjectured that they are unique for all n [1]. However, it turns out that there are in fact *many* superpermutations of the conjectured minimal length – the main result of [2] shows that there are at least

distinct n-symbol superpermutations of the conjectured minimal length. For n ≤ 4, this formula gives the empty product (and thus a value of 1), which agrees with the fact that minimal superpermutations are unique in these cases. However, the number of distinct superpermutations then grows extremely quickly with n: for n = 5, 6, 7, 8, there are at least 2, 96, 8153726976, and approximately 3×10^{50} superpermutations of the conjectured minimal length. The 2 such superpermutations in the n = 5 case are as follows (each superpermutation has length 153 and is written on two lines):

12345123415234125341235412314523142531423514231542312453124351243152431254312

1345213425134215342135421324513241532413524132541321453214352143251432154321

and

12345123415234125341235412314523142531423514231542312453124351243152431254312

1354213524135214352134521325413251432513425132451321543215342153241532145321

Similarly, a text file containing all 96 known superpermutations of the expected minimal length 873 in the n = 6 case can be viewed here. It is unknown, however, whether or not these superpermutations are indeed minimal or if there are even more superpermutations of the conjectured minimal length.

**Update [Aug. 13, 2014]:** Ben Chaffin has shown that minimal superpermutations in the n = 5 case have length 153, and he has also shown that there are exactly 8 (not just 2) distinct minimal superpermutations in this case. See the write up here.

**References**

- D. Ashlock and J. Tillotson. Construction of small superpermutations and minimal injective superstrings.
*Congressus Numerantium*, 93:91–98, 1993.

- N. Johnston. Non-uniqueness of minimal superpermutations.
*Discrete Mathematics*, 313:1553–1557, 2013.

**Other Random Links Related to This Problem**

- A180632 – the main OEIS entry for this problem
- Permutation Strings – a short note written by Jeffrey A. Barnett about this problem
- Generate sequence with all permutations – a stackoverflow post about this problem
- What is the shortest string that contains all permutations of an alphabet? – a mathexchange post about this problem
- The shortest string containing all permutations of n symbols – an XKCD forums post that I made about this problem a couple years ago