Brokered Graph State Quantum Computing

Simple item page
dc.creatorBenjamin, Simon C.
dc.creatorBrowne, Dan E.
dc.creatorFitzsimons, Joe
dc.creatorMorton, John J. L.
dc.date2005-09-29
dc.date.accessioned2026-07-07T06:31:15Z
dc.date.available2026-07-07T06:31:15Z
dc.descriptionWe describe a procedure for graph state quantum computing that is tailored to fully exploit the physics of optically active multi-level systems. Leveraging ideas from the literature on distributed computation together with the recent work on probabilistic cluster state synthesis, our model assigns to each physical system two logical qubits: the broker and the client. Groups of brokers negotiate new graph state fragments via a probabilistic optical protocol. Completed fragments are mapped from broker to clients via a simple state transition and measurement. The clients, whose role is to store the nascent graph state long term, remain entirely insulated from failures during the brokerage. We describe an implementation in terms of NV-centres in diamond, where brokers and clients are very naturally embodied as electron and nuclear spins.
dc.description5 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0509209
dc.identifierhttp://arxiv.org/abs/quant-ph/0509209
dc.identifierNew Journal of Physics 8, 141 (2006)
dc.identifierdoi:10.1088/1367-2630/8/8/141
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/98550
dc.subjectQuantum Physics
dc.titleBrokered Graph State Quantum Computing
dc.typetext

Files

Collections

arXiv