English
Related papers

Related papers: When is the Chernoff Exponent for Quantum Operatio…

200 papers

The article is devoted to the construction of examples that illustrate (using computer calculations) the rate of convergence of Chernoff approximations to the solution of the Cauchy problem for the heat equation. We are interested in the…

Numerical Analysis · Mathematics 2025-12-25 K. A. Katalova , N. Nikbakht , I. D. Remizov

We propose an effective exponent ruling the algebraic decay of the average quantum return probability for discrete Schrodinger operators. We compute it for some non-periodic substitution potentials with different degrees of randomness, and…

Condensed Matter · Physics 2009-10-31 Cesar R. de Oliveira , Giancarlo Q. Pellegrino

When dealing with modern big data sets, a very common theme is reducing the set through a random process. These generally work by making "many simple estimates" of the full data set, and then judging them as a whole. Perhaps magically,…

Data Structures and Algorithms · Computer Science 2013-02-20 Jeff M. Phillips

We develop a resource theory of symmetric distinguishability, the fundamental objects of which are elementary quantum information sources, i.e., sources that emit one of two possible quantum states with given prior probabilities. Such a…

Quantum Physics · Physics 2021-08-23 Robert Salzmann , Nilanjana Datta , Gilad Gour , Xin Wang , Mark M. Wilde

The problem of quickest detection of an anomalous process among M processes is considered. At each time, a subset of the processes can be observed, and the observations from each chosen process follow two different distributions, depending…

Information Theory · Computer Science 2014-10-09 Kobi Cohen , Qing Zhao

Machines are only Carnot efficient if they are reversible, but then their power output is vanishingly small. Here we ask, what is the maximum efficiency of an irreversible device with finite power output? We use a nonlinear scattering…

Mesoscale and Nanoscale Physics · Physics 2014-04-23 Robert S. Whitney

The Chernoff bound is an important inequality relation in probability theory. The original version of the Chernoff bound is to give an exponential decreasing bound on the tail distribution of sums of independent random variables. Recent…

Probability · Mathematics 2021-05-18 Shih Yu Chang

The problem of multiple hypothesis testing with observation control is considered in both fixed sample size and sequential settings. In the fixed sample size setting, for binary hypothesis testing, the optimal exponent for the maximal error…

Information Theory · Computer Science 2013-09-05 Sirin Nitinawarat , George Atia , Venugopal V. Veeravalli

A rigorous general definition of quantum probability is given, which is valid for elementary events and for composite events, for operationally testable measurements as well as for inconclusive measurements, and also for non-commuting…

Quantum Physics · Physics 2016-01-12 V. I. Yukalov , D. Sornette

We present a number of results related to quantum algorithms with small error probability and quantum algorithms that are zero-error. First, we give a tight analysis of the trade-offs between the number of queries of quantum search…

Computational Complexity · Computer Science 2007-05-23 H. Buhrman , R. Cleve , R. de Wolf , Ch. Zalka

The Chernoff bound is a well-known tool for obtaining a high probability bound on the expectation of a Bernoulli random variable in terms of its sample average. This bound is commonly used in statistical learning theory to upper bound the…

Machine Learning · Statistics 2022-05-18 Andrew Y. K. Foong , Wessel P. Bruinsma , David R. Burt

The emerging field of quantum thermodynamics is contributing important results and insights into archetypal many-body problems, including quantum phase transitions. Still, the question whether out-of-equilibrium quantities, such as…

Chernoff information upper bounds the probability of error of the optimal Bayesian decision rule for $2$-class classification problems. However, it turns out that in practice the Chernoff bound is hard to calculate or even approximate. In…

Information Theory · Computer Science 2021-04-29 Frank Nielsen

Krylov complexity has recently been proposed as a quantum probe of chaos. The Krylov exponent characterising the exponential growth of Krylov complexity is conjectured to upper-bound the Lyapunov exponent. We compute the Krylov and the…

High Energy Physics - Theory · Physics 2024-09-13 Shira Chapman , Saskia Demulder , Damián A. Galante , Sameer U. Sheorey , Osher Shoval

We show that for fermion states, measurements of any two finite outcome particle quantum numbers (e.g.\ spin) are not constrained by a minimum total uncertainty. We begin by defining uncertainties in terms of the outputs of a measurement…

Quantum Physics · Physics 2012-12-07 Cael L. Hasse

Quantum work fluctuation theorems are known to hold when the work is defined as the difference between the outcomes of projective measurements carried out on the Hamiltonian of the system at the initial and the final time instants of the…

Statistical Mechanics · Physics 2023-07-20 Sourabh Lahiri , Subhashish Banerjee , A. M. Jayannavar

Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum computer (Quantum Mechanical Computers, Richard P. Feynman, Foundations of Physics, Vol. 16, No. 6, p597-531, 1986). Feynman's answer…

Mathematical Physics · Physics 2007-05-23 Ken Loo

A canonical approach to Cherenkov radiation in the presence of a magnetodielectric medium is presented in classical, nonrelativistic and relativistic quantum regimes. The equations of motion for the canonical variables are solved explicitly…

Quantum Physics · Physics 2015-05-19 Fardin Kheirandish , Ehsan Amooghorban

In quantum process tomography, it is possible to express the experimenter's prior information as a sequence of quantum operations, i.e., trace-preserving completely positive maps. In analogy to de Finetti's concept of exchangeability for…

Quantum Physics · Physics 2009-11-10 Christopher A. Fuchs , Ruediger Schack , Petra F. Scudo

While the question ``how many CNOT gates are needed to simulate an arbitrary two-qubit operator'' has been conclusively answered -- three are necessary and sufficient -- previous work on this topic assumes that one wants to simulate a given…

Quantum Physics · Physics 2007-05-23 Vivek V. Shende , Igor L. Markov