How to generate random matrices from the classical compact groups

Abstract

We discuss how to generate random unitary matrices from the classical compact groups U(N), O(N) and USp(N) with probability distributions given by the respective invariant measures. The algorithm is straightforward to implement using standard linear algebra packages. This approach extends to the Dyson circular ensembles too. This article is based on a lecture given by the author at the summer school on Number Theory and Random Matrix Theory held at the University of Rochester in June 2006. The exposition is addressed to a general mathematical audience.

25 pages, 5 figures, corrected typos

Cited by in corpus (59)

• Measurement-driven entanglement transition in hybrid quantum circuits
• Realisation of a programmable two-qubit quantum processor
• Practical Bayesian Tomography
• Multifractal dimensions for random matrices, chaotic quantum maps, and many-body systems
• Cramér-Rao bounds for synchronization of rotations
• The Boundary for Quantum Advantage in Gaussian Boson Sampling
• How to efficiently select an arbitrary Clifford group element
• Search complexity and resource scaling for the quantum optimal control of unitary transformations
• Generating random quantum channels
• Deep learning of quantum entanglement from incomplete measurements
• Almost Markovian processes from closed dynamics
• Multilevel Monte Carlo simulation of Coulomb collisions
• Quantum simulation of thermodynamics in an integrated quantum photonic processor
• Quantum-enhanced tomography of unitary processes
• Analysing quantum systems with randomised measurements
• Roots of the derivative of the Riemann zeta function and of characteristic polynomials
• Similarity of Neural Network Models: A Survey of Functional and Representational Measures
• Auto-calibrating Universal Programmable Photonic Circuits: Hardware Error-Correction and Defect Resilience
• QuantumInformation.jl---a Julia package for numerical computation in quantum information theory
• A Versatile Low-Complexity Feedback Scheme for FDD Systems via Generative Modeling
• Quantum Otto cycle under strong coupling
• Waveguide lattice based architecture for multichannel optical transformations
• Bayesian homodyne and heterodyne tomography
• Sparse Bayesian Estimation of Parameters in Linear-Gaussian State-Space Models
• Equilibration times in clean and noisy systems
• Correlations enable lossless ergotropy transport
• Beyond islands: A free probabilistic approach
• libCreme: An optimization library for evaluating convex-roof entanglement measures
• Learning entanglement breakdown as a phase transition by confusion
• A QUBO Algorithm to Compute Eigenvectors of Symmetric Matrices
• Emergence of the Born rule in quantum optics
• The SWITCH test for discriminating quantum evolutions
• Fortran code for generating random probability vectors, unitaries, and quantum states
• On spectral and numerical properties of random butterfly matrices
• Computing quantum magic of state vectors
• No-iteration of unknown quantum gates
• Extremal spacings between eigenphases of random unitary matrices and their tensor products
• Quantum tomography with random diagonal unitary maps and statistical bounds on information generation using random matrix theory
• Topological delocalization in the completely disordered two-dimensional quantum walk
• Riemannian optimization for non-centered mixture of scaled Gaussian distributions
• Dimer states of Rydberg atoms on the Kagome lattice as resources for universal measurement-based quantum computation
• Entanglement Degradation in the Presence of Markovian Noise: a Statistical Analysis
• Commutators of random matrices from the unitary and orthogonal groups
• Spectral estimation from simulations via sketching
• Quantum Approximation of Normalized Schatten Norms and Applications to Learning
• Distribution of the number of pivots needed using Gaussian elimination with partial pivoting on random matrices
• Stochastic search for approximate compilation of unitaries
• Nonlinearity of the Fidelity in Open Qudit Systems: Gate and Noise Dependence in High-dimensional Quantum Computing
• URV Factorization with Random Orthogonal System Mixing
• Beyond the excised ensemble: modelling elliptic curve L-functions with random matrices
• Topology-optimized distributed 3d anisotropic Raman emission
• Sampling and the complexity of nature
• Quantum Chromodynamics: Computational Aspects
• Linear-optical protocols for mitigating and suppressing noise in bosonic systems
• Gaussian analytic functions and operator symbols of Dirichlet type
• Bi-cross validation for estimating spectral clustering hyper parameters
• On the neighbor spacing of eigenvalues of unitary matrices
• Mitigating quantum operation infidelity through engineering the distribution of photon losses
• Tensorization of neural networks for improved privacy and interpretability