Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2209.08761

Quantum network reliability with perfect nodes

Juan Manuel Burgos

Published Sep 19, 2022• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2209.08761

Related papers

A Quantum Algorithm for Network Reliability

Stefan Pabst, Yunseong Nam

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 $\sharp$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$.

arXiv:2203.10201•Mar 19, 2022•3 citations

A quantum network stack and protocols for reliable entanglement-based networks

A Pirker, Wolfgang Dür

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.

arXiv:1810.03556•New Journal of Physics•Feb 11, 2019•164 citations

Quantum network-entanglement measures

Zhen‐Peng Xu, Julio I. de Vicente, Liang-Liang Sun +1 more

Quantum networks are of high interest nowadays and a quantum internet has been long envisioned. Network-entanglement adapts the notion of entanglement to the network scenario and network-entangled states are considered to be a resource to overcome the limitations of a given network structure. In this work, we introduce measures of quantum network-entanglement that are well-defined within the general framework of quantum resource theories, which at the same time have a clear operational interpretation characterizing the extra resources necessary to prepare a targeted quantum state within a given network. In particular, we define the network communication cost and the network round complexity, which turn out to be intimately related to graph-theoretic parameters. We also provide methods to estimate these measures by introducing novel witnesses of network-entanglement.

arXiv:2311.13945•Quantum•May 6, 2025•4 citations

Arqon: A suite of control applications enabling a reliable quantum network

Scarlett Gauthier, Thomas R. Beauchamp, Stephanie Wehner

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(k^3)$ in the number of incoming demands $k$ and schedule computation scales as ${O(N^3)}$ in the number of accepted demands to schedule $N$.

quant-pharXiv:2604.08692•Apr 13, 2026•0 citations

Quantum Entanglement-Based Distributed Algorithm Fault Tolerance Mechanism

Jincheng Zhang

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.

•Aug 31, 2026•0 citations

Structural complexity of quantum networks

Michael Siomau

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.

arXiv:1602.06154•AIP conference proceedings•Jan 1, 2016•13 citations
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 RRR is ♯\sharp♯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 RRR. Our algorithm requires O(EV/ε)O(EV/ε)O(EV/ε) gate operations and O(E)O(E)O(E) qubits, where VVV and EEE 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 RRR.
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 networks are of high interest nowadays and a quantum internet has been long envisioned. Network-entanglement adapts the notion of entanglement to the network scenario and network-entangled states are considered to be a resource to overcome the limitations of a given network structure. In this work, we introduce measures of quantum network-entanglement that are well-defined within the general framework of quantum resource theories, which at the same time have a clear operational interpretation characterizing the extra resources necessary to prepare a targeted quantum state within a given network. In particular, we define the network communication cost and the network round complexity, which turn out to be intimately related to graph-theoretic parameters. We also provide methods to estimate these measures by introducing novel witnesses of network-entanglement.
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)O(k^3)O(k3) in the number of incoming demands kkk and schedule computation scales as O(N3){O(N^3)}O(N3) in the number of accepted demands to schedule NNN.
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.
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.