Quantum codes based on fast pauli block transforms in the finite fieldReport as inadecuate




Quantum codes based on fast pauli block transforms in the finite field - Download this document for free, or read online. Document in PDF available to download.

Quantum Information Processing

, Volume 9, Issue 5, pp 611–628

First Online: 10 March 2010Received: 20 July 2009Accepted: 25 February 2010

Abstract

Motivated by the fast Pauli block transforms or matrices over the finite field GFq for an arbitrary number q, we suggest how to construct the simplified quantum code on the basis of quadratic residues. The present quantum code, which is the stabilizer quantum code, can be fast generated from an Abelian group with commutative quantum operators being selected from a suitable Pauli block matrix. This construction does not require the dual-containing or self-orthogonal constraint for the standard quantum error-correction code, thus allowing us to construct a quantum code with much efficiency.

KeywordsPauli block matrix Quadratic residues Abelian group Quantum error correction code  Download to read the full article text



Author: Ronghua Shi - Ying Guo - Moon Ho Lee

Source: https://link.springer.com/







Related documents