2007/09/30 by Daniel E. Browne, Daniel E Browne, Matthew B Elliott +8 · 4 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum many-body systems #cond-mat.stat-mech #quant-ph
paper · pdf · doi:10.1088/1367-2630/10/2/023010
published as New J. Phys. 10, 023010 (2008) · 12 pages, 10 figures, and a Michelangelo quote. published version: some improvements in presentation following referee comments
arxiv created 2008/02/04 · openalex publication_date 2008/02/12 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
We study how heralded qubit losses during the preparation of a two-dimensional cluster state, a universal resource state for one-way quantum computation, affect its computational power. Above the percolation threshold, we present a polynomial-time algorithm that concentrates a universal cluster state, using resources that scale optimally in the size of the original lattice. On the other hand, below the percolation threshold, we show that single qubit measurements on the faulty lattice can be efficiently simulated classically. We observe a phase transition at the threshold when the amount of entanglement in the faulty lattice directly relevant to the computational power changes exponentially.