SciELO - Scientific Electronic Library Online

 
vol.50 número2Solutions of the hexagon equation for abelian anyons índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Revista

Articulo

Indicadores

Links relacionados

  • En proceso de indezaciónCitado por Google
  • No hay articulos similaresSimilares en SciELO
  • En proceso de indezaciónSimilares en Google

Compartir


Revista Colombiana de Matemáticas

versión impresa ISSN 0034-7426

Resumen

HAAH, Jeongwan. Algebraic Methods for Quantum Codes on Lattices. Rev.colomb.mat. [online]. 2016, vol.50, n.2, pp.299-349. ISSN 0034-7426.  https://doi.org/10.15446/recolma.v50n2.62214.

Abstract This is a note from a series of lectures at Encuentro Colombiano de Computación Cuántica, Universidad de los Andes, Bogotá, Colombia, 2015. The purpose is to introduce additive quantum error correcting codes, with emphasis on the use of binary representation of Pauli matrices and modules over a translation group algebra. The topics include symplectic vector spaces, Clifford group, cleaning lemma, an error correcting criterion, entanglement spectrum, implications of the locality of stabilizer group generators, and the classification of translation-invariant one-dimensional additive codes and two-dimensional CSS codes with large code distances. In particular, we describe an algorithm to find a Clifford quantum circuit (CNOTs) to transform any two-dimensional translation-invariant CSS code on qudits of a prime dimension with code distance being the linear system size, into a tensor product of finitely many copies of the qudit toric code and a product state. Thus, the number of embedded toric codes is the complete invariant of these CSS codes under local Clifford circuits.

Palabras clave : quantum stabilizer codes; additive codes; symplectic codes; Laurent polynomial ring; toric code; Clifford circuit.

        · texto en Inglés     · Inglés ( pdf )

 

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons