## How to Construct Minimal Unextendible Product Bases

In quantum information theory, a *product state* is a quantum state that can be written as an elementary tensor:

while states that can not be written in this form are called *entangled*. In this post, we will be investigating *unextendible product bases (UPBs)*, which are sets of mutually orthogonal product states with the property that no other product state is orthogonal to every member of .

In this post, we will be looking at how to construct small UPBs. Note that UPBs can more generally be defined on multipartite spaces (i.e., for arbitrary ), but for simplicity we stick with the bipartite (i.e., ) case in this blog post.

### Simple Examples

The most trivial unextendible product basis is simply the computational basis:

However, the above UPB is rather trivial – the unextendibility condition holds vacuously because spans the entire Hilbert space, so of course there is no product state (or *any* state) orthogonal to every member of .

It is known that when , the only UPBs that exist are trivial in this sense – they consist of a full set of states. We are more interested in UPBs that contain fewer vectors than the dimension of the Hilbert space (since, for example, these UPBs can be used to construct bound entangled states [1]). One of the first such UPBs to be constructed was called “Pyramid” [1]. To construct this UPB, define and , and let

Then the following set of 5 states in is a UPB:

where .

It is a straightforward calculation to verify that the members of are mutually orthogonal (and thus form a product basis). To verify that there is no product state orthogonal to every member of , we first observe that any 3 of the ‘s form a linearly independent set (verification of this claim is slightly tedious, but nonetheless straightforward). Thus there is no state that is orthogonal to more than 2 of the ‘s. Thus no product state is orthogonal to more than 2 + 2 = 4 members of , which verifies unextendibility.

### Minimum Size

One interesting question concerning unextendible product bases asks for their minimum cardinality. It was immediately noted that any UPB in must have cardinality at least . To see this, suppose for a contradiction that there existed a UPB containing or fewer product states. Then we could construct another product state that is orthogonal to members of on and another members of on , for a total of members of , which shows that is extendible.

Despite being such a simple lower bound, it is also attainable for many values of [2] (and very close to attainable in the other cases [3,4]). The goal of this post is to focus on the case when there exists a UPB of cardinality , which is characterized by the following result of Alon and Lovász:

**Theorem [2].** There exists a UPB in of (necessarily minimal) size if and only if and at least one of or is odd.

In spite of the above result that demonstrates the existence of a UPB of the given minimal size in many cases, how to actually construct such a UPB in these cases is not immediately obvious, and is buried throughout the proofs of [2] and its references. The goal of the rest of this post is to make the construction of a minimal UPB in these cases explicit.

### Orthogonality Graphs

The *orthogonality graph* of a set of product states in is graph with coloured edges (there are 2 colours) on vertices (one for each product state), such that there is an edge connecting two vertices with the th colour if and only if the two corresponding product states are orthogonal on the th party.

For example, the orthogonality graph of the Pyramid UPB introduced earlier is illustrated below. Black edges represent states that are orthogonal on the first party, and red dotted edges represent states that are orthogonal on the second party.

If the product states under consideration are mutually orthogonal, then their orthogonality graph is the complete graph . Unextendibility is a bit more difficult to determine, but nonetheless a useful technique for constructing UPBs is to first choose a colouring of the edges of , and then try to construct product states that lead to that colouring.

### A Minimal Construction

In the orthogonality graph of the Pyramid UPB, all of the edges that connect a vertex to a neighbouring vertex are coloured black, and all other edges are coloured red. We can construct minimal UPBs by generalizing this graph in a natural way. Suppose without loss of generality that is odd, and we wish to construct a UPB of size . We construct the orthogonality graph by arranging vertices in a circle and connecting any vertices that are a distance of or less from each other via a black edge. All other edges are coloured red. For example, in the case, this gives the orthogonality graph above. In the case, this gives the orthogonality graph below.

Our goal now is to construct product states that have the given orthogonality graph. This is straightforward to do, since every state must be orthogonal to of the other states on and orthogonal to the other states on . Thus, we can just pick arbitrarily, then pick randomly subject to the constraint that it is orthogonal to on the first subsystem, and so on, working our way clockwise around the orthogonality graph, generating each product state randomly subject to the orthogonality conditions.

Furthermore, it can be shown (but will not be shown here – the techniques are similar to those of [4] and are a bit technical) that this procedure leads to a product basis that is in fact unextendible with probability 1. In order to verify unextendibility explicitly, one approach is to check that any subset of of the product states are linearly independent on and any subset of of the product states are linearly independent on .

**References**

- 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. Alon and L. Lovász. Unextendible product bases.
*J. Combinatorial Theory, Ser. A*, 95:169–179, 2001. - K. Feng. Unextendible product bases and 1-factorization of complete graphs.
*Discrete Appl. Math.*, 154:942–949, 2006. - J. Chen and N. Johnston. The minimum size of unextendible product bases in the bipartite case (and some multipartite cases). Comm. Math. Phys., 333(1):351–365, 2015. E-print: arXiv:1301.1406 [quant-ph]

## Recent Comments