Related papers: Random Real Valued and Complex Valued States Canno…
The entanglement content of high-dimensional random pure states is almost maximal, nevertheless, we show that, due to the complexity of such states, the detection of their entanglement using witness operators is rather difficult. We discuss…
We establish that an optimistic variant of Q-learning applied to a fixed-horizon episodic Markov decision process with an aggregated state representation incurs regret $\tilde{\mathcal{O}}(\sqrt{H^5 M K} + \epsilon HK)$, where $H$ is the…
We show that states on tensor products of matrix algebras whose ranks are relatively small are {\em almost surely} entangled, but that states of maximum rank are not. More precisely, let $M=M_m(\mathbb C)$ and $N=M_n(\mathbb C)$ be full…
We study random walks in a balanced, i.i.d. random environment in $\mathbb Z^d$ for $d\geq 3$. We establish improved convergence rates for the homogenization of the Dirichlet problem associated with the corresponding non-divergence form…
Minimum error state discrimination between two mixed states \rho and \sigma can be aided by the receipt of "classical side information" specifying which states from some convex decompositions of \rho and \sigma apply in each run. We…
The orthant model is a directed percolation model on $\mathbb{Z}^d$, in which all clusters are infinite. We prove a sharp threshold result for this model: if $p$ is larger than the critical value above which the cluster of $0$ is contained…
While it is known that Tr(\rho^n) can be measured directly (i.e., without first reconstructing the density matrix) by performing joint measurements on n copies of the same state rho, it is shown here that random measurements on single…
Unpredictability, or randomness, of the outcomes of measurements made on an entangled state can be certified provided that the statistics violate a Bell inequality. In the standard Bell scenario where each party performs a single…
We prove a \emph{query complexity} lower bound on rank-one principal component analysis (PCA). We consider an oracle model where, given a symmetric matrix $M \in \mathbb{R}^{d \times d}$, an algorithm is allowed to make $T$ \emph{exact}…
More than two multipartite orthogonal states cannot always be discriminated (with certainty) if only local operations and classical communication (LOCC) are allowed. Using an existing inequality among the measures of entanglement, we show…
Quantum information is nonlocal in the sense that local measurements on a composite quantum system, prepared in one of many mutually orthogonal states, may not reveal in which state the system was prepared. It is shown that in the many copy…
This paper addresses the detection of a low rank high-dimensional tensor corrupted by an additive complex Gaussian noise. In the asymptotic regime where all the dimensions of the tensor converge towards $+\infty$ at the same rate, existing…
We consider one copy of a quantum system prepared with equal prior probability in one of two non-orthogonal entangled states of multipartite distributed among separated parties. We demonstrate that these two states can be optimally…
The effective application of representation learning to real-world problems requires both techniques for learning useful representations, and also robust ways to evaluate properties of representations. Recent work in disentangled…
Distance covariance and distance correlation have been widely adopted in measuring dependence of a pair of random variables or random vectors. If the computation of distance covariance and distance correlation is implemented directly…
We show how to extend several basic concentration inequalities for simple random tensors $X = x_1 \otimes \cdots \otimes x_d$ where all $x_k$ are independent random vectors in $\mathbb{R}^n$ with independent coefficients. The new results…
The (im)possibility of local distinguishability of orthogonal multipartite quantum states still remains an intriguing question. Beyond $\mathbb{C}^{3}\otimes\mathbb{C}^{3}$, the problem remains unsolved even for maximally entangled states…
Order of magnitude reasoning - reasoning by rough comparisons of the sizes of quantities - is often called 'back of the envelope calculation', with the implication that the calculations are quick though approximate. This paper exhibits an…
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…
A distance matrix $A \in \mathbb R^{n \times m}$ represents all pairwise distances, $A_{ij}=\mathrm{d}(x_i,y_j)$, between two point sets $x_1,...,x_n$ and $y_1,...,y_m$ in an arbitrary metric space $(\mathcal Z, \mathrm{d})$. Such matrices…