Phase transition of computational power in the resource states for one-way quantum computation

Simple item page
dc.creatorBrowne, Daniel E.
dc.creatorElliott, Matthew B.
dc.creatorFlammia, Steven T.
dc.creatorMerkel, Seth T.
dc.creatorMiyake, Akimasa
dc.creatorShort, Anthony J.
dc.date2007-09-11
dc.date2008-02-04
dc.date.accessioned2026-07-07T09:20:05Z
dc.date.available2026-07-07T09:20:05Z
dc.descriptionWe 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.
dc.description12 pages, 10 figures, and a Michelangelo quote. published version: some improvements in presentation following referee comments
dc.identifierhttps://arxiv.org/abs/0709.1729
dc.identifierhttp://arxiv.org/abs/0709.1729
dc.identifierNew J. Phys. 10, 023010 (2008)
dc.identifierdoi:10.1088/1367-2630/10/2/023010
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/154618
dc.subjectQuantum Physics
dc.subjectStatistical Mechanics
dc.titlePhase transition of computational power in the resource states for one-way quantum computation
dc.typetext

Files

Collections

arXiv