This article provides an introduction to surface code quantum computing. We first estimate the size and speed of a surface code quantum computer. We then introduce the concept of the stabilizer,â€¦ (More)

Quantum computing becomes viable when a quantum state can be protected from environment-induced error. If quantum bits (qubits) are sufficiently reliable, errors are sparse and quantum errorâ€¦ (More)

A quantum computer can solve hard problems, such as prime factoring, database searching and quantum simulation, at the cost of needing to protect fragile quantum states from error. Quantum errorâ€¦ (More)

A simpli fied model of a two-di mensional ice sheet is described. It i nÂ c ludes basal ice sliding dependent on the basal water pressure, which itself is desc ribed by a simple theory of basal draiâ€¦ (More)

P. J. J. Oâ€™Malley, R. Babbush, I. D. Kivlichan, J. Romero, J. R. McClean, R. Barends, J. Kelly, P. Roushan, A. Tranter, N. Ding, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, A. G. Fowler,â€¦ (More)

The quantum computing scheme described in [1, 2], when viewed as a cluster state computation, features a 3-D cluster state, novel adjustable strength error correction capable of correcting generalâ€¦ (More)

State distillation is the process of taking a number of imperfect copies of a particular quantum state and producing fewer better copies. Until recently, the lowest overhead method of distillingâ€¦ (More)

It is challenging to transform an arbitrary quantum circuit into a form protected by surface code quantum error correcting codes (a variant of topological quantum error correction), especially if theâ€¦ (More)