Pith. sign in

REVIEW 2 cited by

Singular value statistics of matrix products with truncated unitary matrices

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

arxiv 1501.03910 v1 pith:6N63MPCV submitted 2015-01-16 math.PR math-phmath.MP

classification math.PRmath-phmath.MP
keywords matrixunitarymatricessingulartruncateddistributedensemblespolynomial
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We prove that the squared singular values of a fixed matrix multiplied with a truncation of a Haar distributed unitary matrix are distributed by a polynomial ensemble. This result is applied to a multiplication of a truncated unitary matrix with a random matrix. We show that the structure of polynomial ensembles and of certain Pfaffian ensembles is preserved. Furthermore we derive the joint singular value density of a product of truncated unitary matrices and its corresponding correlation kernel which can be written as a double contour integral. This leads to hard edge scaling limits that also include new finite rank perturbations of the Meijer G-kernels found for products of complex Ginibre random matrices.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Hard edge asymptotics of correlation functions between singular values and eigenvalues

    math.PR 2025-01 conditional novelty 7.0 of 10

    For a broad class of bi-unitarily invariant random matrix ensembles, the large-n limit of the joint density of one eigenradius and k singular values at the hard edge is expressed through the limiting kernel of the sin...

  2. Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers

    quant-ph 2026-06 unverdicted novelty 5.0 of 10

    An algorithm is presented for estimating distribution complexity of electronic structure Hamiltonians, with O(N^3) entanglement estimation per fragment and quadratic/exponential reductions in distribution cost for qua...

Pith tools