2,187 research outputs found
Quantum state discrimination bounds for finite sample size
In the problem of quantum state discrimination, one has to determine by
measurements the state of a quantum system, based on the a priori side
information that the true state is one of two given and completely known
states, rho or sigma. In general, it is not possible to decide the identity of
the true state with certainty, and the optimal measurement strategy depends on
whether the two possible errors (mistaking rho for sigma, or the other way
around) are treated as of equal importance or not. Results on the quantum
Chernoff and Hoeffding bounds and the quantum Stein's lemma show that, if
several copies of the system are available then the optimal error probabilities
decay exponentially in the number of copies, and the decay rate is given by a
certain statistical distance between rho and sigma (the Chernoff distance, the
Hoeffding distances, and the relative entropy, respectively). While these
results provide a complete solution to the asymptotic problem, they are not
completely satisfying from a practical point of view. Indeed, in realistic
scenarios one has access only to finitely many copies of a system, and
therefore it is desirable to have bounds on the error probabilities for finite
sample size. In this paper we provide finite-size bounds on the so-called Stein
errors, the Chernoff errors, the Hoeffding errors and the mixed error
probabilities related to the Chernoff and the Hoeffding errors.Comment: 31 pages. v4: A few typos corrected. To appear in J.Math.Phy
Uniform Chernoff and Dvoretzky-Kiefer-Wolfowitz-type inequalities for Markov chains and related processes
We observe that the technique of Markov contraction can be used to establish
measure concentration for a broad class of non-contracting chains. In
particular, geometric ergodicity provides a simple and versatile framework.
This leads to a short, elementary proof of a general concentration inequality
for Markov and hidden Markov chains (HMM), which supercedes some of the known
results and easily extends to other processes such as Markov trees. As
applications, we give a Dvoretzky-Kiefer-Wolfowitz-type inequality and a
uniform Chernoff bound. All of our bounds are dimension-free and hold for
countably infinite state spaces
Quantum hypothesis testing with group symmetry
The asymptotic discrimination problem of two quantum states is studied in the
setting where measurements are required to be invariant under some symmetry
group of the system. We consider various asymptotic error exponents in
connection with the problems of the Chernoff bound, the Hoeffding bound and
Stein's lemma, and derive bounds on these quantities in terms of their
corresponding statistical distance measures. A special emphasis is put on the
comparison of the performances of group-invariant and unrestricted
measurements.Comment: 33 page
User-friendly tail bounds for sums of random matrices
This paper presents new probability inequalities for sums of independent,
random, self-adjoint matrices. These results place simple and easily verifiable
hypotheses on the summands, and they deliver strong conclusions about the
large-deviation behavior of the maximum eigenvalue of the sum. Tail bounds for
the norm of a sum of random rectangular matrices follow as an immediate
corollary. The proof techniques also yield some information about matrix-valued
martingales.
In other words, this paper provides noncommutative generalizations of the
classical bounds associated with the names Azuma, Bennett, Bernstein, Chernoff,
Hoeffding, and McDiarmid. The matrix inequalities promise the same diversity of
application, ease of use, and strength of conclusion that have made the scalar
inequalities so valuable.Comment: Current paper is the version of record. The material on Freedman's
inequality has been moved to a separate note; other martingale bounds are
described in Caltech ACM Report 2011-0
Sampling-based proofs of almost-periodicity results and algorithmic applications
We give new combinatorial proofs of known almost-periodicity results for
sumsets of sets with small doubling in the spirit of Croot and Sisask, whose
almost-periodicity lemma has had far-reaching implications in additive
combinatorics. We provide an alternative (and L^p-norm free) point of view,
which allows for proofs to easily be converted to probabilistic algorithms that
decide membership in almost-periodic sumsets of dense subsets of F_2^n.
As an application, we give a new algorithmic version of the quasipolynomial
Bogolyubov-Ruzsa lemma recently proved by Sanders. Together with the results by
the last two authors, this implies an algorithmic version of the quadratic
Goldreich-Levin theorem in which the number of terms in the quadratic Fourier
decomposition of a given function is quasipolynomial in the error parameter,
compared with an exponential dependence previously proved by the authors. It
also improves the running time of the algorithm to have quasipolynomial
dependence instead of an exponential one.
We also give an application to the problem of finding large subspaces in
sumsets of dense sets. Green showed that the sumset of a dense subset of F_2^n
contains a large subspace. Using Fourier analytic methods, Sanders proved that
such a subspace must have dimension bounded below by a constant times the
density times n. We provide an alternative (and L^p norm-free) proof of a
comparable bound, which is analogous to a recent result of Croot, Laba and
Sisask in the integers.Comment: 28 page
- …