Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer series in solid-state sciences

Products of Random Matrices

A. Crisanti, Giovanni Paladin, Angelo Vulpiani

Published Jan 1, 1993• 499 citations
Publisher
DOI
10.1007/978-3-642-84942-8

Related papers

Density Matrices

Klaus Bartschat

Springer handbooks•Jan 1, 2023•0 citations

Products of random matrices for disordered systems

A. Crisanti, G. Paladin, Maurizio Serva +1 more

Products of random transfer matrices are applied to low-dimensional disordered systems to evaluate numerically extensive quantities such as entropy and overlap probability distribution. The main advantage is the possiblity to avoid numerical differentiation. The method works for arbitrary disorder distributions at any temperature.

arXiv:cond-mat/9304023•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Feb 1, 1994•10 citations

DENSITY MATRICES

Richard P. Feynman

CRC Press eBooks•Mar 9, 2018•0 citations

Random unistochastic matrices

Karol Życzkowski, Marek Kuś, Wojciech S omczy ski +1 more

An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U ( N ) (or O ( N )). An ensemble of symmetric unistochastic matrices is obtained with use of unitary symmetric matrices pertaining to the circular orthogonal ensemble. We study the distribution of complex eigenvalues of bistochastic, unistochastic and orthostochastic matrices in the complex plane. We compute averages (entropy, traces) over the ensembles of unistochastic matrices and present inequalities concerning the entropies of products of bistochastic matrices.

arXiv:nlin/0112036•Journal of Physics A Mathematical and General•Mar 13, 2003•69 citations

DENSITY MATRICES

Mitchel Weissbluth

Elsevier eBooks•Jan 1, 1978•1 citation

Product Expansion of Random Codes via Analytic Techniques

Eshan Chattopadhyay, Noam Ringach, Nicholas Spooner

Beginning with the work of Dinur, Lin, and Vidick (FOCS, 2024), tensor codes with constant product expansion have been foundational to recent advances in quantum locally testable codes (qLTCs) based on cubical complexes. Informally, product expansion says that any low-weight parity check of the tensor code can be written as the sum of few parity checks of each component code in each dimension. Recent work of Kalachev and Panteleev (FOCS, 2025) showed that tensors of random linear codes have constant product expansion. In this work we initiate the study of random linear codes with prescribed automorphism groups. For every sufficiently large prime $k$, we construct pairs of rate $1/2$ MDS codes of length $2k$, over finite fields whose size depends on $k$, that have constant two-sided product expansion and are invariant under the simultaneous cyclic shift of two cycles of length $k$. This shift is the local action in the cube complexes of Rungtanapirom, Stix, and Vdovina (Internat. J. Algebra Comput., 2019). Along the way we give a proof of the existence of two-sided product expanding codes which, unlike the earlier result of [KP25], does not rely on explicit constructions of asymptotically optimal locally testable codes. Our proof relies on several new techniques that we view as interesting in their own right. Instead of working directly over finite fields, we work over the reals and use random Rademacher matrices for the generator matrices of the component codes. From here, we show how to relate product expansion to the operator norm of sparse restrictions of carefully chosen Gram matrices, which we bound using tools from random matrix theory. More generally, we propose a method for studying properties of random linear codes by lifting to random codes over $\mathbb{R}$ and $\mathbb{C}$, which we anticipate will be applicable more broadly to existential problems in coding theory.

arXiv:2610.02512•Oct 1, 2026•2 citations
An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U ( N ) (or O ( N )). An ensemble of symmetric unistochastic matrices is obtained with use of unitary symmetric matrices pertaining to the circular orthogonal ensemble. We study the distribution of complex eigenvalues of bistochastic, unistochastic and orthostochastic matrices in the complex plane. We compute averages (entropy, traces) over the ensembles of unistochastic matrices and present inequalities concerning the entropies of products of bistochastic matrices.
Beginning with the work of Dinur, Lin, and Vidick (FOCS, 2024), tensor codes with constant product expansion have been foundational to recent advances in quantum locally testable codes (qLTCs) based on cubical complexes. Informally, product expansion says that any low-weight parity check of the tensor code can be written as the sum of few parity checks of each component code in each dimension. Recent work of Kalachev and Panteleev (FOCS, 2025) showed that tensors of random linear codes have constant product expansion. In this work we initiate the study of random linear codes with prescribed automorphism groups. For every sufficiently large prime kkk, we construct pairs of rate 1/21/21/2 MDS codes of length 2k2k2k, over finite fields whose size depends on kkk, that have constant two-sided product expansion and are invariant under the simultaneous cyclic shift of two cycles of length kkk. This shift is the local action in the cube complexes of Rungtanapirom, Stix, and Vdovina (Internat. J. Algebra Comput., 2019). Along the way we give a proof of the existence of two-sided product expanding codes which, unlike the earlier result of [KP25], does not rely on explicit constructions of asymptotically optimal locally testable codes. Our proof relies on several new techniques that we view as interesting in their own right. Instead of working directly over finite fields, we work over the reals and use random Rademacher matrices for the generator matrices of the component codes. From here, we show how to relate product expansion to the operator norm of sparse restrictions of carefully chosen Gram matrices, which we bound using tools from random matrix theory. More generally, we propose a method for studying properties of random linear codes by lifting to random codes over R\mathbb{R}R and C\mathbb{C}C, which we anticipate will be applicable more broadly to existential problems in coding theory.