Fast Constructions of Quantum Codes Based on Residues Pauli Block Matrices | Zendy

Ying Guo | Zendy; Guihu Zeng | Zendy; Moon-Ho Lee | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Fast Constructions of Quantum Codes Based on Residues Pauli Block Matrices

Author(s) -

Ying Guo,

Guihu Zeng,

Moon-Ho Lee

Publication year - 2010

Publication title -

advances in mathematical physics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.283

H-Index - 23

eISSN - 1687-9139

pISSN - 1687-9120

DOI - 10.1155/2010/469124

Subject(s) - pauli exclusion principle , pauli matrices , block code , quantum , block (permutation group theory) , construct (python library) , mathematics , quadratic equation , abelian group , quantum convolutional code , quantum error correction , computer science , physics , pure mathematics , algorithm , quantum mechanics , quantum algorithm , combinatorics , mathematical physics , geometry , decoding methods , programming language

We demonstrate how to fast construct quantum error-correction codes based on quadratic residues Pauli block transforms. The present quantum codes have an advantage of being fast designed from Abelian groups on the basis of Pauli block matrices that can be yielded from quadratic residues with much efficiency

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research