Tuesday, July 9, 2013

1307.1740 (Austin G. Fowler)

Minimum weight perfect matching in O(1) parallel time    [PDF]

Austin G. Fowler
Consider a 2-D square array of qubits of infinite extent. We provide a formal proof that the infinite size 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 corresponding infinite 2-D square array of classical computing devices in constant average time per round of error detection provided physical error rates are below fixed nonzero values, and other physically reasonable assumptions.
View original: http://arxiv.org/abs/1307.1740

No comments:

Post a Comment