We introduce the concept of quantum reliability as an extension of the concept of network reliability in the context of quantum networks. We show that this concept is intimately related to the concept of quantum reliability operator that we also introduce and show a Negami like splitting formula for it. Considering that the simple factorization formula for classical networks which is the basis of most of the calculation algorithms does not hold in the quantum context due to entanglement, a Negami like splitting for the quantum reliability operator becomes relevant.
We introduce the concept of quantum reliability as an extension of the concept of network reliability in the context of quantum networks. We show that this concept is intimately related to the concept of quantum reliability operator that we also introduce and show a Negami like splitting formula for it. Considering that the simple factorization formula for classical networks which is the basis of most of the calculation algorithms does not hold in the quantum context due to entanglement, a Negami like splitting for the quantum reliability operator becomes relevant.
Building a network that is resilient to a component failure is vital. Our access to electricity and telecommunications or the internet of things all hinge on an uninterrupted service provided by a robust network. Calculating the network reliability R is ♯P-complete and intractable to calculate exactly for medium and large networks. Here, we present an explicit, circuit-level implementation of a quantum algorithm that computes R. Our algorithm requires O(EV/ε) gate operations and O(E) qubits, where V and E are the number of nodes and edges in the graph and ε is the uncertainty in the reliability estimation. This constitutes a significant polynomial speedup over the best classical approaches currently known. We further provide quantum gate counts, relevant for both pre-fault-tolerant and fault-tolerant regimes, sufficient to compute R.
Quantum communication networks consist of N distant nodes sharing a quantum state. By means of local operation in each node assisted by classical communication, the nodes try to transform the initial state into perfect quantum correlations, that later will be used to perform a quantum information task, such as quantum teleportation or quantum cryptography. Given a network, defined by a geometry of nodes and connections, it is crucial to understand whether it is possible to establish long-distance quantum correlations, in the sense that the correlations between two end points of the network do not decrease exponentially with the number of intermediate connections. In this contribution, we present our recent findings on the distribution of entanglement through quantum networks. In the case of one-dimensional chains of connected quantum systems, the results are hardly surprising: a non-exponential decay is possible only when the entanglement in the connections between nodes is larger than a maximally entangled state of two qubits. The picture becomes much richer and interesting for networks of dimension larger than one: long-distance correlations can be established even when the connecting nodes are not maximally entangled. Actually, the problem of establishing maximally entangled states between nodes is related to classical percolation in statistical mechanics. We show, then, that statistical concepts, such as percolation and phase transitions, can be used to optimize the entanglement distribution through quantum networks. Remarkably, the quantum features allow going beyond the known results for classical percolation, giving rise to a new type of critical phenomenon that we call entanglement percolation.
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.
This paper investigates a novel approach to fault tolerance in distributed quantum algorithms, leveraging the unique properties of quantum entanglement. Traditional distributed algorithms reliant on classical communication face insurmountable limitations within the context of quantum computing. This research proposes a mechanism where nodes within a quantum network communicate and synchronize through entangled states, enabling the detection and correction of node failures without the need for classical relaying. The core of this mechanism involves carefully manipulating and measuring entangled states to ensure the integrity of computations. We outline a theoretical framework for constructing such a system and demonstrate its potential to significantly enhance the reliability of large-scale quantum computing tasks. The key contributions of this work lie in exploring a fundamentally different paradigm for distributed quantum computation, one that directly harnesses the power of quantum entanglement to achieve robust fault tolerance. This approach represents a crucial step towards realizing scalable and dependable quantum distributed computing architectures.
A quantum network's purpose is to enable users to execute applications on end nodes. This requires the network to provide the service of creating entangled links between those nodes. Users of mature networks, such as the internet or the telephone network expect accepted service demands to be met reliably. We first define reliability requirements that extend classical computer network concepts to quantum network service delivery. We then introduce Arqon, a suite of control applications designed to deliver reliable service in centrally controlled quantum networks. We demonstrate through both analytic and numerical evaluation that Arqon satisfies all reliability requirements for accepted demands. These evaluations consider static network topologies. We provide a complete Python implementation and perform complexity analysis showing that admission control scales as O(k3) in the number of incoming demands k and schedule computation scales as O(N3) in the number of accepted demands to schedule N.
Quantum network is a set of nodes connected with channels, through which the nodes communicate photons and classical information. Classical structural complexity of a quantum network may be defined through its physical structure, i.e. mutual position of nodes and channels connecting them. We show here that the classical structural complexity of a quantum network does not restrict the structural complexity of entanglement graphs, which may be created in the quantum network with local operations and classical communication. We show, in particular, that 1D quantum network can simulate both simple entanglement graphs such as lattices and random graphs and complex small-world graphs.