Related papers: Ramp from Replica Trick
Recent advances in AdS/CFT holography have suggested that the near-horizon dynamics of black holes can be described by random matrix systems. We study how the energy spectrum of a system with a generic random Hamiltonian matrix affects its…
We consider the problem of low-rank rectangular matrix completion in the regime where the matrix $M$ of size $n\times m$ is ``long", i.e., the aspect ratio $m/n$ diverges to infinity. Such matrices are of particular interest in the study of…
The classic rank-revealing QR factorization factorizes a matrix $A$ as $AP=QR$ where $P$ permutes the columns of $A$, $Q$ is an orthogonal matrix, and $R$ is upper triangular with non-increasing diagonal entries. This is called…
Randomized sampling has recently been proven a highly efficient technique for computing approximate factorizations of matrices that have low numerical rank. This paper describes an extension of such techniques to a wider class of matrices…
We analyze Riemannian Hamiltonian Monte Carlo (RHMC) for sampling a polytope defined by $m$ inequalities in $\R^n$ endowed with the metric defined by the Hessian of a convex barrier function. The advantage of RHMC over Euclidean methods…
In this work we give an efficient construction of unitary $k$-designs using $\tilde{O}(k\cdot poly(n))$ quantum gates, as well as an efficient construction of a parallel-secure pseudorandom unitary (PRU). Both results are obtained by giving…
We study random submatrices of a large matrix A. We show how to approximately compute A from its random submatrix of the smallest possible size O(r log r) with a small error in the spectral norm, where r = ||A||_F^2 / ||A||_2^2 is the…
Matrix completion, i.e., the exact and provable recovery of a low-rank matrix from a small subset of its elements, is currently only known to be possible if the matrix satisfies a restrictive structural constraint---known as {\em…
The spectral fluctuations of a quantum Hamiltonian system with time-reversal symmetry are studied in the semiclassical limit by using periodic-orbit theory. It is found that, if long periodic orbits are hyperbolic and uniformly distributed…
We consider quantum graphs with spin-orbit couplings at the vertices. Time-reversal invariance implies that the bond S-matrix is in the orthogonal or symplectic symmetry class, depending on spin quantum number s being integer or…
This paper presents knowledge-aided space-time adaptive processing (KA-STAP) algorithms that exploit the low-rank dominant clutter and the array geometry properties (LRGP) for airborne radar applications. The core idea is to exploit the…
The value of spectral form factor at the origin, called level compressibility, is an important characteristic of random spectra. The paper is devoted to analytical calculations of this quantity for different random unitary matrices…
We introduce a variational scheme inspired by classical shadow tomography to compute ground state correlations of quantum spin Hamiltonians. Shadow tomography allows for efficient reconstruction of expectation values of arbitrary…
We design an efficient sampling algorithm to generate samples from the hardcore model on random regular bipartite graphs as long as $\lambda \lesssim \frac{1}{\sqrt{\Delta}}$, where $\Delta$ is the degree. Combined with recent work of…
We consider the reflection equation algebra for a finite dimensional R-matrix for the $(h,w)$-deformed Heisenberg algebra ${\cal U}_{h,w}(h(4))$. A representation of the reflection matrix $K$ is constructed using the matrix generators…
In this work, we focus on the high-dimensional trace regression model with a low-rank coefficient matrix. We establish a nearly optimal in-sample prediction risk bound for the rank-constrained least-squares estimator under no assumptions on…
We compute spectra of sample auto-covariance matrices of second order stationary stochastic processes. We look at a limit in which both the matrix dimension $N$ and the sample size $M$ used to define empirical averages diverge, with their…
In the fields of quantum mechanics and quantum information science, the traces of reduced density matrix powers play a crucial role in the study of quantum systems and have numerous important applications. In this paper, we propose a…
Low rank tensor representation (LRTR) methods are very useful for hyperspectral anomaly detection (HAD). To overcome the limitations that they often overlook spectral anomaly and rely on large-scale matrix singular value decomposition, we…
We connect quantum compact graphs with infinite leads, and turn them into scattering systems. We derive an exact expression for the scattering matrix, and explain how it is related to the spectrum of the corresponding closed graph. The…