Entanglement Cost of Erasure Correction in Quantum MDS Codes

• URL: http://arxiv.org/abs/2505.20284v1
• Date: Mon, 26 May 2025 17:58:43 GMT
• Title: Entanglement Cost of Erasure Correction in Quantum MDS Codes
• Authors: Kaushik Senthoor,
• Abstract summary: 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.
• Score: 2.7195102129095003
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• 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)
• Network-Based Quantum Computing: an efficient design framework for many-small-node distributed fault-tolerant quantum computing [0.09176056742068811]
  We propose network-based quantum computation (NBQC) to efficiently realize distributed fault-tolerant quantum computation.<n>We numerically show that, for practical benchmark tasks, our method achieves shorter execution times than circuit-based strategies.
  arXiv  Detail & Related papers  (2026-01-14T10:58:31Z)
• Quantum-network nodes with real-time noise mitigation using spectator qubits [0.0]
  Quantum networks might enable quantum communication and distributed quantum computation.<n>We introduce a method that uses spectator' qubits combined with real-time decision making and feedforward to mitigate dephasing of stored quantum states during remote entanglement sequences.<n>Our results show that spectator qubits can improve quantum network memory using minimal overhead and naturally present resources.
  arXiv  Detail & Related papers  (2025-05-08T18:24:32Z)
• Secure and Efficient Entanglement Distribution Protocol for Near-Term Quantum Internet [1.7562083088615124]
  This paper introduces a protocol to distribute entanglements among quantum devices within classical-quantum networks with limited quantum links. The proposed protocol uses entanglement swapping to distribute entanglements efficiently in a butterfly network. We also propose a protocol for securing entanglement distribution against malicious entanglements using quantum state encoding through rotation.
  arXiv  Detail & Related papers  (2023-12-10T05:38:40Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Secure multi-party quantum computation protocol for quantum circuits: the exploitation of triply-even quantum error-correcting codes [2.915868985330569]
  MPQC protocol is a cryptographic primitive allowing error-free distributed quantum computation. We suggest a modified MPQC protocol that adopts unconventional quantum error-correcting codes.
  arXiv  Detail & Related papers  (2022-06-10T04:43:11Z)
• Resource Reduction in Multiplexed High-Dimensional Quantum Reed-Solomon Codes [0.0]
  We show that our method can significantly reduce the required number of $rm CX$ gates needed in the encoding circuits for the quantum Reed-Solomon code. Our approach is also applicable to many other quantum error correction codes and quantum algorithms, including Grovers and quantum walks.
  arXiv  Detail & Related papers  (2022-06-08T07:11:01Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Recycling qubits in near-term quantum computers [1.2891210250935146]
  We propose a protocol that can unitarily reset qubits when the circuit has a common convolutional form. This protocol generates fresh qubits from used ones by partially applying the time-reversed quantum circuit over qubits that are no longer in use.
  arXiv  Detail & Related papers  (2020-12-03T03:24:50Z)
• 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)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.