We consider entanglement-based quantum networks, where multipartite entangled resource states are distributed and stored among the nodes and locally manipulated upon request to establish the desired target configuration. Separating the generation process from the requests enables a pre-preparation of resources, hence a reduced network latency. It also allows for an optimization of the entanglement topology, which is independent of the underlying network geometry. We concentrate on establishing Bell pairs or tripartite GHZ states between arbitrary parties. We study the influence of noise in this process, where we consider imperfections in state preparation, memories, and measurements - all of which can be modeled by local depolarizing noise. We compare different resource states corresponding to linear chains, trees, or multi-dimensional rectangular clusters, as well as centralized topologies using bipartite or tripartite entangled states. We compute the fidelity of the target states using a recently established efficient method, the noisy stabilizer formalism, and identify the best resource states within these classes. This allows us to treat networks of large size containing millions of nodes. We find that in large networks, high-dimensional cluster states are favorable and lead to a significantly higher target state fidelity.
We consider entanglement-based quantum networks, where multipartite entangled resource states are distributed and stored among the nodes and locally manipulated upon request to establish the desired target configuration. Separating the generation process from the requests enables a pre-preparation of resources, hence a reduced network latency. It also allows for an optimization of the entanglement topology, which is independent of the underlying network geometry. We concentrate on establishing Bell pairs or tripartite GHZ states between arbitrary parties. We study the influence of noise in this process, where we consider imperfections in state preparation, memories, and measurements - all of which can be modeled by local depolarizing noise. We compare different resource states corresponding to linear chains, trees, or multi-dimensional rectangular clusters, as well as centralized topologies using bipartite or tripartite entangled states. We compute the fidelity of the target states using a recently established efficient method, the noisy stabilizer formalism, and identify the best resource states within these classes. This allows us to treat networks of large size containing millions of nodes. We find that in large networks, high-dimensional cluster states are favorable and lead to a significantly higher target state fidelity.
Entanglement-based quantum networks exhibit a unique flexibility in the choice of entangled resource states that are then locally manipulated by the nodes to fulfill any request in the network. Furthermore, this manipulation is not uniquely defined and thus can be optimized. We tailor the adaptation of the resource state or pre-established entanglement to achieve bipartite communication in an imperfect setting that includes time-dependent memory errors. In this same setting, we study how the flexibility of this approach can be used for the distribution of entanglement in a fully asymmetric network scenario. The considered entanglement topology is a custom one based on the minimization of the required measurements to retrieve a Bell pair. The optimization of the manipulation and the study of such a custom entanglement topology are performed using the noisy stabilizer formalism, a recently introduced method to fully track noise on graph states. We find that exploiting the flexibility of the entanglement topology, given a certain set of bipartite requests, is highly favorable in terms of the fidelity of the final state.
A quantum internet aims at harnessing networked quantum technologies, namely by distributing bipartite entanglement between distant nodes. However, multipartite entanglement between the nodes may empower the quantum internet for additional or better applications for communications, sensing, and computation. In this work, we present an algorithm for generating multipartite entanglement between different nodes of a quantum network with noisy quantum repeaters and imperfect quantum memories, where the links are entangled pairs. Our algorithm is optimal for GHZ states with 3 qubits, maximising simultaneously the final state fidelity and the rate of entanglement distribution. Furthermore, we determine the conditions yielding this simultaneous optimality for GHZ states with a higher number of qubits, and for other types of multipartite entanglement. Our algorithm is general also in the sense that it can optimise simultaneously arbitrary parameters. This work opens the way to optimally generate multipartite quantum correlations over noisy quantum networks, an important resource for distributed quantum technologies.
The topology of classical networks is determined by physical links between nodes, and after a network request the links are used to establish the desired connections. Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests, which can substitute links and allow one to fulfill multiple network requests with the same resource state. We utilize this to design entanglement-based quantum networks tailored to their desired functionality, independent of the underlying physical structure. The kind of entanglement to be stored is chosen to fulfill all desired network requests (i.e. parallel bipartite or multipartite communications between specific nodes chosen from some finite set), but in such a way that the storage requirement is minimized. This can be accomplished by using multipartite entangled states shared between network nodes that can be transformed by local operations to different target states. We introduce a clustering algorithm to identify connected clusters in the network for a given desired functionality, i.e. the required network topology of the entanglement-based network, and a merging algorithm that constructs multipartite entangled resource states with reduced memory requirement to fulfill all desired network requests. This leads to a significant reduction in required time and resources, and provides a powerful tool to design quantum networks that is unique to entanglement-based networks.
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 network states are multipartite states built from distributing pairwise entanglement among parties and underpin the paradigm of quantum networks for quantum information processing. In this work we introduce the problem of partial distillability in noisy quantum networks. This corresponds to the possibility of distilling by local operations and classical communication an arbitrary pure state for an arbitrary subset of parties starting from a single copy of a quantum network state of an increasing number of parties that share noisy (i.e. mixed) bipartite entangled states. Here, distillation means that the target state is obtained with fidelity as close to 1 as desired as the size of the network increases when the pairwise entangled links support a constant amount of noise. While we prove an obstruction to multipartite distillation protocols after teleportation with channels with constant noise, we show that partial distillability is indeed possible if certain well-established graph-theoretic parameters that measure the connectivity in the network grow fast enough with its size. We give necessary as well as sufficient conditions for partial distillability in terms of these parameters and we moreover provide explicit constructions of networks with partial distillability and a relatively slow connectivity growth.
Quantum entanglement is a central resource for quantum computation and state transfer, yet the usefulness of multipartite entanglement depends on how rapidly coherence and nonclassical correlations degrade as the register size and communication depth increase. This methodology paper develops a reproducible density-matrix simulation for studying entanglement and information transfer in multi-qubit systems. GHZ and W states containing 3, 4, 5, 6 and 8 qubits are generated and exposed to independent local depolarizing noise. State fidelity and bipartite negativity are used to quantify preservation of the prepared resource, while an entanglement-assisted multi-hop teleportation model measures the fidelity of transferred single-qubit information. The simulation shows a systematic decrease in state fidelity and negativity with increasing register size at a fixed local error probability. At a local depolarizing probability of 0.02, GHZ fidelity decreases from 0.941 for three qubits to 0.852 for eight qubits, whereas W-state fidelity decreases from 0.943 to 0.877. In a separate transfer experiment with an effective error probability of 0.10 per teleportation hop, average transfer fidelity decreases from 0.933 after one hop to 0.745 after five hops, while remaining above the classical benchmark of 2/3. These results illustrate how multipartite entanglement quality; noise accumulation and path depth jointly determine the reliability of information transfer in multi-qubit computing architectures.