相关论文: Sharp estimates of quantum covering problems via a…

Convex splitting is a powerful technique in quantum information theory used in proving the achievability of numerous information-processing protocols such as quantum state redistribution and quantum network channel coding. In this work, we…

Uniform continuity bounds on entropies are generally expressed in terms of a single distance measure between a pair of probability distributions or quantum states, typically, the total variation distance or trace distance. However, if an…

We propose a series of quantum algorithms for computing a wide range of quantum entropies and distances, including the von Neumann entropy, quantum R\'{e}nyi entropy, trace distance, and fidelity. The proposed algorithms significantly…

The Renyi entropy plays an essential role in quantum information theory. We study the continuity estimation of the Renyi entropy. An inequality relating the Renyi entropy difference of two quantum states to their trace norm distance is…

We prove fully smooth one shot multipartite covering, aka convex split, results as well as fully smooth multipartite decoupling results for quantum states. Fully smooth one shot results for these problems were not known earlier, though the…

Achievability in information theory refers to demonstrating a coding strategy that accomplishes a prescribed performance benchmark for the underlying task. In quantum information theory, the crafted Hayashi-Nagaoka operator inequality is an…

We show that a relatively simple reasoning using von Neumann entropy inequalities yields a robust proof of the quantum Singleton bound for quantum error-correcting codes (QECC). For entanglement-assisted quantum error-correcting codes…

We show that approximating the trace norm contraction coefficient of a quantum channel within a constant factor is NP-hard. Equivalently, this shows that determining the optimal success probability for encoding a bit in a quantum system…

We propose an alternative evaluation of quantum entanglement by measuring the maximum violation of the Bell's inequality without performing a partial trace operation. This proposal is demonstrated by bridging the maximum violation of the…

Many of the traditional results in information theory, such as the channel coding theorem or the source coding theorem, are restricted to scenarios where the underlying resources are independent and identically distributed (i.i.d.) over a…

This thesis consolidates, improves and extends the smooth entropy framework for non-asymptotic information theory and cryptography. We investigate the conditional min- and max-entropy for quantum states, generalizations of classical R\'enyi…

We introduce a novel method for computing entanglement entropy across surfaces in Loop Quantum Gravity by employing techniques from quantum error correcting codes. In this construction, the redundancy encoded in the gauge invariant subspace…

Quantum information methods have been brought to bear on high-energy physics, including the study of entanglement and Bell nonlocality in collider experiments. Quantum information observables have also been employed to constrain possible…

We prove a sharp remainder term for H\"older's inequality for traces as a consequence of the uniform convexity properties of the Schatten trace norms. We then show how this implies a novel family of Pinsker type bounds for the quantum Renyi…

We study the problem of entanglement-assisted quantum state redistribution in the one-shot setting and provide a new achievability result on the quantum communication required. Our bounds are in terms of the max-relative entropy and the…

We analyze a task in which classical and quantum messages are simultaneously communicated via a noisy quantum channel, assisted with a limited amount of shared entanglement. We derive direct and converse bounds for the one-shot capacity…

The field of quantum computation currently lacks a formal proof of experimental feasibility. Qubits are fragile and sophisticated quantum error correction is required to achieve reliable quantum computation. The surface code is a promising…

In this Thesis, several results in quantum information theory are collected, most of which use entropy as the main mathematical tool. *While a direct generalization of the Shannon entropy to density matrices, the von Neumann entropy behaves…

Defining suitable quantum extensions of classical divergences often poses a challenge due to the non-commutative nature of quantum information. In this work, we propose a new approach via what we call the layer cake representation. The…

We study the covariant holographic entropy bound from an operational standpoint. Therefore we consider the physical limit for observations on a light-sheet. A light-sheet is a particular null hypersurface, and the natural measuring…