Go to  Advanced Search

Fast Decoders for Topological Quantum Codes

Show full item record

Files in this item

Files Size Format Description   View
Duclos-Cianci_QAMF10.pdf 3.003Mb Adobe Portable Document Format   View/Open
WS Jul 25 Guillaume.mp4 99.43Mb video/mp4 View in browser View/Open
 
Title: Fast Decoders for Topological Quantum Codes
Author: Duclos-Cianci, Guillaume
Subject Keywords Quantum error-correction;Topological quantum codes;Toric code;Renormalization;Belief propagation;Depolarizing channel;Erasure channel;Color codes
Issue Date: 2010-07-25
Publicly Available in cIRcle 2010-11-22
Abstract: Topological quantum computation and topological error correcting codes attracted a lot of interest recently because they require realistic nearest neighbors couplings and, by encoding the information in non-local topological degrees of freedom, they offer a very high resilience to local noise. I will 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 (Phys. Rev. Lett. 104, 050504 (2010)). 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 L, our algorithm runs in time log L compared to L^6 needed for the minimum-weight perfect matching algorithm previously used in this context and achieves a higher depolarizing error threshold (16.5% vs 15.5%). I will introduce the intuitions behind the m! ethod and present new developments.
Affiliation: Non UBC
URI: http://hdl.handle.net/2429/30068
Peer Review Status: Unreviewed
Scholarly Level: Graduate

This item appears in the following Collection(s)

Show full item record

All items in cIRcle are protected by copyright, with all rights reserved.

UBC Library
1961 East Mall
Vancouver, B.C.
Canada V6T 1Z1
Tel: 604-822-6375
Fax: 604-822-3893