相关论文: Recovery map stability for the Data Processing Ine…
In this paper, we investigate the recovery of the absorption coefficient from boundary data assuming that the region of interest is illuminated at an initial time. We consider a sufficiently strong and isotropic, but otherwise unknown…
We study the dynamic response of a two-dimensional system of itinerant fermions in the vicinity of a uniform ($\mathbf{Q}=0$) Ising nematic quantum critical point of $d-$wave symmetry. The nematic order parameter is not a conserved…
Based on the problem of quantum data compression in a lossless way, we present here an operational interpretation for the family of quantum R\'enyi entropies. In order to do this, we appeal to a very general quantum encoding scheme that…
We have developed an approximate signal recovery algorithm with low computational cost for compressed sensing on the basis of randomly constructed sparse measurement matrices. The law of large numbers and the central limit theorem suggest…
We give an integrability criterion on a real-valued non-increasing function $\psi$ guaranteeing that for almost all (or almost no) pairs $(A, \textbf{b})$, where $A$ is a real $m\times n$ matrix and $\textbf{b} \in \mathbb{R}^m$, the system…
The fundamental goal of information theory is to characterize complex operational tasks using efficiently computable information quantities, Shannon's capacity formula being the prime example of this. However, many tasks in quantum…
We study the penguin over tree ratio in $D\rightarrow \pi\pi$ decays. This ratio can serve as a probe for rescattering effects. Assuming the Standard Model and in the isospin limit, we derive expressions that relate both the magnitude and…
We give an effective bound of the joint spectral radius $\rho(\Sigma)$ for a finite set $\Sigma$ of nonnegative matrices: For every $n$, \[ \sqrt[n]{\left(\frac{V}{UD}\right)^{D} \max_C \max_{i,j\in C} \max_{A_1,\dots,A_n\in\Sigma}(A_1\dots…
We present a numerically feasible semiclassical (SC) method to evaluate quantum fidelity decay (Loschmidt echo, FD) in a classically chaotic system. It was thought that such evaluation would be intractable, but instead we show that a…
Data-processing is a desired property of classical and quantum divergences and information measures. In information theory, the contraction coefficient measures how much the distinguishability of quantum states decreases when they are…
The noisiness of a channel can be measured by comparing suitable functionals of the input and output distributions. For instance, the worst-case ratio of output relative entropy to input relative entropy for all possible pairs of input…
We prove an exponential decay concentration inequality to bound the tail probability of the difference between the log-likelihood of discrete random variables on a finite alphabet and the negative entropy. The concentration bound we derive…
We give a quasipolynomial time algorithm for the graph matching problem (also known as noisy or robust graph isomorphism) on correlated random graphs. Specifically, for every $\gamma>0$, we give a $n^{O(\log n)}$ time algorithm that given a…
The PhaseLift algorithm is an effective convex method for solving the phase retrieval problem from Fourier measurements with coded diffraction patterns (CDP). While exact reconstruction guarantees are well-established in the noiseless case,…
The \emph{Single-Source Personalized PageRank} (SSPPR) query is central to graph OLAP, measuring the probability $\pi(s,t)$ that an $\alpha$-decay random walk from node $s$ terminates at $t$. Despite decades of research, a significant gap…
While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, up to now Shannon's entropy power inequality (EPI) is an exception: Existing information theoretic proofs of the…
We describe a quantum algorithm to estimate the $\alpha$-Renyi entropy of an unknown density matrix $\rho\in\mathcal{C}^{d\times d}$ for $\alpha\neq 1$ by combining the recent technique of quantum singular value transformations with the…
We study the algorithmic thresholds for principal component analysis of Gaussian $k$-tensors with a planted rank-one spike, via Langevin dynamics and gradient descent. In order to efficiently recover the spike from natural initializations,…
We study potential presence of statistical-computational gaps (SCG) in symmetric binary perceptrons (SBP) via a parametric utilization of \emph{fully lifted random duality theory} (fl-RDT) [96]. A structural change from decreasingly to…
A Fixed-Parameter Tractable (\FPT) $\rho$-approximation algorithm for a minimization (resp. maximization) parameterized problem $P$ is an FPT algorithm that, given an instance $(x, k)\in P$ computes a solution of cost at most $k \cdot…