On the Capacity of Distributed Quantum Storage

• URL: http://arxiv.org/abs/2510.10568v1
• Date: Sun, 12 Oct 2025 12:31:03 GMT
• Title: On the Capacity of Distributed Quantum Storage
• Authors: Hua Sun, Syed A. Jafar,
• Abstract summary: 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.
• Score: 14.164370730003691
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Scalable Memory Sharing in Photonic Quantum Memristors for Reservoir Computing [3.757436782267772]
  photonic quantum memristors (PQMRs) have enabled non-Markovian responses but memory remains confined to local elements.<n>Here, we propose a scalable PQMR network that enables measurement-based memory sharing.<n>Our approach paves the way toward high-capacity quantum machine learning using memristive devices compatible with linear-optical quantum computing.
  arXiv  Detail & Related papers  (2026-01-30T14:51:42Z)
• Robustness of quantum data hiding against entangled catalysts and memory [47.791962198275066]
  We develop a general framework for state discrimination that unifies catalytic and memory-assisted local discrimination protocols.<n>We prove that when the hiding states are separable, neither entangled catalysts nor quantum memory can increase the optimal discrimination probability.<n>In contrast, for some entangled states, a reusable quantum memory turns locally indistinguishable states into ones that can be discriminated almost perfectly.
  arXiv  Detail & Related papers  (2025-11-06T14:36:36Z)
• Exact Quantum Capacity of Decohering Channels in Arbitrary Dimensions [0.0]
  We derive exact analytical expressions for the quantum capacity of a broad class of decohering quantum channels of the form $Lambda(rho)= (1-x)rho + x D(rho)$, where $D(rho)$ represents a structured decoherence process.<n>These channels are shown to be degradable for all noise parameters and in arbitrary dimensions, yielding closed-form, single-letter capacity formulas.
  arXiv  Detail & Related papers  (2025-06-16T12:06:26Z)
• Quantum cryptography integrating an optical quantum memory [0.0]
  Developments in scalable quantum networks rely critically on optical quantum memories.<n>We present the first demonstration of a cryptography protocol incorporating an intermediate quantum memory layer.
  arXiv  Detail & Related papers  (2025-03-31T18:00:04Z)
• Identifying quantum resources in encoded computations [0.6144680854063939]
  We introduce a general framework which allows us to correctly identify quantum resources in encoded computations. We illustrate our general construction with the Gottesman--Kitaev--Preskill encoding of qudits with odd dimension. The resulting Wigner function, which we call the Zak-Gross Wigner function, is shown to correctly identify quantum resources through its phase-space negativity.
  arXiv  Detail & Related papers  (2024-07-25T21:01:18Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• Reliable Quantum Memories with Unreliable Components [18.24111909029755]
  We introduce the notion of stable quantum memories and define the storage rate as the ratio of the number of logical qubits to the total number of physical qubits. We demonstrate that a strictly positive storage rate can be achieved by constructing a quantum memory system with quantum expander codes.
  arXiv  Detail & Related papers  (2024-06-08T23:53:48Z)
• Maximal Information Leakage from Quantum Encoding of Classical Data [9.244521717083696]
  An adversary can access a single copy of the state of a quantum system that encodes some classical data. The resulting measure of information leakage is the multiplicative increase of the probability of correctly guessing any function of the classical data.
  arXiv  Detail & Related papers  (2023-07-24T05:16:02Z)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• 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)
• Neural Network Compression for Noisy Storage Devices [71.4102472611862]
  Conventionally, model compression and physical storage are decoupled. This approach forces the storage to treat each bit of the compressed model equally, and to dedicate the same amount of resources to each bit. We propose a radically different approach that: (i) employs analog memories to maximize the capacity of each memory cell, and (ii) jointly optimize model compression and physical storage to maximize memory utility.
  arXiv  Detail & Related papers  (2021-02-15T18:19:07Z)
• Entanglement transfer, accumulation and retrieval via quantum-walk-based qubit-qudit dynamics [50.591267188664666]
  Generation and control of quantum correlations in high-dimensional systems is a major challenge in the present landscape of quantum technologies. We propose a protocol that is able to attain entangled states of $d$-dimensional systems through a quantum-walk-based it transfer & accumulate mechanism. In particular, we illustrate a possible photonic implementation where the information is encoded in the orbital angular momentum and polarization degrees of freedom of single photons.
  arXiv  Detail & Related papers  (2020-10-14T14:33:34Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)

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.