Breaking the Storage-Bandwidth Tradeoff in Distributed Storage with Quantum Entanglement

• URL: http://arxiv.org/abs/2601.10676v1
• Date: Thu, 15 Jan 2026 18:41:10 GMT
• Title: Breaking the Storage-Bandwidth Tradeoff in Distributed Storage with Quantum Entanglement
• Authors: Lei Hu, Mohamed Nomeir, Alptug Aytekin, Sennur Ulukus,
• Abstract summary: This work investigates the use of quantum resources in distributed storage systems.<n>In this setting, we fully characterize the fundamental tradeoff between storage and repair bandwidth.
• Score: 46.17112353277822
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work investigates the use of quantum resources in distributed storage systems. Consider an $(n,k,d)$ distributed storage system in which a file is stored across $n$ nodes such that any $k$ nodes suffice to reconstruct the file. When a node fails, any $d$ helper nodes transmit information to a newcomer to rebuild the system. In contrast to the classical repair, where helper nodes transmit classical bits, we allow them to send classical information over quantum channels to the newcomer. The newcomer then generates its storage by performing appropriate measurements on the received quantum states. In this setting, we fully characterize the fundamental tradeoff between storage and repair bandwidth (total communication cost). Compared to classical systems, the optimal storage--bandwidth tradeoff can be significantly improved with the enhancement of quantum entanglement shared only among the surviving nodes, particularly at the minimum-storage regenerating point. Remarkably, we show that when $d \geq 2k-2$, there exists an operating point at which \textit{both storage and repair bandwidth are simultaneously minimized}. This phenomenon breaks the tradeoff in the classical setting and reveals a fundamentally new regime enabled by quantum communication.

Related papers

• On the Capacity of Erasure-prone Quantum Storage with Erasure-prone Entanglement Assistance [14.164370730003691]
  The capacity for this setting is the maximum size of the quantum message.<n>The capacity remains open for an intermediate range of $lambda_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.
  arXiv  Detail & Related papers  (2025-10-20T17:40:21Z)
• On the Capacity of Distributed Quantum Storage [14.164370730003691]
  A distributed quantum storage code maps a quantum message to N storage nodes.<n>The capacity of distributed quantum storage is the maximum feasible size of the quantum message.<n>The achievability is related via quantum CSS codes to a classical secure storage problem.
  arXiv  Detail & Related papers  (2025-10-12T12:31:03Z)
• Entanglement Cost of Erasure Correction in Quantum MDS Codes [2.7195102129095003]
  We focus on distributed quantum storage based on quantum maximum distance separable (MDS) codes.<n>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.<n>It remains to be seen what the entanglement cost will be when a non-minimal number of non-erased nodes are accessed.
  arXiv  Detail & Related papers  (2025-05-26T17:58:43Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Effects of Different Q-swaps Modes on Percolation Threshold in Small-world Quantum Networks [2.228665992307317]
  We show that Quantum Entanglement Percolation (QEP) has a better percolation performance than Classical Entanglement Percolation (CEP) We also introduce quantum walk as a new scheme to have an extra reduction in the percolation threshold.
  arXiv  Detail & Related papers  (2024-01-22T11:30:22Z)
• $N$-Sum Box: An Abstraction for Linear Computation over Many-to-one Quantum Networks [13.701366534590498]
  This work formalizes an "$N$-sum box", a generalization of a two-sum protocol of Song emphet al. with recent applications to $N$-server private information retrieval. We first describe $N$-sum boxes based on maximal stabilizers and we then consider non-maximal-stabilizer-based constructions to obtain an instance of Quantum Symmetric Private Information Retrieval.
  arXiv  Detail & Related papers  (2023-04-15T13:45:01Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Field-deployable Quantum Memory for Quantum Networking [62.72060057360206]
  We present a quantum memory engineered to meet real-world deployment and scaling challenges. The memory technology utilizes a warm rubidium vapor as the storage medium, and operates at room temperature. We demonstrate performance specifications of high-fidelity retrieval (95%) and low operation error $(10-2)$ at a storage time of 160 $mu s$ for single-photon level quantum memory operations.
  arXiv  Detail & Related papers  (2022-05-26T00:33:13Z)
• An Evolutionary Pathway for the Quantum Internet Relying on Secure Classical Repeaters [64.48099252278821]
  We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle. In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes. We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
  arXiv  Detail & Related papers  (2022-02-08T03:24:06Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.