Entropy and singular-value moments of products of truncated random unitary matrices

• URL: http://arxiv.org/abs/2501.11085v1
• Date: Sun, 19 Jan 2025 15:46:08 GMT
• Title: Entropy and singular-value moments of products of truncated random unitary matrices
• Authors: C. W. J. Beenakker,
• Abstract summary: Products of truncated unitary matrices can be used to study universal aspects of monitored quantum circuits. In entropy reduction crosses over from a linear to a logarithmic dependence on $tau$ when this parameter crosses unity. Result is an expression for the singular-value moments of the matrix product in terms of the Erlang function from queueing theory.
• Score: 0.0
• License:
• Abstract: Products of truncated unitary matrices, independently and uniformly drawn from the unitary group, can be used to study universal aspects of monitored quantum circuits. The von Neumann entropy of the corresponding density matrix decreases with increasing length $L$ of the product chain, in a way that depends on the matrix dimension $N$ and the truncation depth $\delta N$. Here we study that dependence in the double-scaling limit $L,N\rightarrow\infty$, at fixed ratio $\tau=L\delta N/N$. The entropy reduction crosses over from a linear to a logarithmic dependence on $\tau$ when this parameter crosses unity. The central technical result is an expression for the singular-value moments of the matrix product in terms of the Erlang function from queueing theory.

Related papers

• Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
  Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks. In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
  arXiv  Detail & Related papers  (2024-04-29T15:04:07Z)
• The matrix permanent and determinant from a spin system [0.0]
  Gauss-Jordan for the determinant of $M$ is then equivalent to the successive removal of the generalized zero eigenspace of the fermionic $breveM$. Our analysis may point the way to new strategies for classical and quantum evaluation of the permanent.
  arXiv  Detail & Related papers  (2023-07-10T16:34:55Z)
• Quantifying nonstabilizerness of matrix product states [0.0]
  We show that nonstabilizerness, as quantified by the recently introduced Stabilizer R'enyi Entropies (SREs), can be computed efficiently for matrix product states (MPSs) We exploit this observation to revisit the study of ground-state nonstabilizerness in the quantum Ising chain, providing accurate numerical results up to large system sizes.
  arXiv  Detail & Related papers  (2022-07-26T17:50:32Z)
• An Equivalence Principle for the Spectrum of Random Inner-Product Kernel Matrices with Polynomial Scalings [21.727073594338297]
  This study is motivated by applications in machine learning and statistics. We establish the weak limit of the empirical distribution of these random matrices in a scaling regime. Our results can be characterized as the free additive convolution between a Marchenko-Pastur law and a semicircle law.
  arXiv  Detail & Related papers  (2022-05-12T18:50:21Z)
• A Law of Robustness beyond Isoperimetry [84.33752026418045]
  We prove a Lipschitzness lower bound $Omega(sqrtn/p)$ of robustness of interpolating neural network parameters on arbitrary distributions. We then show the potential benefit of overparametrization for smooth data when $n=mathrmpoly(d)$. We disprove the potential existence of an $O(1)$-Lipschitz robust interpolating function when $n=exp(omega(d))$.
  arXiv  Detail & Related papers  (2022-02-23T16:10:23Z)
• Leverage Score Sampling for Tensor Product Matrices in Input Sparsity Time [54.65688986250061]
  We give an input sparsity time sampling algorithm for approximating the Gram matrix corresponding to the $q$-fold column-wise tensor product of $q$ matrices. Our sampling technique relies on a collection of $q$ partially correlated random projections which can be simultaneously applied to a dataset $X$ in total time.
  arXiv  Detail & Related papers  (2022-02-09T15:26:03Z)
• Exceptional points and domains of unitarity for a class of strongly non-Hermitian real-matrix Hamiltonians [0.0]
  A Hamiltonian of a closed (i.e., unitary) quantum system is assumed to have an $N$ by $N$ real-matrix form. We describe the quantum phase-transition boundary $partial cal D[N]$ at which the unitarity of the system is lost.
  arXiv  Detail & Related papers  (2021-04-22T12:27:09Z)
• High-Dimensional Gaussian Process Inference with Derivatives [90.8033626920884]
  We show that in the low-data regime $ND$, the Gram matrix can be decomposed in a manner that reduces the cost of inference to $mathcalO(N2D + (N2)3)$. We demonstrate this potential in a variety of tasks relevant for machine learning, such as optimization and Hamiltonian Monte Carlo with predictive gradients.
  arXiv  Detail & Related papers  (2021-02-15T13:24:41Z)
• Linear-Sample Learning of Low-Rank Distributions [56.59844655107251]
  We show that learning $ktimes k$, rank-$r$, matrices to normalized $L_1$ distance requires $Omega(frackrepsilon2)$ samples. We propose an algorithm that uses $cal O(frackrepsilon2log2fracepsilon)$ samples, a number linear in the high dimension, and nearly linear in the matrices, typically low, rank proofs.
  arXiv  Detail & Related papers  (2020-09-30T19:10:32Z)
• Linear Time Sinkhorn Divergences using Positive Features [51.50788603386766]
  Solving optimal transport with an entropic regularization requires computing a $ntimes n$ kernel matrix that is repeatedly applied to a vector. We propose to use instead ground costs of the form $c(x,y)=-logdotpvarphi(x)varphi(y)$ where $varphi$ is a map from the ground space onto the positive orthant $RRr_+$, with $rll n$.
  arXiv  Detail & Related papers  (2020-06-12T10:21:40Z)
• Information-Theoretic Limits for the Matrix Tensor Product [8.206394018475708]
  This paper studies a high-dimensional inference problem involving the matrix tensor product of random matrices. On the technical side, this paper introduces some new techniques for the analysis of high-dimensional matrix-preserving signals.
  arXiv  Detail & Related papers  (2020-05-22T17:03:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.