We consider the problem of generating multipartite entangled states in a quantum network upon request. We follow a top-down approach, where the required entanglement is initially present in the network in form of network states shared between network devices, and then manipulated in such a way that the desired target state is generated. This minimizes generation times, and allows for network structures that are in principle independent of physical links. We present a modular and flexible architecture, where a multi-layer network consists of devices of varying complexity, including quantum network routers, switches and clients, that share certain resource states. We concentrate on the generation of graph states among clients, which are resources for numerous distributed quantum tasks. We assume minimal functionality for clients, i.e. they do not participate in the complex and distributed generation process of the target state. We present architectures based on shared multipartite entangled Greenberger-Horne-Zeilinger states of different size, and fully connected decorated graph states, respectively. We compare the features of these architectures to an approach that is based on bipartite entanglement, and identify advantages of the multipartite approach in terms of memory requirements and complexity of state manipulation. The architectures can handle parallel requests, and are designed in such a way that the network state can be dynamically extended if new clients or devices join the network. For generation or dynamical extension of the network states, we propose a quantum network configuration protocol, where entanglement purification is used to establish high fidelity states. The latter also allows one to show that the entanglement generated among clients is private, i.e. the network is secure.
We present a stack model for breaking down the complexity of entanglement-based quantum networks. More specifically, we focus on the structures and architectures of quantum networks and not on concrete physical implementations of network elements. We construct the quantum network stack in a hierarchical manner comprising several layers, similar to the classical network stack, and identify quantum networking devices operating on each of these layers. The layers responsibilities range from establishing point-to-point connectivity, over intra-network graph state generation, to inter-network routing of entanglement. In addition we propose several protocols operating on these layers. In particular, we extend the existing intra-network protocols for generating arbitrary graph states to ensure reliability inside a quantum network, where here reliability refers to the capability to compensate for devices failures. Furthermore, we propose a routing protocol for quantum routers which enables the generation of arbitrary graph states across network boundaries. This protocol, in correspondence with classical routing protocols, can compensate dynamically for failures of routers, or even complete networks, by simply re-routing the given entanglement over alternative paths. We also consider how to connect quantum routers in a hierarchical manner to reduce complexity, as well as reliability issues arising in connecting these quantum networking devices. quantum network shall not be limited to the generation of Bell-pairs only [50][51][52][53], because many interesting applications require multipartite entangled quantum states. Therefore, the ultimate goal of quantum networks should be to enable their clients to share arbitrary entangled states to perform distributed quantum computational tasks. An important subclass of multipartite entangled states are so-called graph states [54], and many protocols in quantum information theory rely on this class of states.Here we consider entanglement-based quantum networks utilizing multipartite entangled states [51-53, 55-57] which are capable of generating arbitrary graph states among clients. In general, we identify three successive phases in entanglement-based quantum networks: dynamic, static, and adaptive. In the dynamic phase, which is the first phase, the quantum network devices utilize the quantum channels to distribute entangled states among each other. Once this phase completes, the quantum network devices share certain entangled quantum states, which results in the static phase. In this phase, the quantum network devices store these entangled states for future requests locally. Finally, in the adaptive phase, the network devices manipulate and adapt the entangled states of the static phase. This might be caused either due to requests of clients in networks, but also due to failures of devices in a quantum network.We follow the approach of [51] where a certain network state is stored in the static phase, and client requests to establish certain target (graph) states in the network ar...
We introduce an alternative type of quantum repeater for long-range quantum communication with improved scaling with the distance. We show that by employing hashing, a deterministic entanglement distillation protocol with one-way communication, one obtains a scalable scheme that allows one to reach arbitrary distances, with constant overhead in resources per repeater station, and ultrahigh rates. In practical terms, we show that, also with moderate resources of a few hundred qubits at each repeater station, one can reach intercontinental distances. At the same time, a measurement-based implementation allows one to tolerate high loss but also operational and memory errors of the order of several percent per qubit. This opens the way for long-distance communication of big quantum data.
Multipartite quantum entanglement serves as a resource for spatially separated parties performing distributed quantum information processing. Any multipartite entangled state can be generated from appropriately distributed bipartite entangled states by local operations and classical communication (LOCC), and in this sense, any distributed process based on shared multipartite entanglement and LOCC is simulatable by using only bipartite entangled states and LOCC. We show here that this reduction scenario does not hold when there exists a limitation on the size of the local quantum system of each party. Under such a limitation, we prove that there exists a set of multipartite quantum states such that these states in the set cannot be prepared from any distribution of bipartite entanglement while the states can be prepared from a common resource state exhibiting multipartite entanglement. We also show that temporal uses of bipartite quantum communication resources within a limitation of local system sizes are sufficient for preparing this common resource state exhibiting multipartite entanglement, yet there also exist other states exhibiting multipartite entanglement which cannot be prepared even in this setting. Hence, when the local quantum system sizes are limited, multipartite entanglement is an indispensable resource without which certain processes still cannot be accomplished. Keywords: multipartite entanglement, limitation on quantum system size, local operations and classical communication (LOCC) * Electronic address: yamasaki@eve.phys.s.u-tokyo.ac.jp preparation of a common resource state of LOCC transformation into of party quantum communication consisting of bipartite entanglement common resource state target
We introduce a repeater scheme to efficiently distribute multipartite entangled states in a quantum network with optimal scaling. The scheme allows to generate graph states such as 2D and 3D cluster states of growing size or GHZ states over arbitrary distances, with a constant overhead per node/channel that is independent of the distance. The approach is genuine multipartite, and is based on the measurement-based implementation of multipartite hashing, an entanglement purification protocol that operates on a large ensemble together with local merging/connection of elementary building blocks. We analyze the performance of the scheme in a setting where local or global storage is limited, and compare it to bipartite and hybrid approaches that are based on the distribution of entangled pairs. We find that the multipartite approach offers a storage advantage, which results in higher efficiency and better performance in certain parameter regimes. We generalize our approach to arbitrary network topologies and different target graph states.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.