English
Related papers

Related papers: Sampling of min-entropy relative to quantum knowle…

200 papers

Given a random subspace $H_n$ chosen uniformly in a tensor product of Hilbert spaces $V_n\otimes W$, we consider the collection $K_n$ of all singular values of all norm one elements of $H_n$ with respect to the tensor structure. A law of…

Quantum Physics · Physics 2023-10-25 Benoît Collins , Félix Parraud

Statistical model checking avoids the exponential growth of states associated with probabilistic model checking by estimating properties from multiple executions of a system and by giving results within confidence bounds. Rare properties…

Performance · Computer Science 2012-01-26 Cyrille Jégourel , Axel Legay , Sean Sedwards

In most data-scientific approaches, the principle of Maximum Entropy (MaxEnt) is used to a posteriori justify some parametric model which has been already chosen based on experience, prior knowledge or computational simplicity. In a…

Methodology · Statistics 2022-06-29 Orestis Loukas , Ho Ryun Chung

Consider the problem of estimating the Shannon entropy of a distribution over $k$ elements from $n$ independent samples. We show that the minimax mean-square error is within universal multiplicative constant factors of $$\Big(\frac{k }{n…

Information Theory · Computer Science 2016-02-19 Yihong Wu , Pengkun Yang

We develop a quantum version of the probability estimation framework [arXiv:1709.06159] for randomness generation with quantum side information. We show that most of the properties of probability estimation hold for quantum probability…

Quantum Physics · Physics 2023-02-06 Emanuel Knill , Yanbao Zhang , Honghao Fu

We show that the entropy of a message can be tested in a device-independent way. Specifically, we consider a prepare-and-measure scenario with classical or quantum communication, and develop two different methods for placing lower bounds on…

Quantum Physics · Physics 2015-09-09 Rafael Chaves , Jonatan Bohr Brask , Nicolas Brunner

The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples). The question addressed in this paper is whether an…

Information Theory · Computer Science 2010-01-26 Galen Reeves , Michael Gastpar

Random sampling is an essential tool in the processing and transmission of data. It is used to summarize data too large to store or manipulate and meet resource constraints on bandwidth or battery power. Estimators that are applied to the…

Databases · Computer Science 2015-03-19 Edith Cohen , Haim Kaplan

We develop a simple Quantile Spacing (QS) method for accurate probabilistic estimation of one-dimensional entropy from equiprobable random samples, and compare it with the popular Bin-Counting (BC) method. In contrast to BC, which uses…

We define and investigate a notion of entropy for quantum error correcting codes. The entropy of a code for a given quantum channel has a number of equivalent realisations, such as through the coefficients associated with the Knill-Laflamme…

Quantum Physics · Physics 2009-02-24 David W. Kribs , Aron Pasieka , Karol Zyczkowski

Planck-scale quantum spacetime undergoes probabilistic local curvature fluctuations whose distributions cannot explicitly depend on position otherwise vacuum's small-scale quantum structure would fail to be statistically homogeneous. Since…

High Energy Physics - Theory · Physics 2012-03-28 Christopher D. Burton

Randomness is a central feature of quantum mechanics and an invaluable resource for both classical and quantum technologies. Commonly, in Device-Independent and Semi-Device-Independent scenarios, randomness is certified using projective…

Quantum Physics · Physics 2022-11-08 Marco Avesani , Hamid Tebyanian , Paolo Villoresi , Giuseppe Vallone

We study the entanglement of a pure state of a composite quantum system consisting of several subsystems with $d$ levels each. It can be described by the R\'enyi-Ingarden-Urbanik entropy $S_q$ of a decomposition of the state in a product…

Quantum Physics · Physics 2016-05-12 Marco Enriquez , Zbigniew Puchała , Karol Życzkowski

How much information about an unknown quantum state can be obtained by a measurement? We propose a model independent answer: the information obtained is equal to the minimum entropy of the outputs of the measurement, where the minimum is…

Quantum Physics · Physics 2009-10-31 S. Massar , S. Popescu

High-quality random samples of quantum states are needed for a variety of tasks in quantum information and quantum computation. Searching the high-dimensional quantum state space for a global maximum of an objective function with many local…

Quantum Physics · Physics 2015-04-28 Jiangwei Shang , Yi-Lin Seah , Hui Khoon Ng , David John Nott , Berthold-Georg Englert

Apart from their foundational significance, entropic uncertainty relations play a central role in proving the security of quantum cryptographic protocols. Of particular interest are thereby relations in terms of the smooth min-entropy for…

Quantum Physics · Physics 2014-12-23 Nelly Huei Ying Ng , Mario Berta , Stephanie Wehner

The nonlocal behavior of quantum mechanics can be used to generate guaranteed fresh randomness from an untrusted device that consists of two nonsignalling components; since the generation process requires some initial fresh randomness to…

Quantum Physics · Physics 2013-02-26 Serge Fehr , Ran Gelles , Christian Schaffner

The problem considered here is motivated by a work by B. Nachtergaele and H.T. Yau where the Euler equations of fluid dynamics are derived from manybody quantum mechanics, see [10]. A crucial concept in their work is that of local quantum…

Analysis of PDEs · Mathematics 2021-09-29 Romain Duboscq , Olivier Pinaud

In this work, we investigate the amount of energy that can be extracted or charged through unitary operations when only minimal information about the state is known. Assuming knowledge of only the mean energy of the state, we start by…

Quantum Physics · Physics 2025-09-12 Andrea Canzio , Vasco Cavina , Roberto Menta , Vittorio Giovannetti

De, Trevisan and Tulsiani [CRYPTO 2010] show that every distribution over $n$-bit strings which has constant statistical distance to uniform (e.g., the output of a pseudorandom generator mapping $n-1$ to $n$ bit strings), can be…

Cryptography and Security · Computer Science 2017-05-01 Krzysztof Pietrzak , Maciej Skorski