Minimum weight perfect matching of fault-tolerant topological quantum error correction in average O(1) parallel time


Consider a 2-D square array of qubits of extent L × L. We provide a proof that the minimum weight perfect matching problem associated with running a particular class of topological quantum error correction codes on this array can be exactly solved with a 2-D square array of classical computing devices, each of which is nominally associated with a fixed… (More)


4 Figures and Tables


Citations per Year

73 Citations

Semantic Scholar estimates that this publication has 73 citations based on the available data.

See our FAQ for additional information.