PIRSA:14070006

Quantum computing by color-code lattice surgery

Landahl, A. (2014). Quantum computing by color-code lattice surgery. Perimeter Institute. https://pirsa.org/14070006

Landahl, Andrew. Quantum computing by color-code lattice surgery. Perimeter Institute, Jul. 15, 2014, https://pirsa.org/14070006 

          @misc{ pirsa_PIRSA:14070006,
            doi = {10.48660/14070006},
            url = {https://pirsa.org/14070006},
            author = {Landahl, Andrew},
            keywords = {},
            language = {en},
            title = {Quantum computing by color-code lattice surgery},
            publisher = {Perimeter Institute},
            year = {2014},
            month = {jul},
            note = {PIRSA:14070006 see, \url{https://pirsa.org}}
          }

Andrew Landahl University of New Mexico

Talk numberPIRSA:14070006
DOI10.48660/14070006
Collection
Talk Type Conference

Abstract

In this talk, I will explain how to use lattice surgery to enact a universal set of fault-tolerant quantum operations with color codes. Along the way, I will also show how to improve existing surface-code lattice-surgery methods. Lattice-surgery methods use fewer qubits and the same time or less than associated defect-braiding methods. Per code distance, color-code lattice surgery uses approximately half the qubits and the same time or less than surface-code lattice surgery. Color-code lattice surgery can also implement the Hadamard and phase gates in a single transversal step—much faster than surface-code lattice surgery can. I will show that against uncorrelated circuit-level depolarizing noise, color-code lattice surgery uses fewer qubits to achieve the same degree of fault-tolerant error suppression as surface-code lattice-surgery when the noise rate is low enough and the error suppression demand is high enough.