High threshold 2D nearest neighbor quantum computation.

ORAL

Abstract

We describe a quantum computation scheme on a 2D nearest neighbor coupled square lattice of qubits that requires relatively few physical qubits per logical qubit, permits logical operations between arbitrarily distant logical qubits in almost constant time and has a physical gate threshold error rate of almost 1{\%}. To the best of our knowledge, no other quantum computation scheme simultaneously possesses all of these desirable properties.

Authors

  • Austin Fowler

    Institute for Quantum Computing, Waterloo

  • Peter Groszkowski

    Institute for Quantum Computing, Waterloo

  • Robert Raussendorf

    University of British Columbia