dorsal/arxiv
View SchemaBreaking the Storage-Bandwidth Tradeoff in Distributed Storage with Quantum Entanglement
| Authors | Lei Hu, Mohamed Nomeir, Alptug Aytekin, Sennur Ulukus |
|---|---|
| Categories | |
| ArXiv ID | 2601.10676vv1 |
| URL | https://arxiv.org/abs/2601.10676 |
| 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.
{
"annotation_id": "2305cb47-6cf1-43bd-9313-eb32608aff7c",
"date_created": "2026-02-17T05:53:26.418000Z",
"date_modified": "2026-02-17T05:53:26.418000Z",
"file_hash": "7c963d2425e8c6cacaa4367f3a2d76f27e9330ad82f25e840aea24f8ce18d102",
"private": false,
"record": {
"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.",
"arxiv_id": "2601.10676",
"authors": [
"Lei Hu",
"Mohamed Nomeir",
"Alptug Aytekin",
"Sennur Ulukus"
],
"categories": [
"cs.IT",
"cs.DC",
"cs.NI",
"eess.SP",
"math.IT",
"quant-ph"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Breaking the Storage-Bandwidth Tradeoff in Distributed Storage with Quantum Entanglement",
"url": "https://arxiv.org/abs/2601.10676",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "45153844-2f08-45a5-b032-ecaab4250ab5",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}