2021/09/30 by Christopher Chamberland, Earl T. Campbell · 1 citation
Computer Science · Engineering · Mathematics · Physics and Astronomy · #Advanced Memory and Neural Computing #Algorithm #Combinatorics #Computer science #Geometry #Lattice (music) #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum and electron transport phenomena #Quantum computer #Quantum mechanics #Qubit #Theoretical computer science #Topology (electrical circuits) #Twist #quant-ph
paper · pdf · doi:10.1103/prxquantum.3.010331
published as PRX Quantum 3, 010331 (2022) · 23 pages, 18 figures, comments welcome! V2 includes 2 added figures and fixed typos. V3 fixed a typo in Eq. (10)
openalex created_date 2021/09/13 · arxiv created 2022/01/15 · openalex publication_date 2022/02/25 · arxiv updated 2022/03/01 · openalex updated_date 2026/08/05
Lattice surgery protocols allow for the efficient implementation of universal gate sets with two-dimensional topological codes where qubits are constrained to interact with one another locally. In this work, we first introduce a decoder capable of correcting spacelike and timelike errors during lattice surgery protocols. Afterwards, we compute logical failure rates of a lattice surgery protocol for a biased circuit-level noise model. We then provide a new protocol for performing twist-free lattice surgery, where we avoid twist defects in the bulk of the lattice. Our twist-free protocol eliminates the extra circuit components and gate scheduling complexities associated with the measurement of higher weight stabilizers when using twist defects. We also provide a protocol for temporally encoded lattice surgery that can be used to reduce both runtimes and the total space-time costs of quantum algorithms. Lastly, we propose a layout for a quantum processor that is more efficient for rectangular surface codes exploiting noise bias, and which is compatible with the other techniques mentioned above.