How to generate random matrices from the classical compact groups

DOI10.48550/ARXIV.MATH-PH/0609050zbMath1156.22004arXivmath-ph/0609050MaRDI QIDQ94262

Publication date: 18 September 2006

Full work available at URL: https://arxiv.org/abs/math-ph/0609050

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Random matrices (algebraic aspects) (15B52) Real zeros of (L(s, chi)); results on (L(1, chi)) (11M20) Compact groups (22C05) Software, source code, etc. for problems pertaining to statistical mechanics (82-04)

Related Items (81)

Commutators of random matrices from the unitary and orthogonal groups ⋮ Modern compressive tomography for quantum information science ⋮ Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems ⋮ Randomized numerical linear algebra: Foundations and algorithms ⋮ Spectral estimation from simulations via sketching ⋮ Efficient computation of permanents, with applications to boson sampling and random matrices ⋮ Three-fold way of entanglement dynamics in monitored quantum circuits ⋮ The building game: from enumerative combinatorics to conformational diffusion ⋮ Interpretable domain adaptation via optimization over the Stiefel manifold ⋮ F-theory and neutrinos: Kaluza-Klein dilution of flavor hierarchy ⋮ Convergence rate for spectral distribution of addition of random matrices ⋮ Asymptotic behavior for log-determinants of several non-Hermitian random matrices ⋮ How to efficiently select an arbitrary Clifford group element ⋮ The entries of Haar-invariant matrices from the Classical compact groups ⋮ Zeroth-order optimization with orthogonal random directions ⋮ Identification of quantum hashes: numerical experiment ⋮ Higher-order time integration of Coulomb collisions in a plasma using Langevin equations ⋮ Sharp recovery bounds for convex demixing, with applications ⋮ Beyond islands: a free probabilistic approach ⋮ Local single ring theorem on optimal scale ⋮ Matchgate shadows for fermionic quantum simulation ⋮ \texttt{QOptCraft}: a python package for the design and study of linear optical quantum systems ⋮ Leading digit laws on linear Lie groups ⋮ Growth Factors of Random Butterfly Matrices and the Stability of Avoiding Pivoting ⋮ A unified approach to synchronization problems over subgroups of the orthogonal group ⋮ The permanent-on-top conjecture is false ⋮ The SWITCH test for discriminating quantum evolutions ⋮ Optimal approximation to unitary quantum operators with linear optics ⋮ A Recursively Recurrent Neural Network (R2N2) Architecture for Learning Iterative Algorithms ⋮ The effect of intrinsic dimension on the Bayes-error of projected quadratic discriminant classification ⋮ A reformulation-linearization technique for optimization over simplices ⋮ An efficient algorithm for decomposing a vector into two vectors with a small uniform norm ⋮ Direct state measurements under state-preparation-and-measurement errors ⋮ Renormalization of steered coherence and quantum phase transitions in the alternating Ising model ⋮ Graph connection Laplacian and random matrices with random blocks ⋮ \texttt{libCreme}: an optimization library for evaluating convex-roof entanglement measures ⋮ Hurwitz and the origins of random matrix theory in mathematics ⋮ An induced real quaternion spherical ensemble of random matrices ⋮ The rational approximations of the unitary groups ⋮ Neural Quadratic Discriminant Analysis: Nonlinear Decoding with V1-Like Computation ⋮ A variance formula related to a quantum conductance problem ⋮ Auto-regressive moving-average discrete-time dynamical systems and autocorrelation functions on real-valued Riemannian matrix manifolds ⋮ Hearing random matrices and random waves ⋮ Detecting entanglement of unknown quantum states with random measurements ⋮ On biunimodular vectors for unitary matrices ⋮ Invariant sums of random matrices and the onset of level repulsion ⋮ Random Matrices Generating Large Growth in LU Factorization with Pivoting ⋮ Local law of addition of random matrices on optimal scale ⋮ Unnamed Item ⋮ Least-squares approximation by elements from matrix orbits achieved by gradient flows on compact lie groups ⋮ The characteristic polynomial of a random unitary matrix: a probabilistic approach ⋮ Unsupervised streaming anomaly detection for instrumented infrastructure ⋮ Direct search methods on reductive homogeneous spaces ⋮ The Golden-Thompson inequality: Historical aspects and random matrix applications ⋮ Probability density function estimation with the frequency polygon transform ⋮ ROOPSD ⋮ Ensemble filter methods with perturbed observations applied to nonlinear problems ⋮ Sampling the eigenvalues of random orthogonal and unitary matrices ⋮ On spectral and numerical properties of random butterfly matrices ⋮ Learning algebraic varieties from samples ⋮ Multilevel Monte Carlo simulation of Coulomb collisions ⋮ Superresolution from a Single Noisy Image by the Median Filter Transform ⋮ A stochastic subspace approach to gradient-free optimization in high dimensions ⋮ Plot of CLT ⋮ Random stochastic matrices from classical compact Lie groups and symmetric spaces ⋮ Limit Operators for Circular Ensembles ⋮ Ewens Measures on Compact Groups and Hypergeometric Kernels ⋮ Simulated annealing for tensor network states ⋮ Thermoelectric transport properties of a chain of quantum dots with self-consistent reservoirs ⋮ Ordered level spacing probability densities ⋮ Gaussian analytic functions and operator symbols of Dirichlet type ⋮ Unnamed Item ⋮ Generating random quantum channels ⋮ Spectral rigidity for addition of random matrices at the regular edge ⋮ Statistical benchmark for BosonSampling ⋮ Practical Bayesian tomography ⋮ Generating Extreme-Scale Matrices With Specified Singular Values or Condition Number ⋮ Random-matrix theory for the Lindblad master equation ⋮ Approximation of quantum control correction scheme using deep neural networks ⋮ A Recursive Eigenspace Computation for the Canonical Polyadic Decomposition ⋮ Geometrical versus time-series representation of data in quantum control learning

This page was built for publication: How to generate random matrices from the classical compact groups