REVIEW 24 cited by
How to generate random matrices from the classical compact groups
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 24 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...
-
Counterexamples to additivity of minimum output $p$-R\'enyi entropy of quantum channels for $p>3/4$ and $0\leq p<1/4$
For every Rényi order p<1/4 or p>3/4, some finite-dimensional quantum channels have non-additive minimum output p-Rényi entropy.
-
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.
-
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...
-
Three Hamiltonians are Sufficient for Unitary $k$-Design in Temporal Ensemble
A three-step quench protocol with fixed Hamiltonians and random times forms unitary k-designs for arbitrary k; the two-step protocol cannot.
-
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...
-
Exact distinguishability between real-valued and complex-valued Haar random quantum states
The real Haar state twirl is diagonalized exactly, yielding the trace distance between real and complex Haar random states and new lower bounds on real-valued t-designs and imaginarity testing.
-
Decomposing Prediction Mechanisms for In-Context Recall
In a toy in-context recall task, label-based task initiation and observation-based continuation are distinct mechanisms with separate emergence times, and the same first-token versus second-token gap appears in an OLM...
-
Resolving Memorization in Empirical Diffusion Model for Manifold Data in High-Dimensional Spaces
Adding one inertia step to the empirical diffusion sampler turns memorization into manifold kernel density estimation, with an O(n^{-2/(d+4)}) Wasserstein-1 rate independent of ambient dimension.
-
A game theory for foundation models shows new paths to rational cooperation through similarity inference
Foundation-model agents that plan by predicting both the world and themselves can rationally cooperate in one-shot social dilemmas by inferring behavioral similarity from interaction history.
-
Sign-optimized Quantum Monte Carlo
Minimizing the phase of off-diagonal bond-Hamiltonian elements via local unitary rotations yields bases with better QMC average sign than computational or cluster eigenbases on frustrated Heisenberg models.
-
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.
-
Random matrix perspective on probabilistic error cancellation
Denoiser channels in probabilistic error cancellation inherit their complex spectra from random Lindblad operators; local noise creates a hierarchy of decay timescales.
-
Optimized Weight Initialization on the Stiefel Manifold for Deep ReLU Neural Networks
An initialization that maximizes a semi-orthogonal weight matrix's alignment with the all-ones vector prevents dying ReLU and keeps 100-layer ReLU networks trainable.
-
Identifying nonequilibrium degrees of freedom in high-dimensional stochastic systems
A quadratic classifier logit built from learned state embeddings converts forward-versus-reversed trajectory discrimination into a scalable entropy-production estimate plus a low-dimensional map of irreversible flow.
-
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.
-
Leveraging machine learning features for linear optical interferometer control
A supervised learning method linearizes the phase-dependence of a linear optical interferometer, so its unitary response can be modeled and programmed by least squares instead of non-convex optimization.
-
Reinforcement learning to learn quantum states for Heisenberg scaling accuracy
A reinforcement learning agent tunes evolution-strategy hyperparameters so quantum state learning reaches near-Heisenberg infidelity scaling with fewer successful measurements and transfers from 3 to 5 qubits.
-
Optimal Control by Variational Quantum Algorithms
The paper shows numerically that a variational quantum algorithm with an uncorrelated ansatz transfers a spin excitation across a chain in time close to the (N-1)/(2J0) bound, and proposes a W1-based control optimalit...
-
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.
-
Bi-cross validation for estimating spectral clustering hyper parameters
A method using bi-cross validation on the inverted Laplacian matrix to estimate spectral clustering hyperparameters, demonstrated on simulations and LCLS data, but lacking a proof and failing on one synthetic case.
Discussion (0). Continue with ORCID to comment.