Sinkhorn normal form for unitary matrices
Martin Idel, Michael M. Wolf
Introduction
For every matrix with positive entries there exist two diagonal matrices such that is doubly stochastic, i.e. the entries of each column and row sum up to one. This result was first obtained by Sinkhorn [Sin64], who also gave an algorithm how to compute and by iterated left and right multiplication of diagonal matrices.
Recently, De Vos and De Baerdemacker studied the same problem for unitary matrices [DVB14a]. They conjectured that for every unitary there exist two unitary diagonal matrices such that has all row and column sums equal to one. To support their conjecture, they construct an algorithm similar to the iteration procedure for matrices with positive entries from [Sin64, SK67]. They also provide numerical evidence that the algorithm always converges to a unitary matrix with row and column sums equal to one.
The goal of this paper is to prove the conjecture of De Vos and De Baerdemacker that such a normal form always exists by reformulating the problem in terms of symplectic topology. It turns out that the reformulated problem is a special case of the Arnold (sometimes Arnold-Givental) conjecture on the intersection of Lagrangian submanifolds [MS98], which was solved for this case in [BEP04, Cho04]. More precisely, in section 2 we show:
For every unitary matrix there exist two diagonal unitary matrices such that satisfies for all .
For a given unitary the triple is certainly not unique, since multiplying by a global phase and by its inverse does not change . Hence, it makes sense to consider the decomposition , where are unitary diagonal such that and . In particular, for , a simple complete solution was given in [DVB14a] from which one can see that for every non-diagonal matrix, there are only two different such that . For the picture is less clear and the reformulation in terms of symplectic topology appears to give further insight into the freedom of the decomposition.
In addition to the Sinkhorn-type normal form above, in section 3 we give several reformulations that might be interesting for applications, for instance regarding the decomposition of general port linear optics devices into canonical multiports and phase shifters.
Sinkhorn-type normal form
Likewise, since and is unitary, we obtain
so that columns and rows of sum up to one.
The definition is slightly different from the one in [BEP04], where the authors only consider nonempty open sets such that the restriction of to these sets is exact. However, they prove that the torus is displaceable in the above definition, if and only if there exists an open neighborhood such that is exact and is displaceable. With this we can state the final and crucial ingredient in the proof of the normal form:
Because every unitary matrix defines a Hamiltonian isotopy (see proposition 5 in the appendix), the theorem tells us in particular for all unitaries so that together with lemma 1 this proves the sought normal form:
For every unitary matrix there exist two diagonal unitary matrices such that fulfills for all .
Equivalent normal forms for unitary matrices
Now let be such that . Then and similarly, , which shows that
This decomposition has an immediate application in quantum optics, where any unitary corresponds to a passive transformation on modes or a multiport. In this scenario a diagonal unitary corresponds to a set of phase shifters, which are applied to the modes individually and the discrete Fourier transformation is known as canonical -multiport [MMW+95], which may be implemented by a symmetric fibre coupler. The structure of the corresponding decomposition is graphically depicted in Figure 1.
Let us finally discuss the question of uniqueness of these decompositions and to this end come back to the original normal form
where are unitary diagonal with and has row and column sums equal to 1. Counting parameters, using that the matrices are isomorphic to as proven above, we have:
parameters (c.f. [DVB14a]). Hence, the number of parameters matches exactly the dimension of . Given a unitary as above, this means that it might be reasonable to expect only a discrete set of different decompositions or at least a discrete set of that can be scaled to. The exact number of different can easily be seen to be two for the case (c.f. [DVB14a]), but already for and , there is only a conjectured bound (6 and 20, c.f. [Shc13]).
In [Cho04] it is proven that if and intersect transversally, their number of distinct intersection points must be at least , which follows from general results in Floer-homology theory when applied to Lagrangian intersection theory. Since transversality is a generic property for intersections, one might therefore conjecture that for a generic unitary [Cho04] implies a lower bound on the number of different normal forms. However, it is not true that we always have a discrete number of decompositions or (in contrast to the case) at least a discrete number of such that has row and column-sums equal to one and . A counterexample is given by the Fourier transform in dimensions, where we have for any :We thank the anonymous referee for providing this counterexample.
After completion of this document, we learned that part of this section, in particular corollary 1 were independently found in [DVB14b].
Conclusion
We have studied a variant of a Sinkhorn type normal form for unitary matrices. Its existence was conjectured in [DVB14a] and we give a nonconstructive proof. This means in particular that the question, whether the algorithm presented in [DVB14a] always converges for any set of starting conditions, remains open. Also, it would be nice to have an elementary proof of the fact that for any unitary matrix we have . The decomposition is in not unique: We provided an example where, contrary to the -case, there is a one-parameter set of as well as and , such that . We suggested an argument that the number of different decompositions, if it is discrete, might grow exponentially. However this lower bound relies on a lower bound on Lagrangian intersections which holds only for transversal intersections.
We thank Michael Keyl for many helpful comments on the parts involving symplectic topology. M. Idel is supported by the Studienstiftung des deutschen Volkes. M. Wolf acknowledges support from the CHIST-ERA/BMBF project CQC.
References
Appendix A Symplectic Preliminaries
This section introduces the definitions and results from symplectic topology beyond the first chapters of [MS98] needed to understand the basic reductions of the proof of theorem 1 in [BEP04].
Let be a closed symplectic manifold. If the manifold is simply connected (i.e. every loop is contractible)
In principle, the result also holds for arbitrary symplectic manifolds. One has to be more careful with non-compactly supported functions, but we can safely ignore these subtleties, since our manifold of interest will be closed.
Furthermore, let us recall that a Lagrangian submanifold of a -dimensional symplectic manifold is a smooth -dimensional submanifold of such that
A.2 The Clifford-torus as a Lagrangian submanifold
We now study the Clifford torus as a special case of the Lagrangian submanifold of interest for our result.
The next step is to show non-degeneracy. For this, note that if and only if pointwise, since is non-degenerate. But implies in particular and hence, as defined above is a non-degenerate 2-form.
since commutes with pullbacks and is closed. Since this holds on any patch , globally.
Then will be spanned by .