Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userScaling a unitary matrix
264
0
0.0
(
0
)
Added by
Stijn De Baerdemacker
Publication date
2014
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
The iterative method of Sinkhorn 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.
rate research
Read More
In this paper we treat the time evolution of unitary elements in the N level system and consider the reduced dynamics from the unitary group U(N) to flag manifolds of the second type (in our terminology). Then we derive a set of differential equations of matrix Riccati types interacting with one another and present an important problem on a nonlinear superposition formula that the Riccati equation satisfies. Our result is a natural generalization of the paper {bf Chaturvedi et al} (arXiv : 0706.0964 [quant-ph]).
We give a proof of universality in the bulk of spectrum of unitary matrix models, assuming that the potential is globally $C^{2}$ and locally $C^{3}$ function. The proof is based on the determinant formulas for correlation functions in terms of polynomials orthogonal on the unit circle. We do not use asymptotics of orthogonal polynomials. We obtain the $sin$-kernel as a unique solution of a certain non-linear integro-differential equation.
Birkhoffs theorem tells that any doubly stochastic matrix can be decomposed as a weighted sum of permutation matrices. A similar theorem reveals that any unitary matrix can be decomposed as a weighted sum of complex permutation matrices. Unitary matrices of dimension equal to a power of~2 (say $2^w$) deserve special attention, as they represent quantum qubit circuits. We investigate which subgroup of the signed permutation matrices suffices to decompose an arbitrary such matrix. It turns out to be a matrix group isomorphic to the extraspecial group {bf E}$_{2^{2w+1}}^+$ of order $2^{2w+1}$. An associated projective group of order $2^{2w}$ equally suffices.
Using the results on the $1/n$-expansion of the Verblunsky coefficients for a class of polynomials orthogonal on the unit circle with $n$ varying weight, we prove that the local eigenvalue statistic for unitary matrix models is independent of the form of the potential, determining the matrix model. Our proof is applicable to the case of four times differentiable potentials and of supports, consisting of one interval.
Sinkhorn proved that every entry-wise positive matrix can be made doubly stochastic by multiplying with two diagonal matrices. In this note we prove a recently conjectured analogue for unitary matrices: every unitary can be decomposed into two diagonal unitaries and one whose row- and column sums are equal to one. The proof is non-constructive and based on a reformulation in terms of symplectic topology. As a corollary, we obtain a decomposition of unitary matrices into an interlaced product of unitary diagonal matrices and discrete Fourier transformations. This provides a new decomposition of linear optics arrays into phase shifters and canonical multiports described by Fourier transformations.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
