{"paper":{"title":"Practical Topological Cluster State Quantum Computing Requires Loss Below 1%","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam C. Whiteside, Austin G. Fowler","submitted_at":"2014-09-17T07:02:36Z","abstract_excerpt":"The surface code cannot be used when qubits vanish during computation; instead, a variant known as the topological cluster state is necessary. It has a gate error threshold of $0.75% and only requires nearest-neighbor interactions on a 2D array of qubits. Previous work on loss tolerance using this code only considered qubits vanishing during measurement. We begin by also including qubit loss during two-qubit gates and initialization, and then additionally consider interaction errors that occur when neighbors attempt to entangle with a qubit that isn't there. In doing so, we show that even our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4880","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}