Scaling a unitary matrix. (English) Zbl 1306.65198
Summary: The iterative method of R. Sinkhorn [Ann. Math. Stat. 35, 876–879 (1964; Zbl 0134.25302)] allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called ‘scaled matrix’ which is doubly stochastic, i.e. a matrix with all entries in the interval \((0,1)\) and with all line sums equal to 1. We conjecture that a similar procedure exists, which allows, starting from an arbitrary unitary matrix, to find a scaled matrix which is unitary and has all line sums equal to 1. The existence of such algorithm guarantees a powerful decomposition of an arbitrary quantum circuit.
MSC:
65F35 | Numerical computation of matrix norms, conditioning, scaling |
15A12 | Conditioning of matrices |
15B10 | Orthogonal matrices |
Citations:
Zbl 0134.25302References:
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.