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 quantum and classical interconnects.
Singular value statistics of matrix products with truncated unitary matrices
1 Pith paper cite this work. Polarity classification is still indexing.
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.
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers
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 quantum and classical interconnects.