Quantum Error-Correction Codes on Abelian Groups
author
Abstract:
We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.
similar resources
Quantum Error-correction Codes on Abelian Groups
In classical public key cryptography the security of the cryptosystems are based on the difficulty of calculating certain functions. A famous example is the ASP cryptosystem which was based on the assumption that factoring large integers could not be done in polynomial time (on classical computers). The typical situation in these systems is that two parties (Bob and Alice) whish to communicate ...
full textQuantum Error Correction Codes
This report contains the comprehensive explanation of some most important quantum error correction codes. After the brief corroboration of the quantum mechanical principles that govern any quantum mechanical process, we introduce stabilizer formalism and stabilizer codes for quantum error correction (QEC). As an interesting derivative from classical counterpart we also present Quantum Reed Mull...
full textQuantum Convolutional Error Correction Codes
Quantum error correction code (QECC) is a succinct way to protect a quantum state from decoherence. The basic idea behind all QECC schemes is that by suitably encoding a quantum state in a larger Hilbert space H , and then later on measuring the wave function into certain subspace C of H , it is possible to detect the kind of errors that have occurred. Finally, one can correct the error by appl...
full textAlgebraic Quantum Error Correction Codes
A systematic and exhaustive method based on the group structure of a unitary Lie algebra is proposed to generate an enormous number of quantum codes. With respect to the algebraic structure, the orthogonality condition, which is the central rule of generating quantum codes, is proved to be fully equivalent to the distinguishability of the elements in this structure. In addition, four types of q...
full textPermutationally Invariant Codes for Quantum Error Correction
A permutationally invariant n-bit code for quantum error correction can be realized as a subspace stabilized by the non-Abelian group Sn. The code corresponds to bases for the trivial representation, and all other irreducible representations, both those of higher dimension and orthogonal bases for the trivial representation, are available for error correction. A number of new (non-additive) cod...
full textQuantum Error Correction Via Codes Over
The problem of finding quantum-error-correcting codes is transformed into the problem of finding additive codes over the field GF (4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on such codes of length up to 30 qubits. Manuscript received ; revised The authors are with AT&T Lab...
full textMy Resources
Journal title
volume 5 issue None
pages 55- 67
publication date 2010-05
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023