Bipartite unitary operators and quantum Latin squares
Tristan Benoist and I have just arXived our paper On bipartite unitary matrices generating subalgebra--preserving quantum operations. We characterize the set of bipartite unitary operators which give quantum operations preserving some subalgebra of the state space, independently of the state of the coupled environment. The main results in the paper deal with the cases of (block-)diagonal algebras and tensor algebras. I obtained similar results for different classes of quantum channels in a previous paper.
In this post I would like to discuss a marginal problem discussed in the preprint, that of quantum Latin squares. Latin squares are combinatorial objects which have received a lot of attention: they are simple but deep mathematical objects, and have found many applications, mainly in statistics, experience design, and information theory.
Definition 1 A Latin square is a matrix with the property that each row and each column of are permutations of .
Here is an example of a Latin square of size :
We are interested in a ''vector space'' version of Latin squares, called quantum Latin squares, a notion introduced in the recent work of Musto and Vicary. The generalization is obtained via the classical information quantum information dictionary, where alphabets are replaced by vector spaces and letters by unit vectors in those spaces.
Definition 2 A quantum Latin square (QLS) is a -tensor with the property that the vectors in each row and each column of form orthonormal bases of .
Below is an example of a QLS, taken from Musto and Vicary's paper, where is a basis of .
One can make some trivial observations right off the bat. First, the elements of a QLS must have unit Euclidean norm . The condition in the definition can be stated using the following matrices, having the vectors of as columns
for some fixed orthonormal basis of . Then, is a QLS iff the matrices , are unitary operators. Moreover, using these matrices, we can define a natural ''distance'' function to the set of quantum Latin squares
Every classical latin square can be seen as a quantum Latin square by using the same basis for all rows and columns: . For , there exist moreover purely ''quantum'' examples, such as the one pictured above. The set of quantum Latin squares is a real algebraic variety, since the unitarity conditions for the matrices and can be expressed as polynomial equations in the variables , .
In our paper, QLS appear in connection to bipartite unitary operators with the property that for all ancilla space density matrices , the quantum channel
leaves the diagonal subalgebra invariant (see Theorem 4.4).
We raise the question of finding a natural probability measure of the set . We propose such a measure, based on a non-commutative analog of the Sinkhorn-Knopp algorithm (see here and here for the original papers). The following algorithm is discussed in our paper. Below, we make use of an operator , which returns the angular part of the polar decomposition: if is the polar decomposition of , then ; in case the polar decomposition is not unique, one of the valid decompositions is considered.
- Input: The dimension and an error parameter
- Start with independent uniform points on the unit sphere of .
- While is -far from , do the steps (4-6)
- Define the matrix by making the rows of unitary:
- Define the matrix by making the rows of unitary:
- .
- Output: , an -approximate QLS.
We conjecture that the algorithm above converges for almost any choice of the random points at step (2). We have some numerical evidence for this claim, as well as a convergence proof for a close variant of the problem, where we replace the vector entries of the matrix by positive definite matrices (see the appendix of our paper).
The algorithm above was also discussed in a paper with Teo Banica on the quantum permutation group ; there, we were interested in the probability measure induced on by the uniform measure in step (2).
Finally, let me mention that there exists a different non-commutative generalization of the Sinkhorn algorithm, introduced by Gurvits in his paper where he shows that the weak membership problem for the set of separable states is NP-hard.