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:2510.10568

On the Capacity of Distributed Quantum Storage

Hua Sun, Syed A. Jafar

Published Oct 12, 2025• 2 citations
arXivHTMLPDF

Abstract

A distributed quantum storage code maps a quantum message to N storage nodes, of arbitrary specified sizes, such that the stored message is robust to an arbitrary specified set of erasure patterns. The sizes of the storage nodes, and erasure patterns may not be homogeneous. The capacity of distributed quantum storage is the maximum feasible size of the quantum message (relative to the sizes of the storage nodes), when the scaling of the size of the message and all storage nodes by the same scaling factor is allowed. Representing the decoding sets as hyperedges in a storage graph, the capacity is characterized for various graphs, including MDS graph, wheel graph, Fano graph, and intersection graph. The achievability is related via quantum CSS codes to a classical secure storage problem. Remarkably, our coding schemes utilize non-trivial alignment structures to ensure recovery and security in the corresponding classical secure storage problem, which leads to similarly non-trivial quantum codes. The converse is based on quantum information inequalities, e.g., strong sub-additivity and weak monotonicity of quantum entropy, tailored to the topology of the storage graphs.

DOI
10.48550/arxiv.2510.10568

Related papers

On the Capacity of Erasure-Prone Quantum Storage With Erasure-Prone Entanglement Assistance

Hua Yan Sun, Syed A. Jafar

A quantum message is encoded into $N$ storage nodes (quantum systems $Q_1\dots Q_N$) with assistance from $N_B$ maximally entangled bi-partite quantum systems $A_1B_1, \dots, A_{N_B}B_{N_B}$, that are prepared in advance such that $B_1\dots B_{N_B}$ are stored separately as entanglement assistance (EA) nodes, while $A_1\dots A_{N_B}$ are made available to the encoder. Both the storage nodes and EA nodes are erasure-prone. The quantum message must be recoverable given any $K$ of the $N$ storage nodes along with any $K_B$ of the $N_B$ EA nodes. The capacity for this setting is the maximum size of the quantum message, given that the size of each EA node is $λ_B$. All node sizes are relative to the size of a storage node, which is normalized to unity. The exact capacity is characterized as a function of $N,K,N_B,K_B, λ_B$ in all cases, with one exception. The capacity remains open for an intermediate range of $λ_B$ values when a strict majority of the $N$ storage nodes, and a strict non-zero minority of the $N_B$ EA nodes, are erased. As a key stepping stone, an analogous classical storage (with shared-randomness assistance) problem is introduced. A set of constraints is identified for the classical problem, such that classical linear code constructions translate to quantum storage codes, and the converse bounds for the two settings utilize similar insights. In particular, the capacity characterizations for the classical and quantum settings are shown to be identical in all cases where the capacity is settled.

arXiv:2510.17781•IEEE Transactions on Information Theory•Aug 18, 2026•1 citation

Modified graph-state codes for single-node recovery in quantum distributed storage

Priya J. Nadkarni, Ankur Raina, Shayan Srinivasa Garani

Distributed quantum information stored over nodes within a quantum network are prone to node failures, motivating the need for coded quantum networks. We encode $k$ qubits of quantum information over an $n$-node network in a distributed fashion, with one qubit per node, using modified graph-state codes. We devise a procedure to recover the encoded quantum information in any given arbitrary network after a detected node fails. The recovery procedure is locally within four edges of the failed node. For a network with even number of nodes, we provide a class of scalable modified graph-state codes with rate $(n\ensuremath{-}2)/n$, saturating the quantum Singleton bound. This yields higher coding rates than Grassl et al.'s well-known erasure codes and has asymptotic rate 1. For odd node size $n$, we design the network links to obtain an $(n\ensuremath{-}3)/n$ rate-optimal modified graph state code.

Physical Review A•Dec 30, 2020•5 citations

Entanglement Cost of Erasure Correction in Quantum MDS Codes

Kaushik Senthoor

In distributed quantum storage, physical qubits of a code will be stored across the network. When qubits in one of the nodes are lost i.e. when the node is erased, the remaining nodes need to communicate with a new node to replace the lost qubits. Here, we look at the problem of how much entanglement cost is needed to perform such a distributed quantum erasure correction. We focus on distributed quantum storage based on quantum maximum distance separable (MDS) codes. We derive lower bounds on the entanglement cost when the quantum network used for the erasure correction has a star topology. We show that the simple method of downloading the non-erased qudits and performing operations at a single node is optimal when the minimal number of non-erased nodes are accessed. It remains to be seen what the entanglement cost will be when a non-minimal number of non-erased nodes are accessed. The techniques used in this work can be developed further to study the entanglement cost of quantum erasure correction in more general code families and network topologies.

arXiv:2505.20284•May 26, 2025•2 citations

Quantum Entanglement Enhanced Distributed Storage

