Related papers: Quantum mutual information redistribution by Numbe…
The aim of this thesis is to advance the theory behind quantum information processing tasks, by deriving fundamental limits on bipartite quantum interactions and dynamics, which corresponds to an underlying Hamiltonian that governs the…
A method to compute the optimal success probability of discrimination of N arbitrary quantum states is presented, based on the decomposition of any N-outcome measurement into sequences of nested two-outcome ones. In this way the…
Quantum computers can solve specific complex tasks for which no reasonable-time classical algorithm is known. Quantum computers do however also offer inherent security of data, as measurements destroy quantum states. Using shared entangled…
We study the teleportation scheme performed by means of a partially entangled pure state. We found that the information belonging to the quantum channel can be distributed into both the system of the transmitter and the system of the…
Quantum state transfer from an information-carrying qubit to a receiving qubit is ubiquitous for quantum information technology. In a closed quantum system, this task requires precisely-timed control of coherent qubit-qubit interactions…
We introduce a notion of genuine distributed coherence. Such a notion is based on the possibility of concentrating on individual systems the coherence present in a distributed system, by making use of incoherent unitary transformations. We…
Quantum secret sharing schemes encrypting a quantum state into a multipartite entangled state are treated. The lower bound on the dimension of each share given by Gottesman [Phys. Rev. A \textbf{61}, 042311 (2000)] is revisited based on a…
We derive complementarity relations for arbitrary quantum states of multiparty systems, of arbitrary number of parties and dimensions, between the purity of a part of the system and several correlation quantities, including entanglement and…
Many quantum algorithms can be seen as a transition from a well-defined initial quantum state of a complex quantum system, to an unknown target quantum state, corresponding to a certain eigenvalue either of the Hamiltonian or of a…
Quantum state separation is a probabilistic map that transforms a given set of pure states into another set of more distinguishable ones. Here we investigate such a map acting onto uniparametric families of symmetric linearly dependent or…
We introduce the concept of mutual independence -- correlations shared between distant parties which are independent of the environment. This notion is more general than the standard idea of a secret key -- it is a fully quantum and more…
Most works on open quantum systems generally focus on the reduced physical system by tracing out the environment degrees of freedom. Here we show that the qubit distributions with the environment are essential for a thorough analysis, and…
The Majorization Principle is a fundamental statement governing the dynamics of information processing in optimal and efficient quantum algorithms. While quantum computation can be modeled to be reversible, due to the unitary evolution…
Quantum entanglement of pure states of a bipartite system is defined as the amount of local or marginal ({\em i.e.}referring to the subsystems) entropy. For mixed states this identification vanishes, since the global loss of information…
We consider a quantum communication task between two users Alice and Bob, in which Alice and Bob exchange their respective quantum information by means of local operations and classical communication assisted by shared entanglement. Here,…
Understanding the role that quantum entanglement plays as a resource in various information processing tasks is one of the crucial goals of quantum information theory. Here we propose a new perspective for studying quantum entanglement:…
We study shared randomness in the context of multi-party number-in-hand communication protocols in the simultaneous message passing model. We show that with three or more players, shared randomness exhibits new interesting properties that…
In quantum statistical mechanics, it is of fundamental interest to understand how close the bipartite entanglement entropy of eigenstates of quantum chaotic Hamiltonians is to maximal. For random pure states in the Hilbert space, the…
We consider two memory nodes of a quantum network connected by flying qubits. We are particularly interested in the case where a flying qubit produced by one node has to be transformed before it can interface efficiently with the next node.…
With the advantages of high-speed parallel processing, quantum computers can efficiently solve large-scale complex optimization problems in future networks. However, due to the uncertain qubit fidelity and quantum channel noise, distributed…