Quantum entanglement and coherence are two fundamental resources for quantum information processing. Recent results clearly demonstrate their relevance in quantum technological tasks, including quantum communication and quantum algorithms. In this Letter we study the role of quantum coherence for quantum state redistribution, a fundamental task where two parties aim to relocate a quantum particle by using a limited amount of quantum communication and shared entanglement. We provide general bounds for the resource rates required for this process, and show that these bounds are tight under additional reasonable constraints, including the situation where the receiving party cannot use local coherence. While entanglement cannot be directly converted into local coherence in our setting, we show that entanglement is still useful for local coherence creation if an additional quantum channel is provided, and the optimal protocol for local coherence creation for any given amount of quantum communication and shared entanglement is presented. We also discuss possible extensions of our methods to other scenarios where the receiving party is limited by local constraints, including theories of thermodynamics and asymmetry.
Quantum entanglement and coherence are two fundamental resources for quantum information processing. Recent results clearly demonstrate their relevance in quantum technological tasks, including quantum communication and quantum algorithms. In this Letter we study the role of quantum coherence for quantum state redistribution, a fundamental task where two parties aim to relocate a quantum particle by using a limited amount of quantum communication and shared entanglement. We provide general bounds for the resource rates required for this process, and show that these bounds are tight under additional reasonable constraints, including the situation where the receiving party cannot use local coherence. While entanglement cannot be directly converted into local coherence in our setting, we show that entanglement is still useful for local coherence creation if an additional quantum channel is provided, and the optimal protocol for local coherence creation for any given amount of quantum communication and shared entanglement is presented. We also discuss possible extensions of our methods to other scenarios where the receiving party is limited by local constraints, including theories of thermodynamics and asymmetry.
Understanding the resource consumption in distributed scenarios is one of the main goals of quantum information theory. A prominent example for such a scenario is the task of quantum state merging, where two parties aim to merge their tripartite quantum state parts. In standard quantum state merging, entanglement is considered to be an expensive resource, while local quantum operations can be performed at no additional cost. However, recent developments show that some local operations could be more expensive than others: it is reasonable to distinguish between local incoherent operations and local operations which can create coherence. This idea leads us to the task of incoherent quantum state merging, where one of the parties has free access to local incoherent operations only. In this case the resources of the process are quantified by pairs of entanglement and coherence. Here, we develop tools for studying this process and apply them to several relevant scenarios. While quantum state merging can lead to a gain of entanglement, our results imply that no merging procedure can gain entanglement and coherence at the same time. We also provide a general lower bound on the entanglement-coherence sum and show that the bound is tight for all pure states. Our results also lead to an incoherent version of Schumacher compression: in this case the compression rate is equal to the von Neumann entropy of the diagonal elements of the corresponding quantum state.
Distributed quantum information processing is a promising platform for scaling up quantum information processing, where small- and intermediate-scale quantum devices are connected by a network of quantum channels for communicating quantum information, so as to cooperate in achieving larger-scale information processing. In such distributed settings, entangled states shared among the multiple devices serve as a resource for achieving nonlocal information processing tasks by local operations and classical communication (LOCC), where transformations of multipartite entangled states play central roles. This thesis analyzes properties of quantum entanglement in these small- and intermediate-scale settings and multipartite settings. The first part of this thesis investigates a communication task, quantum state merging, on the small and intermediate scales. The second part of this thesis analyzes multipartite entanglement in distributed quantum information processing. These analyses clarify fundamental limitations and potential applications of distributed quantum information processing to characterize properties of quantum entanglement in the small- and intermediate-scale settings and multipartite settings, providing a paradigm for investigating multipartite entanglement in distributed quantum information processing over networks beyond the state convertibility under LOCC.
Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols: the two parties may be given some number of quantum bits jointly prepared in a fixed superposition, prior to communicating with each other. The quantum channel is then said to be "entanglement-assisted." Shared randomness does not help in the transmission of information from one party to another. Moreover, it does not significantly reduce the classical complexity of computing functions vis-a-vis private-coin protocols. On the other hand, prior entanglement leads to startling phenomena such as "quantum teleportation" and "superdense coding." The problem of characterising the power of prior entanglement has baffled many researchers, especially in the setting of bounded-error protocols. It is open whether it leads to more than a factor of two savings (using superdense coding) or more than an additive O(log) savings (when used to create shared randomness). Few lower bounds are known for communication problems in this setting, and are all derived using sophisticated information theoretic techniques. In this paper, we focus on the most basic problem in the setting of communication over an entanglement-assisted quantum channel, that of communicating classical bits from one party to another. We derive optimal bounds on the number of quantum bits required for this task, for any given probability of error.
Quantum entanglement plays a central role in many quantum communication protocols. It allows distant particles to share correlations beyond the limits of classical interactions. Entanglement is essential for superdense coding, quantum teleportation, and secure cryptographic key distribution in quantum communication. It is also a pillar for developing quantum networks, where the management and distribution of entanglement are crucial for connecting distant nodes. Although perfect entanglement is a sought-after ideal, experimental imperatives, including entanglement distribution over long distances, often limit the quality of entangled states. An important question is whether weaker entanglement still offers advantages. First, we study more general tasks than dense coding to show that simpler measurements, combined with entanglement, allow advantageous and sometimes even optimal qubit communication protocols to be obtained. We also demonstrate that simple measurements can generate quantum correlations that cannot be modelled by two classical communication bits and can constitute an optimal protocol with quantum resources. We implement a novel Bell-type inequality tailored for certifying full network non-locality (FNN) to develop certification methods guaranteeing security on an entanglement-based network. Our experiment uses two pairs of polarised entangled photons in a network configuration with three nodes, briefly referred to as a bilocal network scenario. Finally, we show that weakly entangled states can improve communication over a qubit channel using only separate (local) measurements on isotropic non-steerable two-qubit states, without interference, of individual photons, across two communication tasks: secret sharing and its stochastic variant.
In spite of their outstanding experimental relevance, Gaussian operations in continuous-variable quantum systems are subjected to fundamental limitations, as it is known that general resources cannot be distilled within the Gaussian paradigm. We show that these limitations can be overcome by considering a collaborative setting where one party increases the amount of local resource with the aid of another party, whose operations are assumed to be Gaussian but are otherwise unrestricted; the two parties can only communicate classically. We show that in single-shot scenarios, unlike in the well-known case of entanglement theory, two-way classical communication does not lead to any improvement over one-way classical communication from the aiding party to the aided party. We then provide a concise general expression for the Gaussian resource of assistance, i.e., the maximum amount of resource that can be obtained when the aiding party holds a purification of the aided party's state, as measured by a general monotone. To demonstrate its usefulness, we apply our result to two important kinds of resources, squeezing and entanglement, and find some simple analytic solutions. In the case of entanglement theory, we are able to find general upper bounds on the regularized Gaussian entanglement of assistance, and to establish additivity for tensor powers of thermal states. This allows us to draw a quantitative and enlightening comparison with the performance of assisted entanglement distillation in the non-Gaussian setting. On the technical side, we develop some variational expressions to handle functions of symplectic eigenvalues that may be of independent interest. Our results suggest further potential for Gaussian operations to play a major role in practical quantum information processing protocols.
This paper proposes a novel mechanism for entanglement redistribution within quantum networks, leveraging the principles of quantum entanglement to dynamically manage and optimize the distribution of information entropy. The core concept involves transferring entropy – quantified as quantum entropy – from one node to another within the network via entangled states. This redistribution aims to improve the overall efficiency and performance of quantum communication protocols. We explore the theoretical framework, utilizing concepts from information theory and quantum mechanics, to define the mathematical operations involved. The proposed system addresses the inherent limitations of static entropy distribution in quantum networks, paving the way for adaptive quantum resource allocation and potentially enabling more sophisticated quantum communication strategies. This work lays a foundational understanding for future research in the area of quantum network management and optimization.