Optimizing quantum codes with an application to the loss channel with partial erasure information

• URL: http://arxiv.org/abs/2105.13233v3
• Date: Fri, 25 Feb 2022 13:08:01 GMT
• Title: Optimizing quantum codes with an application to the loss channel with partial erasure information
• Authors: Benjamin Desef, Martin B. Plenio
• Abstract summary: We investigate the loss channel, which plays a key role in quantum communication, and in particular in quantum key distribution over long distances. We develop a numerical set of tools that allows to optimize an encoding specifically for recovering lost particles both deterministically and probabilistically. This allows us to arrive at new codes ideal for the distribution of entangled states in this particular setting, and also to investigate if encoding in qudits or allowing for non-deterministic correction proves advantageous compared to known QECCs.
• Score: 1.90365714903665
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum error correcting codes (QECCs) are the means of choice whenever quantum systems suffer errors, e.g., due to imperfect devices, environments, or faulty channels. By now, a plethora of families of codes is known, but there is no universal approach to finding new or optimal codes for a certain task and subject to specific experimental constraints. In particular, once found, a QECC is typically used in very diverse contexts, while its resilience against errors is captured in a single figure of merit, the distance of the code. This does not necessarily give rise to the most efficient protection possible given a certain known error or a particular application for which the code is employed. In this paper, we investigate the loss channel, which plays a key role in quantum communication, and in particular in quantum key distribution over long distances. We develop a numerical set of tools that allows to optimize an encoding specifically for recovering lost particles both deterministically and probabilistically, where some knowledge about what was lost is available, and demonstrate its capabilities. This allows us to arrive at new codes ideal for the distribution of entangled states in this particular setting, and also to investigate if encoding in qudits or allowing for non-deterministic correction proves advantageous compared to known QECCs. While we here focus on the case of losses, our methodology is applicable whenever the errors in a system can be characterized by a known linear map.

Related papers

• Analysis of Maximum Threshold and Quantum Security for Fault-Tolerant Encoding and Decoding Scheme Base on Steane Code [10.853582091917236]
  The original Steane code is not fault-tolerant because the CNOT gates in an encoded block may cause error propagation. We first propose a fault-tolerant encoding and decoding scheme, which analyzes all possible errors caused by each quantum gate in an error-correction period. We then provide the fault-tolerant scheme of the universal quantum gate set, including fault-tolerant preparation and verification of ancillary states.
  arXiv  Detail & Related papers  (2024-03-07T07:46:03Z)
• Flexible polar encoding for information reconciliation in QKD [2.627883025193776]
  Quantum Key Distribution (QKD) enables two parties to establish a common secret key that is information-theoretically secure. Errors that are generally considered to be due to the adversary's tempering with the quantum channel need to be corrected using classical communication over a public channel. We show that the reliability sequence can be derived and used to design an encoder independent of the choice of decoder.
  arXiv  Detail & Related papers  (2023-11-30T16:01:10Z)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
  We introduce a data efficient neural decoder that exploits the symmetries of the problem. We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
  arXiv  Detail & Related papers  (2023-04-14T19:46:39Z)
• 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)
• Adaptive surface code for quantum error correction in the presence of temporary or permanent defects [0.0]
  We show that combining an appropriate defect detection algorithm and a quarantine of the identified zone allows one to preserve the advantage of quantum error correction at finite code sizes. Results pave the way to the experimental implementation of large-scale quantum computers where defects will be inevitable.
  arXiv  Detail & Related papers  (2022-11-15T19:39:49Z)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• 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)
• 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 key distribution over quantum repeaters with encoding: Using Error Detection as an Effective Post-Selection Tool [0.9176056742068812]
  We show that it is often more efficient to use the error detection, rather than the error correction, capability of the underlying code to sift out cases where an error has been detected. We implement our technique for three-qubit repetition codes by modelling different sources of error in crucial components of the system.
  arXiv  Detail & Related papers  (2020-07-13T13:37:50Z)

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.