Permutation-invariant quantum coding for quantum deletion channels

• URL: http://arxiv.org/abs/2102.02494v2
• Date: Mon, 31 May 2021 12:52:58 GMT
• Title: Permutation-invariant quantum coding for quantum deletion channels
• Authors: Yingkai Ouyang
• Abstract summary: We show that a permutation-invariant quantum code that has a distance of $t+1$ can correct $t$ quantum deletions for any positive integer $t$ in both the qubit and the qudit setting. We focus our attention on a specific family of $N$-qubit permutation-invariant quantum codes, which we call shifted gnu codes, and show that their encoding and decoding algorithms can be performed in $O(N)$ and $O(N2)$.
• Score: 6.85316573653194
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum deletions, which are harder to correct than erasure errors, occur in many realistic settings. It is therefore pertinent to develop quantum coding schemes for quantum deletion channels. To date, not much is known about which explicit quantum error correction codes can combat quantum deletions. We note that {\em any} permutation-invariant quantum code that has a distance of $t+1$ can correct $t$ quantum deletions for any positive integer $t$ in both the qubit and the qudit setting. Leveraging on coding properties of permutation-invariant quantum codes under erasure errors, we derive corresponding coding bounds for permutation-invariant quantum codes under quantum deletions. We focus our attention on a specific family of $N$-qubit permutation-invariant quantum codes, which we call shifted gnu codes, and show that their encoding and decoding algorithms can be performed in $O(N)$ and $O(N^2)$.

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)
• 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)
• A family of permutationally invariant quantum codes [54.835469342984354]
  We show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction contains some of the previously known permutationally invariant quantum codes. For small $t$, these conditions can be used to construct new examples of codes by computer.
  arXiv  Detail & Related papers  (2023-10-09T02:37:23Z)
• Finite-round quantum error correction on symmetric quantum sensors [8.339831319589134]
  Heisenberg limit provides a quadratic improvement over the standard quantum limit. It remains elusive because of the inevitable presence of noise decohering quantum sensors. We side-step this no-go result by using an optimal finite number of rounds of quantum error correction.
  arXiv  Detail & Related papers  (2022-12-12T23:41:51Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Quantum variational learning for quantum error-correcting codes [5.627733119443356]
  VarQEC is a noise-resilient variational quantum algorithm to search for quantum codes with a hardware-efficient encoding circuit. In principle, VarQEC can find quantum codes for any error model, whether additive or non-additive, or non-degenerate, pure or impure.
  arXiv  Detail & Related papers  (2022-04-07T16:38:27Z)
• 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 Error Mitigation Relying on Permutation Filtering [84.66087478797475]
  We propose a general framework termed as permutation filters, which includes the existing permutation-based methods as special cases. We show that the proposed filter design algorithm always converges to the global optimum, and that the optimal filters can provide substantial improvements over the existing permutation-based methods.
  arXiv  Detail & Related papers  (2021-07-03T16:07:30Z)
• Trade-offs on number and phase shift resilience in bosonic quantum codes [10.66048003460524]
  One quantum error correction solution is to encode quantum information into one or more bosonic modes. We show that by using arbitrarily many modes, $g$-gapped multi-mode codes can yield good approximate quantum error correction codes.
  arXiv  Detail & Related papers  (2020-08-28T10:44:34Z)
• Quantum error-correcting codes and their geometries [0.6445605125467572]
  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.
  arXiv  Detail & Related papers  (2020-07-12T13:57:39Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.