Jincheng Zhang

This paper proposes a novel approach to distributed storage leveraging the unique properties of quantum entanglement. The core claim is that utilizing entanglement enables the construction of a distributed storage system capable of achieving long-range communication, high storage capacity, and enhanced security. The proposed mechanism involves creating entanglement between multiple quantum storage nodes, facilitating redundant information storage and inherent error correction. This approach fundamentally differs from traditional distributed storage methods relying on classical redundancy techniques. We explore the theoretical framework, outlining the key mathematical concepts and demonstrating the potential advantages of this entanglement-based system. The system's security stems from the fundamental laws of quantum mechanics, making it inherently resistant to eavesdropping and data manipulation. While no experimental validation is presented in this theoretical exploration, the presented model lays a foundation for future research and development in this promising area. The system's capacity is fundamentally limited by the number of entangled pairs, but the inherent error correction provided by entanglement significantly improves reliability. We investigate the impact of various factors on the system's performance, including entanglement fidelity and node distribution.

•Aug 31, 2026•0 citations

Quantum Entanglement-Driven Distributed Storage

Jincheng Zhang

This paper proposes a novel approach to distributed storage leveraging the unique properties of quantum entanglement. Traditional distributed storage systems face limitations in capacity and security. This research introduces a system designed to overcome these limitations by harnessing the non-local nature of entanglement. The core concept involves encoding data into entangled quantum states distributed across multiple nodes. This enables secure data sharing, redundancy, and inherent error correction, potentially achieving significantly higher storage capacity and improved security compared to classical methods. The system utilizes the correlated nature of entangled particles to create a robust and inherently secure storage solution, addressing critical challenges in modern data management. The theoretical framework presented outlines the key principles and potential benefits of this entanglement-driven distributed storage architecture. Further research and development are needed to realize the full potential of this technology.

•Sep 4, 2026•0 citations

Towards Enhanced Security in Distributed Storage via Quantum Error Correction Codes

Jincheng Zhang

This paper investigates the potential of utilizing quantum error correction (QEC) codes to significantly enhance the security of distributed storage systems. Traditional cryptographic approaches for securing distributed data are increasingly vulnerable to attacks from quantum computers. This research proposes a novel framework leveraging the inherent error-correcting capabilities of QEC codes to provide robust protection against a wide range of attacks, including those specifically designed for classical cryptographic systems. The core of the approach involves the implementation of a tailored encoding and decoding scheme based on a chosen QEC code. We explore the theoretical foundations of QEC, focusing on key parameters such as code distance, encoding rate, and decoding complexity. The goal is to demonstrate a pathway toward constructing a distributed storage architecture that exhibits significantly improved resistance to data breaches and manipulation, particularly in scenarios where quantum computing capabilities pose a serious threat. This work highlights the emerging role of QEC in securing information infrastructure against the looming challenges of quantum computing.

