How to generate random matrices from the classical compact groups
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 13 Pith papers
-
Quantum state isomorphism problems for groups
Quantum state isomorphism under group actions is BQP-hard for pure states across nontrivial groups and QSZK-complete for mixed states with finite groups; Pauli group version is BQP-complete and Clifford is GI-hard, ru...
-
Conservation Laws from Data Symmetry in Neural Networks
Data symmetries generically do not induce conserved quantities in NN training for analytic non-polynomial losses, but can for MSE with tensorizable networks.
-
The Singular Values of L\'evy's Area Matrix
Explicit density for singular values of Lévy's area matrix, determinantal point process characterization, and d to infinity asymptotics including absolute Cauchy limit.
-
Signature Kernel and Schwinger-Dyson Kernel Equations as Two-Parameter Rough Differential Equations
Signature kernel and Schwinger-Dyson kernel equations are recast as two-parameter rough differential equations with well-posedness, stability, and a numerical scheme established for rough driving signals.
-
GeoPAS: Geometric Probing for Algorithm Selection in Continuous Black-Box Optimization
GeoPAS represents optimization problems via multi-scale 2D geometric slices fed to a validity-aware CNN that aggregates embeddings for risk-aware solver selection and log-scale performance prediction, outperforming th...
-
Computing quantum magic of state vectors
Efficient algorithms compute stabilizer Rényi entropy and mana for quantum states from vectors at O(N d^{2N}) cost using fast Hadamard transform, with open-source implementation.
-
Generalised Entanglement Entropies from Unit-Invariant Singular Value Decomposition
Generalized entanglement entropies are constructed via left-, right-, and bi-invariant unit-invariant singular value decompositions to ensure scale invariance for non-Hermitian and rectangular operators in quantum mec...
-
Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm
Introduces a parallelizable hybrid tensor network algorithm for time-evolving matrix product states that combines classical BUG integration with quantum methods without synchronization barriers.
-
GeoPAS: Geometric Probing for Algorithm Selection in Continuous Black-Box Optimization
GeoPAS uses multi-scale 2D geometric slices of optimization landscapes with validity-mask pooling and a learned-plus-prior composite score to select from 12 solvers, cutting mean relative expected running time from 30...
-
Reconstructing the unitary part of a noisy quantum channel
Method to reconstruct the unitary component of a quantum channel from minimal mixed or pure state pairs, with resource comparisons to Choi-matrix methods for noisy dynamics and robustness to SPAM errors.
-
Engineering Precise and Robust Effective Hamiltonians
A framework is presented for designing robust and precise effective Hamiltonians by identifying the minimal toggling-frame subspace and the complete set of achievable zeroth-order terms.
-
Software compensation of trigger-synchronous control-frame errors in qubits and qudits
A software protocol measures and corrects trigger-synchronous coherent errors in trapped-ion qubits and qudits by updating control frequency and phase, raising single-qubit gate fidelity to 99.93(1)% and 16-level qudi...
-
Efficient Finite Initialization with Partial Norms for Tensorized Neural Networks and Tensor Networks Algorithms
Introduces two algorithms for efficient finite initialization of tensor network layers via iterative partial norm computations, applied to MPS/TT and MPO/TT-M layers with scaling analysis and public code.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.