Quantum locally recoverable code with intersecting recovery sets

• URL: http://arxiv.org/abs/2501.10354v1
• Date: Fri, 17 Jan 2025 18:55:47 GMT
• Title: Quantum locally recoverable code with intersecting recovery sets
• Authors: Kaifeng Bu, Weichen Gu, Xiang Li,
• Abstract summary: We introduce the concept of quantum locally recoverable codes (qLRCs) with intersecting recovery sets. We derive a singleton-like bound for these codes by leveraging the additional information provided by the intersecting recovery sets.
• Score: 4.566850249315913
• License:
• Abstract: We introduce the concept of quantum locally recoverable codes (qLRCs) with intersecting recovery sets. We derive a singleton-like bound for these codes by leveraging the additional information provided by the intersecting recovery sets. Furthermore, we provide a construction for qLRCs with intersecting recovery sets by introducing a variation of the hypergraph product. Finally, we apply our qLRC methods to obtain improved results for classical LRCs. These results may provide new insights into the locality of quantum error correction code.

Related papers

• When Wyner and Ziv Met Bayes in Quantum-Classical Realm [8.499685241219366]
  We introduce a new formulation based on a backward (posterior) channel, replacing the single-letter distortion observable with a single-letter posterior channel to capture reconstruction error. We establish a connection between rate-distortion and rate-channel theory, showing that a rate-channel compression protocol attains the optimal rate-distortion function for a specific distortion measure and level.
  arXiv  Detail & Related papers  (2025-02-17T18:49:19Z)
• List Decodable Quantum LDPC Codes [49.2205789216734]
  We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff. We get efficiently list decodable QLDPC codes with unique decoders.
  arXiv  Detail & Related papers  (2024-11-06T23:08:55Z)
• The Road to Near-Capacity CV-QKD Reconciliation: An FEC-Agnostic Design [53.67135680812675]
  A new codeword-based QKD reconciliation scheme is proposed. Both the authenticated classical channel (ClC) and the quantum channel (QuC) are protected by separate forward error correction (FEC) coding schemes. The proposed system makes QKD reconciliation compatible with a wide range of FEC schemes.
  arXiv  Detail & Related papers  (2024-03-24T14:47:08Z)
• Quantum Locally Recoverable Codes [27.438045041448248]
  In the long term, like their classical counterparts, quantum locally recoverable codes may be used for large-scale quantum data storage. We show that even the weakest form of a stronger locality property called local correctability, which permits more robust local recovery, is impossible quantumly.
  arXiv  Detail & Related papers  (2023-11-15T02:27:01Z)
• Learned layered coding for Successive Refinement in the Wyner-Ziv Problem [18.134147308944446]
  We propose a data-driven approach to explicitly learn the progressive encoding of a continuous source. This setup refers to the successive refinement of the Wyner-Ziv coding problem. We demonstrate that RNNs can explicitly retrieve layered binning solutions akin to scalable nested quantization.
  arXiv  Detail & Related papers  (2023-11-06T12:45:32Z)
• Lossy Quantum Source Coding with a Global Error Criterion based on a Posterior Reference Map [7.646713951724011]
  We consider the lossy quantum source coding problem where the task is to compress a given quantum source below its von Neumann entropy. Inspired by the duality connections between the rate-distortion and channel coding problems in the classical setting, we propose a new formulation for the problem.
  arXiv  Detail & Related papers  (2023-02-01T17:44:40Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• All-photonic one-way quantum repeaters [15.3862808585761]
  We propose a general framework for all-photonic one-way quantum repeaters based on the measurement-based error correction. We present a novel decoding scheme, where the error correction process is carried out at the destination based on the accumulated data from the measurements made across the network.
  arXiv  Detail & Related papers  (2022-10-18T18:07:19Z)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz [68.8204255655161]
  We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms. We use the Unitary Coupled Cluster (UCC) ansatz to reduce circuit depth and gate count.
  arXiv  Detail & Related papers  (2020-07-20T22:26:16Z)

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.