•Sep 4, 2026•0 citations
A distributed quantum storage code maps a quantum message to N storage nodes, of arbitrary specified sizes, such that the stored message is robust to an arbitrary specified set of erasure patterns. The sizes of the storage nodes, and erasure patterns may not be homogeneous. The capacity of distributed quantum storage is the maximum feasible size of the quantum message (relative to the sizes of the storage nodes), when the scaling of the size of the message and all storage nodes by the same scaling factor is allowed. Representing the decoding sets as hyperedges in a storage graph, the capacity is characterized for various graphs, including MDS graph, wheel graph, Fano graph, and intersection graph. The achievability is related via quantum CSS codes to a classical secure storage problem. Remarkably, our coding schemes utilize non-trivial alignment structures to ensure recovery and security in the corresponding classical secure storage problem, which leads to similarly non-trivial quantum codes. The converse is based on quantum information inequalities, e.g., strong sub-additivity and weak monotonicity of quantum entropy, tailored to the topology of the storage graphs.
A quantum message is encoded into NNN storage nodes (quantum systems Q1…QNQ_1\dots Q_NQ1​…QN​) with assistance from NBN_BNB​ maximally entangled bi-partite quantum systems A1B1,…,ANBBNBA_1B_1, \dots, A_{N_B}B_{N_B}A1​B1​,…,ANB​​BNB​​, that are prepared in advance such that B1…BNBB_1\dots B_{N_B}B1​…BNB​​ are stored separately as entanglement assistance (EA) nodes, while A1…ANBA_1\dots A_{N_B}A1​…ANB​​ are made available to the encoder. Both the storage nodes and EA nodes are erasure-prone. The quantum message must be recoverable given any KKK of the NNN storage nodes along with any KBK_BKB​ of the NBN_BNB​ EA nodes. The capacity for this setting is the maximum size of the quantum message, given that the size of each EA node is λBλ_BλB​. All node sizes are relative to the size of a storage node, which is normalized to unity. The exact capacity is characterized as a function of N,K,NB,KB,λBN,K,N_B,K_B, λ_BN,K,NB​,KB​,λB​ in all cases, with one exception. The capacity remains open for an intermediate range of λBλ_BλB​ values when a strict majority of the NNN storage nodes, and a strict non-zero minority of the NBN_BNB​ EA nodes, are erased. As a key stepping stone, an analogous classical storage (with shared-randomness assistance) problem is introduced. A set of constraints is identified for the classical problem, such that classical linear code constructions translate to quantum storage codes, and the converse bounds for the two settings utilize similar insights. In particular, the capacity characterizations for the classical and quantum settings are shown to be identical in all cases where the capacity is settled.
Distributed quantum information stored over nodes within a quantum network are prone to node failures, motivating the need for coded quantum networks. We encode kkk qubits of quantum information over an nnn-node network in a distributed fashion, with one qubit per node, using modified graph-state codes. We devise a procedure to recover the encoded quantum information in any given arbitrary network after a detected node fails. The recovery procedure is locally within four edges of the failed node. For a network with even number of nodes, we provide a class of scalable modified graph-state codes with rate $(n\ensuremath{-}2)/n$, saturating the quantum Singleton bound. This yields higher coding rates than Grassl et al.'s well-known erasure codes and has asymptotic rate 1. For odd node size nnn, we design the network links to obtain an $(n\ensuremath{-}3)/n$ rate-optimal modified graph state code.
In distributed quantum storage, physical qubits of a code will be stored across the network. When qubits in one of the nodes are lost i.e. when the node is erased, the remaining nodes need to communicate with a new node to replace the lost qubits. Here, we look at the problem of how much entanglement cost is needed to perform such a distributed quantum erasure correction. We focus on distributed quantum storage based on quantum maximum distance separable (MDS) codes. We derive lower bounds on the entanglement cost when the quantum network used for the erasure correction has a star topology. We show that the simple method of downloading the non-erased qudits and performing operations at a single node is optimal when the minimal number of non-erased nodes are accessed. It remains to be seen what the entanglement cost will be when a non-minimal number of non-erased nodes are accessed. The techniques used in this work can be developed further to study the entanglement cost of quantum erasure correction in more general code families and network topologies.
This paper proposes a novel approach to distributed storage leveraging the unique properties of quantum entanglement. The core claim is that utilizing entanglement enables the construction of a distributed storage system capable of achieving long-range communication, high storage capacity, and enhanced security. The proposed mechanism involves creating entanglement between multiple quantum storage nodes, facilitating redundant information storage and inherent error correction. This approach fundamentally differs from traditional distributed storage methods relying on classical redundancy techniques. We explore the theoretical framework, outlining the key mathematical concepts and demonstrating the potential advantages of this entanglement-based system. The system's security stems from the fundamental laws of quantum mechanics, making it inherently resistant to eavesdropping and data manipulation. While no experimental validation is presented in this theoretical exploration, the presented model lays a foundation for future research and development in this promising area. The system's capacity is fundamentally limited by the number of entangled pairs, but the inherent error correction provided by entanglement significantly improves reliability. We investigate the impact of various factors on the system's performance, including entanglement fidelity and node distribution.
This paper proposes a novel approach to distributed storage leveraging the unique properties of quantum entanglement. Traditional distributed storage systems face limitations in capacity and security. This research introduces a system designed to overcome these limitations by harnessing the non-local nature of entanglement. The core concept involves encoding data into entangled quantum states distributed across multiple nodes. This enables secure data sharing, redundancy, and inherent error correction, potentially achieving significantly higher storage capacity and improved security compared to classical methods. The system utilizes the correlated nature of entangled particles to create a robust and inherently secure storage solution, addressing critical challenges in modern data management. The theoretical framework presented outlines the key principles and potential benefits of this entanglement-driven distributed storage architecture. Further research and development are needed to realize the full potential of this technology.
This paper investigates the potential of utilizing quantum error correction (QEC) codes to significantly enhance the security of distributed storage systems. Traditional cryptographic approaches for securing distributed data are increasingly vulnerable to attacks from quantum computers. This research proposes a novel framework leveraging the inherent error-correcting capabilities of QEC codes to provide robust protection against a wide range of attacks, including those specifically designed for classical cryptographic systems. The core of the approach involves the implementation of a tailored encoding and decoding scheme based on a chosen QEC code. We explore the theoretical foundations of QEC, focusing on key parameters such as code distance, encoding rate, and decoding complexity. The goal is to demonstrate a pathway toward constructing a distributed storage architecture that exhibits significantly improved resistance to data breaches and manipulation, particularly in scenarios where quantum computing capabilities pose a serious threat. This work highlights the emerging role of QEC in securing information infrastructure against the looming challenges of quantum computing.