Quantum error-correcting codes and their geometries

• URL: http://arxiv.org/abs/2007.05992v3
• Date: Thu, 21 Oct 2021 19:22:28 GMT
• Title: Quantum error-correcting codes and their geometries
• Authors: Simeon Ball, Aina Centelles and Felix Huber
• Abstract summary: This article aims to introduce the reader to the underlying mathematics and geometry of quantum error correction. We go on to construct quantum codes: firstly qubit stabilizer codes, then qubit non-stabilizer codes, and finally codes with a higher local dimension. This allows one to deduce the parameters of the code efficiently, deduce the inequivalence between codes that have the same parameters, and presents a useful tool in deducing the feasibility of certain parameters.
• Score: 0.6445605125467572
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This is an expository article aiming to introduce the reader to the underlying mathematics and geometry of quantum error correction. Information stored on quantum particles is subject to noise and interference from the environment. Quantum error-correcting codes allow the negation of these effects in order to successfully restore the original quantum information. We briefly describe the necessary quantum mechanical background to be able to understand how quantum error-correction works. We go on to construct quantum codes: firstly qubit stabilizer codes, then qubit non-stabilizer codes, and finally codes with a higher local dimension. We will delve into the geometry of these codes. This allows one to deduce the parameters of the code efficiently, deduce the inequivalence between codes that have the same parameters, and presents a useful tool in deducing the feasibility of certain parameters. We also include sections on quantum maximum distance separable codes and the quantum MacWilliams identities.

Related papers

• Characterization of $n$-Dimensional Toric and Burst-Error-Correcting Quantum Codes from Lattice Codes [2.2657086779504017]
  We introduce a generalization of a quantum interleaving method for combating clusters of errors in toric quantum error-correcting codes. We present new $n$-dimensional toric quantum codes, where $ngeq 5$ are featured by lattice codes. We derive new $n$-dimensional quantum burst-error-correcting codes.
  arXiv  Detail & Related papers  (2024-10-26T17:29:20Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
  We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation. We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture. We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
  arXiv  Detail & Related papers  (2024-05-31T16:43:20Z)
• Randomly Monitored Quantum Codes [8.557392136621894]
  Recent studies have shown that quantum measurement itself can induce novel quantum phenomena. One example is a monitored random circuit, which can generate long-range entanglement faster than a random unitary circuit. In particular, we demonstrate that for a large class of quantum error-correcitng codes, it is impossible to destroy the encoded information through random single-qubit Pauli measurements.
  arXiv  Detail & Related papers  (2024-01-31T19:53:06Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Quantum Low-Density Parity-Check Codes [9.13755431537592]
  We discuss a particular class of quantum codes called low-density parity-check (LDPC) quantum codes. We introduce the zoo of LDPC quantum codes and discuss their potential for making quantum computers robust against noise.
  arXiv  Detail & Related papers  (2021-03-10T19:19:37Z)
• Changing the Local-Dimension of an Entanglement-Assisted Stabilizer Code Removes Entanglement Need [0.0]
  We show that codes for qudit quantum computers can be derived from already known codes. This could prove to be useful for fault-tolerant qudit, and even qubit, quantum computers.
  arXiv  Detail & Related papers  (2020-12-24T18:52:52Z)
• Deterministic correction of qubit loss [48.43720700248091]
  Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors. We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
  arXiv  Detail & Related papers  (2020-02-21T19:48:53Z)
• Testing a Quantum Error-Correcting Code on Various Platforms [5.0745290104790035]
  We propose a simple quantum error-correcting code for the detected amplitude damping channel. We implement the encoding, the channel, and the recovery on an optical platform, the IBM Q System, and a nuclear magnetic resonance system.
  arXiv  Detail & Related papers  (2020-01-22T13:15: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.