Single Quantum Deletion Error-Correcting Codes
- URL: http://arxiv.org/abs/2004.00814v1
- Date: Thu, 2 Apr 2020 04:48:40 GMT
- Title: Single Quantum Deletion Error-Correcting Codes
- Authors: Ayumu Nakayama and Manabu Hagiwara
- Abstract summary: We prove that quantum deletion error-correcting codes can be constructed by two sets that satisfy the conditions.
In other words, problems that correct the deletion errors for quantum states are reduced to problems that find the sets satisfying the condition.
- Score: 3.8073142980733
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this paper, we discuss a construction method of quantum deletion
error-correcting codes. First of all, we define deletion errors for quantum
states, an encoder, a decoder, and two conditions which is expressed by only
the combinatorial language. Then, we prove that quantum deletion
error-correcting codes can be constructed by two sets that satisfy the
conditions. In other words, problems that correct the deletion errors for
quantum states are reduced to problems that find the sets satisfying the
condition by this paper. Also, we performed experiment of the codes over IBM
Quantum Experience.
Related papers
- 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) - Quantum Deletion Codes Derived From Quantum Reed-Solomon Codes [3.8073142980733]
We present a construction method for quantum codes capable of correcting multiple deletion errors.
By introducing two new alogorithms, the alternating sandwich mapping and the block error locator, the proposed method reduces deletion error correction to erasure error correction.
arXiv Detail & Related papers (2023-06-23T09:32:09Z) - 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) - 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 Deletion Codes derived from Classical Deletion Codes (Extended
Abstract) [3.8073142980733]
The paper contributes to the fundamental theory for quantum deletion error-correcting codes.
The construction methods in this paper give examples of quantum codes that can correct single-quantum deletion errors.
arXiv Detail & Related papers (2022-08-11T08:51:01Z) - 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) - Permutation-Invariant Quantum Codes for Deletion Errors [3.8073142980733]
This paper presents conditions for constructing permutation-invariant quantum codes for deletion errors.
Our codes give the first example of quantum codes that can correct two or more deletion errors.
arXiv Detail & Related papers (2021-02-05T06:17:43Z) - Universal quantum computation and quantum error correction with
ultracold atomic mixtures [47.187609203210705]
We propose a mixture of two ultracold atomic species as a platform for universal quantum computation with long-range entangling gates.
One atomic species realizes localized collective spins of tunable length, which form the fundamental unit of information.
We discuss a finite-dimensional version of the Gottesman-Kitaev-Preskill code to protect quantum information encoded in the collective spins.
arXiv Detail & Related papers (2020-10-29T20:17:14Z) - 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) - 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) - A Four-Qubits Code that is a Quantum Deletion Error-Correcting Code with
the Optimal Length [3.8073142980733]
This paper provides a new instance of quantum deletion error-correcting codes.
It is also proven that the length of any single deletion error-correcting codes is greater than or equal to 4.
arXiv Detail & Related papers (2020-01-23T08:28:38Z)
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.