Direct simulation of multiply-concatenated fault-tolerant quantum error correction

APA

Haselgrove, H. (2008). Direct simulation of multiply-concatenated fault-tolerant quantum error correction. Perimeter Institute for Theoretical Physics. https://pirsa.org/08090061

MLA

Haselgrove, Henry. Direct simulation of multiply-concatenated fault-tolerant quantum error correction. Perimeter Institute for Theoretical Physics, Sep. 17, 2008, https://pirsa.org/08090061

BibTex

          @misc{ scivideos_PIRSA:08090061,
            doi = {10.48660/08090061},
            url = {https://pirsa.org/08090061},
            author = {Haselgrove, Henry},
            keywords = {Quantum Information},
            language = {en},
            title = {Direct simulation of multiply-concatenated fault-tolerant quantum error correction},
            publisher = {Perimeter Institute for Theoretical Physics},
            year = {2008},
            month = {sep},
            note = {PIRSA:08090061 see, \url{https://scivideos.org/pirsa/08090061}}
          }
          

Henry Haselgrove Defence Science and Technology Group

Source Repository PIRSA

Abstract

I will report on efforts to implement a new method for simulating concatenated quantum error correction, where many levels of concatenation are simulated together explicitly. That is, the approach involves a Monte Carlo simulation of a noisy circuit involving many thousands of qubits, rather than tens of qubits previously. The new approach allows the threshold and resource usage of concatenated quantum error correction to be determined more accurately than before. Also, the approach makes it possible to better study the effects of circuit optimizations and message-passing algorithms [Poulin, PRA, 2006] on the performance of fault-tolerant concatenated quantum error correction. Such studies are necessary in order make a proper comparison with competing families of error-correction protocols, such as those involving surface codes. In the talk, a range of new numerical results will be presented.