Home | About Journal | Web Links | E-mail Alerts | RSS RSS Icon | Browse
Previous Article Next Article

Fast Decoders for Topological Quantum Codes

Source: Phys. Rev. Lett. 104, 050504 (2010); doi:10.1103/PhysRevLett.104.050504

Published 5 February 2010

PACS
  • 03.67.Ac
    Quantum algorithms, protocols and simulations
  • 03.65.Vf
    Phases: geometric; dynamic or topological (quantum theory)
  • 03.67.Pp
    Quantum error correction and other methods for protection against decoherence
  • 05.50.+q
    Lattice theory and statistics
  • YEAR: 2010
PUBLICATION DATA
Publisher:
AIP is a member of CrossRef APS
Guillaume Duclos-Cianci and David Poulin
Département de Physique, Université de Sherbrooke, Québec, Canada
We present a family of algorithms, combining real-space renormalization methods and belief propagation, to estimate the free energy of a topologically ordered system in the presence of defects. Such an algorithm is needed to preserve the quantum information stored in the ground space of a topologically ordered system and to decode topological error-correcting codes. For a system of linear size [script-l], our algorithm runs in time log[script-l] compared to [script-l]6 needed for the minimum-weight perfect matching algorithm previously used in this context and achieves a higher depolarizing error threshold. ©2010 The American Physical Society
History: Received 3 November 2009; published 5 February 2010
Permalink: http://link.aps.org/abstract/PRL/v104/e050504
ADVERTISEMENT