Quantum Data-Syndrome Codes: Subsystem and Impure Code Constructions

• URL: http://arxiv.org/abs/2302.01527v1
• Date: Fri, 3 Feb 2023 03:57:19 GMT
• Title: Quantum Data-Syndrome Codes: Subsystem and Impure Code Constructions
• Authors: Andrew Nemec
• Abstract summary: Quantum data-syndrome (QDS) codes have been proposed as a possible approach to protect against both data and syndrome errors. We introduce QDS subsystem codes, and show that they can outperform similar QDS stabilizer codes derived from them. We also give a construction of single-error-correcting QDS stabilizer codes from impure stabilizer codes, and show that any such code must satisfy a variant of the quantum Hamming bound for QDS codes.
• Score: 3.8073142980733
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum error correction requires the use of error syndromes derived from measurements that may be unreliable. Recently, quantum data-syndrome (QDS) codes have been proposed as a possible approach to protect against both data and syndrome errors, in which a set of linearly dependent stabilizer measurements are performed to increase redundancy. Motivated by wanting to reduce the total number of measurements performed, we introduce QDS subsystem codes, and show that they can outperform similar QDS stabilizer codes derived from them. We also give a construction of single-error-correcting QDS stabilizer codes from impure stabilizer codes, and show that any such code must satisfy a variant of the quantum Hamming bound for QDS codes. Finally, we use this bound to prove a new bound that applies to impure, but not pure, stabilizer codes that may be of independent interest.

Related papers

• Quantum subspace verification for error correction codes [13.856955493134908]
  We introduce a framework of quantum subspace verification, employing the knowledge of quantum error correction code subspaces to reduce the potential measurement budgets. For certain codes like the notable Calderbank-Shor-Steane codes and QLDPC stabilizer codes, the setting number and sample complexity can be significantly reduced. By combining the proposed subspace verification and direct fidelity estimation, we construct a protocol to verify the fidelity of general magic logical states.
  arXiv  Detail & Related papers  (2024-10-16T13:28:33Z)
• Effective Distance of Higher Dimensional HGPs and Weight-Reduced Quantum LDPC Codes [0.0]
  We show that there exists single-ancilla syndrome extraction circuits that largely preserve the effective distance of the weight-reduced qLDPC codes. As a corollary, our result shows that higher-dimensional hypergraph product codes have no troublesome hook errors when using any single-ancilla syndrome extraction circuit.
  arXiv  Detail & Related papers  (2024-09-03T18:02:33Z)
• 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)
• Robust Syndrome Extraction via BCH Encoding [4.123763595394021]
  Quantum data-syndrome (QDS) codes protect against errors both on the data qubits and on the syndrome itself via redundant measurement of stabilizer group elements. One way to define a QDS code is to choose a syndrome measurement code, a block code that encodes the syndrome of the underlying quantum code by defining additional stabilizer measurements. We show that these codes require $O(tlogell)$ extra measurements, where $ell$ is the number of stabilizer generators of the quantum code and $t$ is the number of errors corrected by the BCH code.
  arXiv  Detail & Related papers  (2023-11-27T18:09:10Z)
• Optimal Single-Shot Decoding of Quantum Codes [4.233908672338595]
  We discuss single-shot decoding of quantum Calderbank-Shor-Steane codes with faulty syndrome measurements. By adding redundant rows to the code's parity-check matrix we obtain an additional syndrome error correcting code.
  arXiv  Detail & Related papers  (2023-10-27T13:35:49Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• 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)
• Measurement based estimator scheme for continuous quantum error correction [52.77024349608834]
  Canonical discrete quantum error correction (DQEC) schemes use projective von Neumann measurements on stabilizers to discretize the error syndromes into a finite set. Quantum error correction (QEC) based on continuous measurement, known as continuous quantum error correction (CQEC), can be executed faster than DQEC and can also be resource efficient. We show that by constructing a measurement-based estimator (MBE) of the logical qubit to be protected, it is possible to accurately track the errors occurring on the physical qubits in real time.
  arXiv  Detail & Related papers  (2022-03-25T09:07:18Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Decoding of Quantum Data-Syndrome Codes via Belief Propagation [3.2689702143620143]
  Quantum data-syndrome codes are designed to protect the data qubits and syndrome bits concurrently. We propose an efficient decoding algorithm for quantum DS codes with sparse check matrices.
  arXiv  Detail & Related papers  (2021-02-03T10:05: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.