The rational approximations of the unitary groups
Groups of unitary matrices occur commonly in quantum mechanics and other physical theories. A common problem in the practical application of such theories is that standard numerical approximations of these matrices are no longer unitary, due to round-off error. The authors provide a solution to this problem by approximating unitary matrices by unitary matrices such that the real and imaginary parts of each matrix element are rational numbers, so that round-off error can be avoided. The key to the approximation is the Householder reflection. It is the operator \textbf{M}\((v)=\)\textbf{I}\(-\frac{2 |v><v|}{<v|v>}\), in Dirac notation, where \(|v>\) is a complex \(d\)-dimensional vector and \textbf{I} is the identity operator. Thus, \textbf{M}\((v)\) is a unitary transformation that reflects the space \({\mathbb C}^d\) in the hyperplane perpendicular to \(|v>\). Up to a phase, any \(d\)-dimensional unitary operator \textbf{U} can be expressed as a product of \(d-1\) such reflections. Using standard results from Diophantine approximation theory, the authors show that any \(|v>\) can be approximated by a rational vector \(|v_r>\) such that \textbf{M}\((v_r)\) approximates \textbf{M}\((v)\) with arbitrary accuracy in the standard Frobenius norm. It follows that any unitary operator \textbf{U} can be approximated by a rational unitary operator with arbitrary accuracy. The authors work out the technical details of the random rational approximation and show that it is uniform with respect to the Haar measure on the unitary group. They discuss some applications to quantum information processes.
- 3D discrete rotations using hinge angles
- A bound for the spectral variation of a unitary operator
- A Characterization of Circles Which Contain Rational Points
- A new inequality with application to the theory of Diophantine approximation
- A useful form of unitary matrix obtained from any sequence of unit 2-norm n-vectors
- Contraction of matchgate tensor networks on non-planar graphs
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- How to generate random matrices from the classical compact groups
- scientific article; zbMATH DE number 3082021 (Why is no real title available?)
- Lagrangian representation for fermionic linear optics
- Matchgates and classical simulation of quantum circuits
- Optimizing the Coupling Between Two Isometric Projections of Matrices
- Perturbation and interlace theorems for the unitary eigenvalue problem
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Random matrix theory and (1/2+it).
- The characteristic polynomial of a random unitary matrix: a probabilistic approach
- The Generation of All Rational Orthogonal Matrices
- The variation of the spectrum of a normal matrix
- Unitary Groups: Representations and Decompositions
- The group of dyadic unitary matrices.
- Energy conservation and unitary approximation numbers
- Rational approximation of the unitary exponential
- A useful form of unitary matrix obtained from any sequence of unit 2-norm n-vectors
- Householder factorizations of unitary matrices
- Rational orthogonal approximations to orthogonal matrices
- There is an equivalence relation whose von Neumann algebra is not Connes embeddable
This page was built for publication: The rational approximations of the unitary groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2443904)
