Related papers: Quantum Soft Covering with Relative Entropy Criter…
We study the task of entanglement distillation in the one-shot setting under different classes of quantum operations which extend the set of local operations and classical communication (LOCC). Establishing a general formalism which allows…
Quantum machine learning is an emerging field at the intersection of machine learning and quantum computing. Classical cross entropy plays a central role in machine learning. We define its quantum generalization, the quantum cross entropy,…
We study entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of…
It has been shown recently that the framework of quantum sampling, as introduced by Bouman and Fehr, can lead to new entropic uncertainty relations highly applicable to finite-key cryptographic analyses. Here we revisit these so-called…
For pure states of multi-dimensional quantum lattice systems, which in a convenient computational basis have amplitude and phase structure of sufficiently rapid decorrelation, we construct high fidelity approximations of relatively low…
Reliable distribution of quantum entanglement over long distances is a central challenge in quantum information science, fundamentally limited by decoherence in noisy communication channels. In this work, we investigate the asymptotic…
We develop a quantum relative entropy method for the mean-field limit of quantum many-body systems. For closed systems governed by the von Neumann equation, we prove a quantitative stability estimate between the $N$-body density matrix and…
This thesis addresses the interplay between asymptotic hypothesis testing and entropy inequalities in quantum information theory. In the first part of the thesis we focus on hypothesis testing. We consider two main settings; one can either…
How well can we approximate a quantum channel output state using a random codebook with a certain size? In this work, we study the quantum soft covering problem. Namely, we use a random codebook with codewords independently sampled from a…
The tight, in a sense, lower estimates of diamond-norm distance from a given quantum channel to the sets of degradable, antidegradable and entanglement-breaking channels are obtained via the tight continuity bounds for quantum mutual…
A natural measure for the amount of quantum information that a physical system E holds about another system A = A_1,...,A_n is given by the min-entropy Hmin(A|E). Specifically, the min-entropy measures the amount of entanglement between E…
We present a bouquet of continuity bounds for quantum entropies, falling broadly into two classes: First, a tight analysis of the Alicki-Fannes continuity bounds for the conditional von Neumann entropy, reaching almost the best possible…
We consider the problem of source compression under three different scenarios in the one-shot (non- asymptotic) regime. To be specific, we prove one-shot achievability and converse bounds on the coding rates for distributed source coding,…
We consider a quantum quasi-relative entropy $S_f^K$ for an operator $K$ and an operator convex function $f$. We show how to obtain the error bounds for the monotonicity and joint convexity inequalities from the recent results for the…
We study the relative entropy between the empirical estimate of a discrete distribution and the true underlying distribution. If the minimum value of the probability mass function exceeds an $\alpha > 0$ (i.e. when the true underlying…
The Entropy Accumulation Theorem (EAT) was introduced to significantly improve the finite-size rates for device-independent quantum information processing tasks such as device-independent quantum key distribution (QKD). A natural question…
Conformal field theories in curved backgrounds have been used to describe inhomogeneous one-dimensional systems, such as quantum gases in trapping potentials and non-equilibrium spin chains. This approach provided, in a elegant and simple…
We consider a general resource theory that allows the use of free resource as a catalyst. We show that the amount of `resource' contained in a given state, in the asymptotic scenario, is equal to the regularized relative entropy of resource…
A quantum channel is sufficient with respect to a set of input states if it can be reversed on this set. In the approximate version, the input states can be recovered within an error bounded by the decrease of the relative entropy under the…
We present a comprehensive software framework for the finite-size security analysis of quantum random number generation (QRNG) and quantum key distribution (QKD) protocols, based on the Entropy Accumulation Theorem (EAT). Our framework…