Simultaneously Minimizing Storage and Bandwidth Under Exact Repair With Quantum Entanglement

• URL: http://arxiv.org/abs/2605.12455v1
• Date: Tue, 12 May 2026 17:44:37 GMT
• Title: Simultaneously Minimizing Storage and Bandwidth Under Exact Repair With Quantum Entanglement
• Abstract summary: We study exact-regenerating codes for entanglement-assisted distributed storage systems.<n>Consider an $(n,k,d,,_mathsfq,B)$ distributed system that stores a file of $B$ classical symbols across $n$ nodes.
• Score: 46.17112353277822
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study exact-regenerating codes for entanglement-assisted distributed storage systems. Consider an $(n,k,d,α,β_{\mathsf{q}},B)$ distributed system that stores a file of $B$ classical symbols across $n$ nodes with each node storing $α$ symbols. A data collector can recover the file by accessing any $k$ nodes. When a node fails, any $d$ surviving nodes share an entangled state, and each of them transmits a quantum system of $β_{\mathsf{q}}$ qudits to a newcomer. The newcomer then performs a measurement on the received quantum systems to generate its storage. Recent work [1] showed that, under functional repair where the regenerated content may differ from that of the failed node, there exists a unique optimal regenerating point that \emph{simultaneously minimizes both storage $α$ and repair bandwidth $d β_{\mathsf{q}}$} when $d \geq 2k-2$. In this paper, we show that, under \emph{exact repair}, where the newcomer reproduces exactly the same content as the failed node, this optimal point remains achievable. Our construction builds on the classical product-matrix framework and the Calderbank-Shor-Steane (CSS)-based stabilizer formalism.

Related papers

• Quantum Entanglement Halves the Oblivious Update Bandwidth [0.0]
  We consider $(n,k)$ MDS-coded distributed storage over $mathbbF_q$ with per-node storage $$ symbols.<n>For the oblivious update problem, where a single message symbol changes and neither helpers nor the stale node know which, the classical lower bound is $k log q$ bits.<n>We prove that when the $k$ helpers share prior quantum entanglement, the update bandwidth is $lceil /2 rceil cdot k log q$ bits-equivalent.
  arXiv  Detail & Related papers  (2026-05-19T01:42:48Z)
• Rényi exponent landscape of multipartite entanglement in free-fermion systems [51.56484100374058]
  We show that the Rényi tripartite information $I_3() exhibits a qualitatively $exclusion-dependent scaling at small Fermi momentum.<n>A direct consequence is a replica obstruction: $I_m(n)/I_m(1) sim zm-1 to 0$ for all integer $n geq 2$, so the leading von Neumann signal cannot be reconstructed from integer Rényi data.
  arXiv  Detail & Related papers  (2026-03-09T22:27:00Z)
• Breaking the Storage-Bandwidth Tradeoff in Distributed Storage with Quantum Entanglement [46.17112353277822]
  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.
  arXiv  Detail & Related papers  (2026-01-15T18:41:10Z)
• 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)
• Quantum $(r,δ)$-locally recoverable codes [37.306043163932905]
  We introduce the quantum counterpart of those codes by defining quantum $(r,delta)$-locally recoverable codes.<n>We show that there is an equivalence between the classical and quantum concepts of $(r,delta)$-local recoverability.
  arXiv  Detail & Related papers  (2024-12-21T11:45:32Z)
• Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes [38.729065908701585]
  We introduce a new class of qubit codes that we call Evenbly codes.<n>Our work indicates that Evenbly codes may show promise for practical quantum computing applications.
  arXiv  Detail & Related papers  (2024-07-16T17:18:13Z)
• Learning the Structure of Large Networked Systems Obeying Conservation Laws [5.86054250638667]
  Conservation laws in networked systems may be modeled as balance equations of the form $X = B* Y$. In several practical systems, the network structure is often unknown and needs to be estimated from data. We propose a new $ell_1$-regularized maximum likelihood estimator for this problem in the high-dimensional regime.
  arXiv  Detail & Related papers  (2022-06-14T18:16:52Z)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)
• Distributed Saddle-Point Problems Under Similarity [173.19083235638104]
  We show that a given suboptimality $epsilon0$ is achieved master/workers networks in $Omegabig. We then propose algorithms matching the lower bounds either types of networks (up to log-overs) We assess effectiveness of the proposed algorithms on a robust logistic regression problem.
  arXiv  Detail & Related papers  (2021-07-22T14:25:16Z)
• A Randomized Algorithm to Reduce the Support of Discrete Measures [79.55586575988292]
  Given a discrete probability measure supported on $N$ atoms and a set of $n$ real-valued functions, there exists a probability measure that is supported on a subset of $n+1$ of the original $N$ atoms. We give a simple geometric characterization of barycenters via negative cones and derive a randomized algorithm that computes this new measure by "greedy geometric sampling" We then study its properties, and benchmark it on synthetic and real-world data to show that it can be very beneficial in the $Ngg n$ regime.
  arXiv  Detail & Related papers  (2020-06-02T16:38:36Z)

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.