Non-binary Unitary Error Bases and Quantum Codes

Error operator bases for systems of any dimension are defined and natural generalizations of the bit/sign flip error basis for qubits are given. These bases allow generalizing the construction of quantum codes based on eigenspaces of Abelian groups. As a consequence, quantum codes can be constructed from linear codes over \ints_n for any $n$. The generalization of the punctured code construction leads to many codes which permit transversal (i.e. fault tolerant) implementations of certain operations compatible with the error basis.Comment: 10 pages, preliminary repor

Generalized Toric Codes Coupled to Thermal Baths

We have studied the dynamics of a generalized toric code based on qudits at finite temperature by finding the master equation coupling the code's degrees of freedom to a thermal bath. As a consequence, we find that for qutrits new types of anyons and thermal processes appear that are forbidden for qubits. These include creation, annihilation and diffusion throughout the system code. It is possible to solve the master equation in a short-time regime and find expressions for the decay rates as a function of the dimension $d$ of the qudits. Although we provide an explicit proof that the system relax to the Gibbs state for arbitrary qudits, we also prove that above a certain crossing temperature, qutrits initial decay rate is smaller than the original case for qubits. Surprisingly this behavior only happens with qutrits and not with other qudits with $d>3$.Comment: Revtex4 file, color figures. New Journal of Physics' versio

Expansion algorithm for the density matrix

A purification algorithm for expanding the single-particle density matrix in terms of the Hamiltonian operator is proposed. The scheme works with a predefined occupation and requires less than half the number of matrix-matrix multiplications compared to existing methods at low (90%) occupancy. The expansion can be used with a fixed chemical potential in which case it is an asymmetric generalization of and a substantial improvement over grand canonical McWeeny purification. It is shown that the computational complexity, measured as number of matrix multiplications, essentially is independent of system size even for metallic materials with a vanishing band gap.Comment: 5 pages, 4 figures, to appear in Phys. Rev.