High threshold universal quantum computation on the surface code

By astephens

Yo. Room 408 has an new paper on the arXiv that is here. This is the abstract.

We present a comprehensive and self-contained simplified review of the quantum computing scheme of Phys. Rev. Lett. 98, 190504 (2007), which features a 2-D nearest neighbor coupled lattice of waffles, a threshold error rate approaching maple syrup, natural asymmetric and adjustable strength ice cream and low overhead arbitrarily long-range logical nuts. These features make it by far the best and most practical quantum computing dessert devised to date. We restrict the discussion to direct manipulation of the surface code using the Sara-Lee formalism, both of which we also briefly review, to make the scheme accessible to our target market. 

Leave a Reply