Related papers: A new estimation of the quantum Chernoff bound
One of the fundamental tenets of quantum mechanics is that non-orthogonal states cannot be distinguished perfectly. When distinguishing multiple copies of a mixed quantum state, a collective measurement, which generates entanglement between…
We study fine-grained error bounds for differentially private algorithms for counting under continual observation. Our main insight is that the matrix mechanism when using lower-triangular matrices can be used in the continual observation…
We consider the problem of estimating the spectral norm of a matrix using only matrix-vector products. We propose a new Counterbalance estimator that provides upper bounds on the norm and derive probabilistic guarantees on its…
We show a new duality between the polynomial margin complexity of $f$ and the discrepancy of the function $f \circ \textsf{XOR}$, called an $\textsf{XOR}$ function. Using this duality, we develop polynomial based techniques for…
We provide a compendium of inequalities between several quantum state distinguishability measures. For each measure these inequalities consist of the sharpest possible upper and lower bounds in terms of another measure. Some of these…
Combining the modified matrix-vector equation approach with the technique of Lyapunov majorant function and the Banach fixed point principle, we obtain new rigorous perturbation bounds for the LU and QR factorizations with normwise or…
In this paper, we establish several new versions of Bohr-type inequalities for bounded analytic functions in the unit disk by allowing $\varphi=\{\varphi_n(r)\}^{\infty}_{n=0}$ in place of the $\{r^n\}^{\infty}_{n=0}$ in the power series…
A new error bound for the linear complementarity problem is given when the involved matrix is a B-matrix. It is shown that this bound is sharper than some previous bounds [C.Q. Li, Y.T. Li. Note on error bounds for linear complementarity…
In multi-task learning (MTL) with each task involving graph-dependent data, existing generalization analyses yield a \emph{sub-optimal} risk bound of $O(\frac{1}{\sqrt{n}})$, where $n$ is the number of training samples of each task.…
We establish Chernoff-type bounds for the largest eigenvalue of sums of Hermitian random matrices generated by a time-inhomogeneous Markov chain. Our primary regime assumes a compact state space and contractivity of each Markov kernel in…
In this paper, we provide a new and sharper bound for the Legendre coefficients of differentiable functions and then derive a new error bound of the truncated Legendre series in the uniform norm. The key idea of proof relies on integration…
It is a key issue to characterize the model of standard quantum theory out of general models by an operational condition. The framework of General Probabilistic Theories (GPTs) is a new information theoretical approach to single out…
We introduce a new PAC-Bayes oracle bound for unbounded losses that extends Cram\'er-Chernoff bounds to the PAC-Bayesian setting. The proof technique relies on controlling the tails of certain random variables involving the Cram\'er…
Given a positive function $f$ on $(0,\infty)$ and a non-zero real parameter $\theta$, we consider a function $I_f^\theta(A,B,X)=Tr X^*(f(L_AR_B^{-1})R_B)^\theta(X)$ in three matrices $A,B>0$ and $X$. In the literature $\theta=\pm1$ has been…
The discrimination between non-orthogonal quantum states plays a pivotal role in quantum information processing and quantum technology. Strategies that minimize the error probability are of particular importance, but they are only known for…
This paper derives an inequality relating the p-norm of a positive 2 x 2 block matrix to the p-norm of the 2 x 2 matrix obtained by replacing each block by its p-norm. The inequality had been known for integer values of p, so the main…
We derive properties of powers of a function satisfying a second-order linear differential equation. In particular we prove that the n-th power of the function satisfies an (n+1)-th order differential equation and give a simple method for…
We show that any quantum algorithm deciding whether an input function $f$ from $[n]$ to $[n]$ is 2-to-1 or almost 2-to-1 requires $\Theta(n)$ queries to $f$. The same lower bound holds for determining whether or not a function $f$ from…
We present a new second-order oracle bound for the expected risk of a weighted majority vote. The bound is based on a novel parametric form of the Chebyshev- Cantelli inequality (a.k.a. one-sided Chebyshev's), which is amenable to efficient…
From a recent geometric generalization of Thermodynamic Uncertainty Relations (TURs) we derive novel upper bounds on the nonlinear response of an observable of an arbitrary system undergoing a change of probabilistic state. Various…