Related papers: Are problems in Quantum Information Theory (un)dec…
Quantum entanglement is a key physical resource in quantum information processing that allows for performing basic quantum tasks such as teleportation and quantum key distribution, which are impossible in the classical world. Ever since the…
In a distributed quantum computer scalability is accomplished by networking together many elementary nodes. Typically the network is optical and inter-node entanglement involves photon detection. In complex networks the entanglement…
To decide whether a quantum channel is degradable is relatively easy: one has to find at least one example of a degrading quantum channel. But in general, no conclusive criterion exists to show the opposite. Using elementary methods we…
The problem of discriminating the state of a quantum system among a number of hypothetical states is usually addressed under the assumption that one has perfect knowledge of the possible states of the system. In this thesis, I analyze the…
The question of how irreversibility can emerge as a generic phenomena when the underlying mechanical theory is reversible has been a long-standing fundamental problem for both classical and quantum mechanics. We describe a mechanism for the…
In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components;…
Quantum entanglement is a key resource in quantum computing and quantum information processing tasks. However, its quantification remains a major challenge since it cannot be directly extracted from physical observables. To address this…
Recent years have seen significant activity on the problem of using data for the purpose of learning properties of quantum systems or of processing classical or quantum data via quantum computing. As in classical learning, quantum learning…
A survey is given summarizing the state of the art of describing information processing in Quantum Decision Theory, which has been recently advanced as a novel variant of decision making, based on the mathematical theory of separable…
We consider the problem of correctly classifying a given quantum two-level system (qubit) which is known to be in one of two equally probable quantum states. We assume that this task should be performed by a quantum machine which does not…
Quantum computing provides a powerful framework for tackling computational problems that are classically intractable. The goal of this paper is to explore the use of quantum computers for solving relevant problems in systems and control…
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…
The determination of the state fidelity and the detection of entanglement are fundamental problems in quantum information experiments. We investigate how these goals can be achieved with a minimal effort. We show that the fidelity of GHZ…
In this short communication it is proposed the general form of a n-qubit disentangled state as a irreducible sentence, in the sense explained by the algorithmic information theory, whose length increases in a non-polynomial way when the…
Information theory provides tools to predict the performance of a learning algorithm on a given dataset. For instance, the accuracy of learning an unknown parameter can be upper bounded by reducing the learning task to hypothesis testing…
One of the most widespread methods to determine if a quantum state is entangled, or to quantify its entanglement dimensionality, is by measuring its fidelity with respect to a pure state. In this Letter we find a large class of states whose…
This paper considers the realizability of quantum gates from the perspective of information complexity. Since the gate is a physical device that must be controlled classically, it is subject to random error. We define the complexity of gate…
We present here an overview of our work concerning entanglement properties of composite quantum systems. The characterization of entanglement, i.e. the possibility to assert if a given quantum state is entangled with others and how much…
We study the following decision problem: is the language recognized by a quantum finite automaton empty or non-empty? We prove that this problem is decidable or undecidable depending on whether recognition is defined by strict or non-strict…
Given an unknown quantum state distributed over two systems, we determine how much quantum communication is needed to transfer the full state to one system. This communication measures the "partial information" one system needs conditioned…