The generation of all rational orthogonal matrices
American Mathematical Monthly
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
SIAM Journal on Computing
SIAM Journal on Matrix Analysis and Applications
Optimizing the Coupling Between Two Isometric Projections of Matrices
SIAM Journal on Matrix Analysis and Applications
A Useful Form of Unitary Matrix Obtained from Any Sequence of Unit 2-Norm $n$-Vectors
SIAM Journal on Matrix Analysis and Applications
3D discrete rotations using hinge angles
Theoretical Computer Science
Lagrangian representation for fermionic linear optics
Quantum Information & Computation
Hi-index | 0.00 |
This paper is to investigate the rational approximation of the unitary groups. Specially, based on the Household decomposition we prove that the rational unitary subgroup is dense in the complex unitary group. Moreover, its random approximate property is characterized by the natural Harr measure, which can be used to obtain random unitary matrix. Our simulation shows that these results may be applied to approximate quantum computations.