相关论文: Quantum Minimal One Way Information: Relative Hard…
The overarching goal of this thesis is to demonstrate that complementarity is at the heart of quantum information theory, that it allows us to make (some) sense of just what information "quantum information" refers to, and that it is useful…
If two parties share an unknown quantum state, one can ask how much quantum communication is needed for party A to send her share to party B. Recently, it was found that the number of qubits which should be sent is given by the conditional…
Given two channels that convey information about the same random variable, we introduce two measures of the unique information of one channel with respect to the other. The two quantities are based on the notion of generalized weighted Le…
Quantum information science is a source of task-related axioms whose consequences can be explored in general settings encompassing quantum mechanics, classical theory, and more. Quantum states are compendia of probabilities for the outcomes…
What makes quantum information science a science? These notes explore the idea that quantum information science may offer a powerful approach to the study of complex quantum systems. We discuss how to quantify complexity in quantum systems,…
This thesis focuses on the intersection of mathematical and computational optimization and quantum information. Main contributions are open-source software code: A hybrid approach mixing "traditional" nonconvex and convex methods can make…
This thesis is a multidisciplinary contribution to the information theory of single-particle Coulomb systems in their relativistic and not relativistic description, to the theory of special functions of mathematical physics with the…
We present an iterative algorithm that finds the optimal measurement for extracting the accessible information in any quantum communication scenario. The maximization is achieved by a steepest-ascent approach toward the extremal point,…
Quantum communication holds the promise of creating disruptive technologies that will play an essential role in future communication networks. For example, the study of quantum communication complexity has shown that quantum communication…
I show that a simple multi-party communication task can be performed more efficiently with quantum communication than with classical communication, even with low detection efficiency $\eta$. The task is a communication complexity problem in…
I discuss several aspects of information theory and its relationship to physics and neuroscience. The unifying thread of this somewhat chaotic essay is the concept of Kolmogorov or algorithmic complexity (Kolmogorov Complexity, for short).…
We show that classical and quantum Kolmogorov complexity of binary strings agree up to an additive constant. Both complexities are defined as the minimal length of any (classical resp. quantum) computer program that outputs the…
Contextuality provides a unifying paradigm for nonclassical aspects of quantum probabilities and resources of quantum information. Unfortunately, most forms of quantum contextuality remain experimentally unexplored due to the difficulty of…
State transformation problems such as compressing quantum information or breaking quantum commitments are fundamental quantum tasks. However, their computational difficulty cannot easily be characterized using traditional complexity theory,…
This thesis establishes a number of connections between foundational issues in quantum theory, and some quantum information applications. It starts with a review of quantum contextuality and non-locality, multipartite entanglement…
We develop a theory of the algorithmic information in bits contained in an individual pure quantum state. This extends classical Kolmogorov complexity to the quantum domain retaining classical descriptions. Quantum Kolmogorov complexity…
A fundamental problem in the study of complex networks is to provide quantitative measures of correlation and information flow between different parts of a system. To this end, several notions of communicability have been introduced and…
In classical information theory, channel capacity quantifies the maximum number of messages that can be reliably transmitted using shared information. An equivalent concept, termed uncommon information, represents the number of messages…
The information in an individual finite object (like a binary string) is commonly measured by its Kolmogorov complexity. One can divide that information into two parts: the information accounting for the useful regularity present in the…
Information theoretically secure multi-party computation (MPC) is a central primitive of modern cryptography. However, relatively little is known about the communication complexity of this primitive. In this work, we develop powerful…