Related papers: Diagonal approximation of the form factor of the u…
The form factor of a quantum graph is a function measuring correlations within the spectrum of the graph. It can be expressed as a double sum over the periodic orbits on the graph. We propose a scheme which allows one to evaluate the…
We analyze effective approximation of unitary matrices. In our formulation, a unitary matrix is represented as a product of rotations in two-dimensional subspaces, so-called Givens rotations. Instead of the quadratic dimension dependence…
We adopt the concept of the composite parameterization of the unitary group U(d) to the special unitary group SU(d). Furthermore, we also consider the Haar measure in terms of the introduced parameters. We show that the well-defined…
Using periodic-orbit theory beyond the diagonal approximation we investigate the form factor, $K(\tau)$, of a generic quantum graph with mixing classical dynamics and time-reversal symmetry. We calculate the contribution from pairs of…
A dimension group is a partially ordered countable group such that (1) every finite subset is contained in an ordered subgroup which is a finite direct power of Z and (2) the group has an order unit i.e. a positive element u such that every…
Unitary transformations and density matrices are central objects in quantum physics and various tasks require to introduce them in a parameterized form. In the present article we present a parameterization of the unitary group…
Diagonalization, or eigenvalue decomposition, is very useful in many areas of applied mathematics, including signal processing and quantum physics. Matrix decomposition is also a useful tool for approximating matrices as the product of a…
We find a combinatorial formula for the Haar functional of the orthogonal and unitary quantum groups. As an application, we consider diagonal coefficients of the fundamental representation, and we investigate their spectral measures.
Recall that a unitary in a tracial von Neumann algebra is Haar if $\tau(u^n)=0$ for all $n\in \mathbb{N}$. We introduce and study a new Borel equivalence relation $\sim_N$ on the set of Haar unitaries in a diffuse tracial von Neumann…
For certain types of quantum graphs we show that the random-matrix form factor can be recovered to at least third order in the scaled time $\tau$ from periodic-orbit theory. We consider the contributions from pairs of periodic orbits…
We prove the decomposition of arbitrary diagonal operators into tensor and matrix products of smaller matrices, focusing on the analytic structure of the resulting formulas and their inherent symmetries. Diagrammatic representations are…
The set of diagonals of real symmetric matrices of given non negative spectrum is endowed with a measure which is obtained by the push forward of the Haar measure of the real orthogonal group.\\ We prove that the Radon Nicodym derivation of…
Composed ensembles of random unitary matrices are defined via products of matrices, each pertaining to a given canonical circular ensemble of Dyson. We investigate statistical properties of spectra of some composed ensembles and demonstrate…
We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in…
It has been shown that for a certain special type of quantum graphs the random-matrix form factor can be recovered to at least third order in the scaled time \tau using periodic-orbit theory. Two types of contributing pairs of orbits were…
We give a new quantum circuit approximation of quantum multiplexors based on the idea of complexity theory oracles. As an added bonus, our multiplexor approximation immediately gives a quantum circuit approximation of diagonal unitary…
Let $X$ be a compact metric space which is locally absolutely retract and let $\phi: C(X)\to C(Y, M_n)$ be a unital homomorphism, where $Y$ is a compact metric space with ${\rm dim}Y\le 2.$ It is proved that there exists a sequence of $n$…
Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…
In this work we study a version of the general question of how well a Haar distributed orthogonal matrix can be approximated by a random gaussian matrix. Here, we consider a gaussian random matrix $Y_n$ of order $n$ and apply to it the…
We consider a unitary representation of the Dihedral group $D_{2n}% =\mathbb{Z}_{n}\rtimes\mathbb{Z}_{2}$ obtained by inducing the trivial character from the co-normal subgroup $\left\{0\right\}\rtimes\mathbb{Z}_{2}.$ This representation is…