PIRSA:16060124

Foliated Quantum Codes, with a chance of Anyonic Time

Stace, T. (2016). Foliated Quantum Codes, with a chance of Anyonic Time. Perimeter Institute. https://pirsa.org/16060124

Stace, Thomas. Foliated Quantum Codes, with a chance of Anyonic Time. Perimeter Institute, Jun. 29, 2016, https://pirsa.org/16060124 

          @misc{ pirsa_PIRSA:16060124,
            doi = {10.48660/16060124},
            url = {https://pirsa.org/16060124},
            author = {Stace, Thomas},
            keywords = {Quantum Information},
            language = {en},
            title = {Foliated Quantum Codes, with a chance of Anyonic Time},
            publisher = {Perimeter Institute},
            year = {2016},
            month = {jun},
            note = {PIRSA:16060124 see, \url{https://pirsa.org}}
          }

Thomas Stace University of Queensland

DOI 10.48660/16060124
Collection
Talk Type Scientific Series
Subject

Abstract

Raussendorf introduced a powerful model of fault tolerant measurement based quantum computation, which can be understood as a layering (or “foliation”) of a multiplicity of Kitaev’s toric code.  I will discuss our generalisation of Raussendorf’s construction to an arbitrary CSS code.  We call this a Foliated Quantum Code.  Decoding this foliated construction is not necessarily straightforward, so I will discuss an example in which we foliate a family of finite-rate quantum turbo codes, and present the results of numerical simulations of the decoder performance.

If I have time, I will discuss some ongoing work (with Gavin Brennan) on relational time applied to topological quantum field theories, in particular, how anyonic systems with essentially trivial dynamics can still exhibit correlations that track “time".