Networks of quantum devices with coherent control over their configuration offer promising advantages in quantum information processing, including quantum communication, computation, and sensing. So far, the investigation of these advantages assumed that the control system was initially uncorrelated with the data processed by the network. Here, we explore the power of quantum correlations between data and control, showing two communication tasks that can be accomplished with information-erasing channels if and only if the sender shares prior entanglement with a third party (the ``controller'') controlling the network configuration. The first task is to transmit classical messages without leaking information to the controller. The second task is to establish bipartite entanglement with a receiver, or, more generally, to establish multipartite entanglement with a number of spatially separated receivers.
Networks of quantum devices with coherent control over their configuration offer promising advantages in quantum information processing, including quantum communication, computation, and sensing. So far, the investigation of these advantages assumed that the control system was initially uncorrelated with the data processed by the network. Here, we explore the power of quantum correlations between data and control, showing two communication tasks that can be accomplished with information-erasing channels if and only if the sender shares prior entanglement with a third party (the ``controller'') controlling the network configuration. The first task is to transmit classical messages without leaking information to the controller. The second task is to establish bipartite entanglement with a receiver, or, more generally, to establish multipartite entanglement with a number of spatially separated receivers.
We introduce the task of random-receiver quantum communication, in which a sender transmits a quantum message to a receiver selected from a list of n spatially separated parties.At the moment of transmission, the choice of receiver is unknown to the sender.Later, it becomes known to the n parties, who coordinate their actions by exchanging classical messages.In normal conditions, random-receiver quantum communication requires a noiseless quantum communication channel between the sender and each of the n receivers.In contrast, we show that random-receiver quantum communication can take place through noisy, entanglement-breaking channels if the order of such channels is coherently controlled by a quantum bit that is accessible through measurements.While this phenomenon is achieved with a single control qubit, it cannot be mimicked by adding a noiseless qubit channel from the sender to any of the receivers, or more generally, from the sender to any subset of k < n parties.
Quantum information has reached a stage where real-world applications stimulate an intense research for the implementation of reliable and practical protocols for quantum communication and information processing. The implementation of such protocols, though, requires distributing quantum correlations (entanglement) among a number of degrees of freedom (modes) increasing with the complexity of the task to achieve. In the large-number-of-modes regime, the most promising example is probably one-way quantum computation in which the computation is achieved by applying local measurements to a set of modes initially in a cluster state [1]. However the generation of multipartite entangled states requires experimental configurations whose complexity increases with the number of the modes involved by means of optical devices. In contrast, a practical source should be compact, scalable, and permit to master the quantum properties of the generated states even when the number of modes is very large.
Quantum information science is an interdisciplinary field that investigates the principles and applications of quantum mechanics in information processing. Upcoming quantum technologies promise a range of valuable applications, including powerful simulation of complex systems, enhanced computational capabilities, high-precision sensing and metrology, and secure communication via quantum key distribution. A central concept is entanglement, a unique type of correlation between quantum systems that has no classical counterpart. Entanglement plays a pivotal role in many quantum protocols, particularly as a key resource in quantum communication, where protocols such as distributed quantum computation and secret sharing are executed in a distributed setting. Hence, distributing entanglement over long distances and manipulating it locally is essential for enabling quantum communication applications. However, the effectiveness of such applications is limited by the challenges of transmitting quantum information and maintaining precise control over quantum systems. For example, quantum information carriers, such as photons traveling through optical fibers, may be lost, or the operations performed may not be perfect. Consequently, it is crucial to develop robust tools for distributing and manipulating entanglement in distributed settings in order to fully unlock the capabilities of quantum technologies. In this thesis, we explore the influence of noise on the manipulation of entanglement in entanglement-based quantum networks. First, we examine the noise resilience of various resource states, i.e., pre-established entangled states, used to achieve bipartite or tripartite communication. This is followed by an analysis of a fully asymmetric network scenario, incorporating the noise introduced by the delays from classical messaging within the quantum network. We then propose classical communication protocols to achieve bipartite communication and evaluate their noise impact under the optimization of the arrangement of the pre-established entanglement. In addition, we propose an alternative approach to quantum repeaters, a key device for entanglement distribution, based on growing multipartite states, allowing entanglement to be recycled and patched. All investigations have been carried out employing a novel formalism, also developed in this thesis, for efficiently and accurately simulating noisy quantum processes on classical hardware, with broader applicability beyond quantum communication.
Quantum communication can outperform classical communication in a variety of information-processing tasks, but such advantages are typically established for a fixed communication network. Here we introduce topology-independent quantum advantage, in which a quantum protocol outperforms every classical protocol subject to the same communication constraint, irrespective of how the classical communication resource is distributed among the parties or which communication topology is employed, even when the parties may share unlimited classical randomness. We first demonstrate this phenomenon through a simple three-party equality task: two senders receive ternary classical inputs, while an input-free receiver determines whether the inputs are equal. We then formulate a general framework for topology-independent communication and completely characterize the corresponding classical correlation polytope in the minimal three-party scenario. Its facet inequalities reveal several instances of topology-independent quantum advantage. Remarkably, one of these inequalities enables the semi-device-independent certification of a nonunitary quantum channel, while another certifies a sequential quantum network topology without any prior assumption about the network configuration. Finally, we extend the framework to four-party networks, characterize the relevant classical communication structures, and identify a communication task exhibiting quantum advantages against all admissible classical topologies. Our results establish topology independence as a genuine and robust form of quantum advantage in communication networks.
We investigate the quantum advantage that can arise in typical two-party communication scenarios, where the sender and the receiver are allowed to share prior correlations. Focusing on communication tasks constrained by the distinguishability of the sender's inputs, we demonstrate that entanglement-assisted communication with both classical and quantum message can outperform classical communication supplemented with shared randomness. We begin by developing a general framework for communication tasks with pre-shared correlations. Within this framework, we establish an equivalence among entanglement-assisted classical communication, entanglement-assisted quantum communication, and quantum communication, showing that no hierarchy exists between these three paradigms. We then investigate the scenario where the receiver has no input and prove that no advantage can arise in this case. However, an advantage in the entanglement-assisted setting emerges once additional constraints are imposed on the dimension of the communicated message. This further highlights the superiority of entanglement-assisted classical communication over standard quantum communication. Then we demonstrate several tasks where the entanglement-assisted protocol using one-bit communication proves to be advantageous over classical communication. Finally, by constructing an explicit class of communication tasks, we show that a non-maximally entangled states outperform the maximally entangled state as a pre-shared resource between the communicating parties.
Suppose that m senders want to transmit classical information to n receivers with zero probability of error using a noisy multipartite communication channel. The senders are allowed to exchange classical, but not quantum, messages among themselves, and the same holds for the receivers. If the channel is classical, a single use can transmit information if and only if multiple uses can. In sharp contrast, we exhibit, for each m and n with m>1 or n>1, a quantum channel of which a single use is not able to transmit information yet two uses can. This latter property requires and is enabled by quantum entanglement.