Related papers: Quantum Kolmogorov Complexity and Bounded Quantum …
We present a general model for quantum channels with memory, and show that it is sufficiently general to encompass all causal automata: any quantum process in which outputs up to some time t do not depend on inputs at times t' > t can be…
In this paper we give a definition for the Kolmogorov complexity of a pure quantum state. In classical information theory the algorithmic complexity of a string is a measure of the information needed by a universal machine to reproduce the…
We present a simple and general simulation technique that transforms any black-box quantum algorithm (a la Grover's database search algorithm) to a quantum communication protocol for a related problem, in a way that fully exploits the…
The problem of unambiguous state discrimination consists of determining which of a set of known quantum states a particular system is in. One is allowed to fail, but not to make a mistake. The optimal procedure is the one with the lowest…
Given a reference computer, Kolmogorov complexity is a well defined function on all binary strings. In the standard approach, however, only the asymptotic properties of such functions are considered because they do not depend on the…
The mathematical framework of quantum theory, though fundamentally distinct from classical physics, raises the question of whether quantum processes can be efficiently simulated using classical resources. For instance, a sender (Alice)…
The `no communication' theorem prohibits superluminal communication by showing that any measurement by Alice on an entangled system cannot change the reduced density matrix of Bob's state, and hence the expectation value of any measurement…
Quantum resources may provide advantage over their classical counterparts. We say this as quantum advantage. Here we consider a single communication task to study different approaches of observing quantum advantage. We say this setting as a…
Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classical and the quantum world. However, when committing to a string of n bits at once, how far can we stretch the quantum limits? In this letter,…
Fundamental primitives such as bit commitment and oblivious transfer serve as building blocks for many other two-party protocols. Hence, the secure implementation of such primitives are important in modern cryptography. In this work, we…
Secure two-party computation considers the problem of two parties computing a joint function of their private inputs without revealing anything beyond the output. In this work, we consider the setting where the two parties (a classical…
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…
In the quantum compression scheme proposed by Schumacher, Alice compresses a message that Bob decompresses. In that approach, there is some probability of failure and, even when successful, some distortion of the state. For sufficiently…
Private queries allow a user Alice to learn an element of a database held by a provider Bob without revealing which element she was interested in, while limiting her information about the other elements. We propose to implement private…
This work presents a study of Kolmogorov complexity for general quantum states from the perspective of deterministic-control quantum Turing Machines (dcq-TM). We extend the dcq-TM model to incorporate mixed state inputs and outputs, and…
Quantum mechanics emerged as the result of a successful resolution of stringent empirical and profound conceptual conflicts within the development of atomic physics at the beginning of the last century. At first glance, it seems to be…
Two-party one-way quantum communication has been extensively studied in the recent literature. We target the size of minimal information that is necessary for a feasible party to finish a given combinatorial task, such as distinction of…
Quantum mechanics is known to provide significant improvements in information processing tasks when compared to classical models. These advantages range from computational speeds-up to security improvements. A key question is where these…
We analyze the effect of typical, unknown perturbations on the 2D toric code when acting as a quantum memory, incorporating the effects of error correction on read-out. By transforming the system into a 1D transverse Ising model undergoing…
Heisenberg's uncertainty principle provides a fundamental limitation on an observer's ability to simultaneously predict the outcome when one of two measurements is performed on a quantum system. However, if the observer has access to a…