PIRSA:21040036

Fault-tolerant qubit from a constant number of components

APA

Wan, K. (2021). Fault-tolerant qubit from a constant number of components. Perimeter Institute. https://pirsa.org/21040036

MLA

Wan, Kianna. Fault-tolerant qubit from a constant number of components. Perimeter Institute, Apr. 28, 2021, https://pirsa.org/21040036

BibTex

          @misc{ pirsa_PIRSA:21040036,
            doi = {10.48660/21040036},
            url = {https://pirsa.org/21040036},
            author = {Wan, Kianna},
            keywords = {Quantum Information},
            language = {en},
            title = {Fault-tolerant qubit from a constant number of components},
            publisher = {Perimeter Institute},
            year = {2021},
            month = {apr},
            note = {PIRSA:21040036 see, \url{https://pirsa.org}}
          }
          

Kianna Wan

Alphabet (United States)

Talk number
PIRSA:21040036
Abstract

With gate error rates in multiple technologies now below the threshold required for fault-tolerant quantum computation, the major remaining obstacle to useful quantum computation is scaling, a challenge greatly amplified by the huge overhead imposed by quantum error correction itself. I’ll discuss a new fault-tolerant quantum computing scheme that can nonetheless be assembled from a small number of experimental components, potentially dramatically reducing the engineering challenges associated with building a large-scale fault-tolerant quantum computer. The architecture couples a single controllable qubit to a pair of delay lines which terminate in a detector. Below a threshold value for the error rate associated with the controllable qubit, the logical error rate decays exponentially with the square root of the delay line coherence time. The required gates can be implemented using existing technologies in quantum photonic and phononic systems. With continued incremental improvements in only a few components, we expect these systems to be promising candidates for demonstrating fault-tolerant quantum computation with comparatively modest experimental effort.