Related papers: Condensed Unpredictability
We construct a strong extractor against quantum storage that works for every min-entropy $k$, has logarithmic seed length, and outputs $\Omega(k)$ bits, provided that the quantum adversary has at most $\beta k$ qubits of memory, for any…
We extend a four-qubit quantum circuit model of black hole evaporation that enforces semi-causality, a condition that allows information to enter a black hole but strictly forbids any information from escaping from the interior to outside…
The high energy physics unfolding problem is an important statistical inverse problem in data analysis at the Large Hadron Collider (LHC) at CERN. The goal of unfolding is to make nonparametric inferences about a particle spectrum from…
We consider conservative quantum evolutions possibly interrupted by macroscopic measurements. When started in a nonequilibrium state, the resulting path-space measure is not time-reversal invariant and the weight of time-reversal breaking…
Using a mild variant of polar codes we design linear compression schemes compressing Hidden Markov sources (where the source is a Markov chain, but whose state is not necessarily observable from its output), and to decode from Hidden Markov…
We consider Hamiltonian quantum systems with energy bandwidth \Delta E and show that each measurement that determines the time up to an error \Delta t generates at least the entropy (\hbar/(\Delta t \Delta E))^2/2. Our result describes…
In Coles-Piani's recent remarkable version of the entropic uncertainty principle, the entropic sum is controlled by the first and second maximum overlaps between the two projective measurements. We generalize the entropic uncertainty…
Entanglement entropies have revealed, in the last years, to be a powerful tool to extract information about the physics of condensed-matter systems. In the first part of this thesis, we show how to extract essential details about the…
In this article we derive the Bekenstein-Hawking formula of black hole entropy from a single string. We consider a open string in the Rindler metric which can be obtained in the large mass limit from the Schwarzschild black hole metric. By…
Neural networks have dramatically increased our capacity to learn from large, high-dimensional datasets across innumerable disciplines. However, their decisions are not easily interpretable, their computational costs are high, and building…
Reasoning models often outperform smaller models but at 3--5$\times$ higher cost and added latency. We present entropy-guided refinement: a lightweight, test-time loop that uses token-level uncertainty to trigger a single, targeted…
This paper investigates the general distributed lossless/lossy source coding formulated by Jana and Blahut. Their multi-letter rate-distortion region, an alternative to the region derived by Yang and Qin, is characterized by entropy…
The limitation on obtaining precise outcomes of measurements performed on two non-commuting observables of a particle as set by the uncertainty principle in its entropic form, can be reduced in the presence of quantum memory. We derive a…
It is a common belief now that the explanation of the microscopic origin of the Bekenstein-Hawking entropy of black holes should be available in quantum gravity theory, whatever this theory will finally look like. Calculations of the…
In this paper, we disprove a conjecture of Goemans and Linial; namely, that every negative type metric embeds into $\ell_1$ with constant distortion. We show that for an arbitrarily small constant $\delta> 0$, for all large enough $n$,…
The problem of secure multiterminal source coding with side information at the eavesdropper is investigated. This scenario consists of a main encoder (referred to as Alice) that wishes to compress a single source but simultaneously…
In the previous papers (Kui\'{c} et al. in Found Phys 42:319-339, 2012; Kui\'{c} in arXiv:1506.02622, 2015), it was demonstrated that applying the principle of maximum information entropy by maximizing the conditional information entropy,…
Minimization of the (regularized) entropy of classification probabilities is a versatile class of discriminative clustering methods. The classification probabilities are usually defined through the use of some classical losses from…
The quasi-local notion of an isolated horizon is employed to study the entropy of black holes without any particular symmetry in loop quantum gravity. The idea of characterizing the shape of a horizon by a sequence of local areas is…
To guarantee the security of uniform random numbers generated by a quantum random number generator, we study secure extraction of uniform random numbers when the environment of a given quantum state is controlled by the third party, the…