Semidefinite programming bounds on the size of entanglement-assisted codeword stabilized quantum codes

• URL: http://arxiv.org/abs/2311.07111v2
• Date: Fri, 2 Aug 2024 14:49:32 GMT
• Title: Semidefinite programming bounds on the size of entanglement-assisted codeword stabilized quantum codes
• Authors: Ching-Yi Lai, Pin-Chieh Tseng, Wei-Hsuan Yu,
• Abstract summary: We use the isotropic subgroup of the CWS group and the set of word operators of a CWS-type quantum code to derive an upper bound on the minimum distance. This characterization can be incorporated into the associated distance enumerators, enabling us to construct semidefinite constraints. We illustrate several instances where SDP bounds outperform LP bounds, and there are even cases where LP fails to yield meaningful results.
• Score: 5.13422222472898
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we explore the application of semidefinite programming to the realm of quantum codes, specifically focusing on codeword stabilized (CWS) codes with entanglement assistance. Notably, we utilize the isotropic subgroup of the CWS group and the set of word operators of a CWS-type quantum code to derive an upper bound on the minimum distance. Furthermore, this characterization can be incorporated into the associated distance enumerators, enabling us to construct semidefinite constraints that lead to SDP bounds on the minimum distance or size of CWS-type quantum codes. We illustrate several instances where SDP bounds outperform LP bounds, and there are even cases where LP fails to yield meaningful results, while SDP consistently provides tighter and relevant bounds. Finally, we also provide interpretations of the Shor-Laflamme weight enumerators and shadow enumerators for codeword stabilized codes, enhancing our understanding of quantum codes.

Related papers

• 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)
• Informed Dynamic Scheduling for QLDPC Codes [1.7802147489386628]
  We consider edge-wise informed dynamic scheduling (IDS) for QLDPC codes based on syndrome-based residual belief propagation (sRBP) Two strategies, including edge pool design and error pre-correction, are introduced to tackle this obstacle and quantum trapping sets. A novel sRBP equipped with a predict-and-reduce-error mechanism (PRE-sRBP) is proposed.
  arXiv  Detail & Related papers  (2024-10-02T03:00:15Z)
• Fault-Tolerant Quantum LDPC Encoders [0.0]
  We propose fault-tolerant encoders for quantum low-density parity (LDPC) codes. By grouping qubits within a quantum code over contiguous blocks, we show how preshared entanglement can be applied.
  arXiv  Detail & Related papers  (2024-05-12T10:16:43Z)
• Safeguarding Oscillators and Qudits with Distributed Two-Mode Squeezing [5.087080493308913]
  Multi-mode Gottesman-Kitaev-Preskill (GKP) codes have shown great promise in enhancing the protection of both discrete and analog quantum information. We provide a unique example where techniques from quantum sensing can be applied to improve multi-mode GKP codes. Inspired by distributed quantum sensing, we propose the distributed two-mode squeezing (dtms) GKP codes that offer benefits in error correction with minimal active encoding operations.
  arXiv  Detail & Related papers  (2024-02-08T18:24:22Z)
• Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation [55.8930142490617]
  We propose a decoder for QLDPC codes based on BP guided decimation (BPGD) BPGD significantly reduces the BP failure rate due to non-convergence.
  arXiv  Detail & Related papers  (2023-12-18T05:58:07Z)
• NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes [0.7088856621650764]
  We show improvements to the NLTS (No Low-Energy Trivial States) theorem and explicit lower bounds against a linear number of levels of the Sum-of-Squares hierarchy. We introduce a new method of planting a strongly explicit nontrivial codeword in linear-distance qLDPC codes, which in turn yields strongly explicit SoS lower bounds.
  arXiv  Detail & Related papers  (2023-11-16T01:58:00Z)
• Error-corrected quantum repeaters with GKP qudits [1.1279808969568252]
  The Gottesman-Kitaev-Preskill (GKP) code offers the possibility to encode higher-dimensional qudits into individual bosonic modes. The GKP code has found recent applications in theoretical investigations of quantum communication protocols.
  arXiv  Detail & Related papers  (2023-03-28T15:04:06Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• 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)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.