Error tolerance in an NMR Implementation of Grover's Fixed-Point Quantum Search Algorithm

Simple item page
dc.creatorXiao, Li
dc.creatorJones, Jonathan A.
dc.date2005-04-08
dc.date2005-07-22
dc.date.accessioned2026-07-07T06:18:43Z
dc.date.available2026-07-07T06:18:43Z
dc.descriptionWe describe an implementation of Grover's fixed-point quantum search algorithm on a nuclear magnetic resonance (NMR) quantum computer, searching for either one or two matching items in an unsorted database of four items. In this new algorithm the target state (an equally weighted superposition of the matching states) is a fixed point of the recursive search operator, and so the algorithm always moves towards the desired state. The effects of systematic errors in the implementation are briefly explored.
dc.description5 Pages RevTex4 including three figures. Changes made at request of referees; now in press at Phys Rev A
dc.identifierhttps://arxiv.org/abs/quant-ph/0504054
dc.identifierhttp://arxiv.org/abs/quant-ph/0504054
dc.identifierPhys. Rev. A 72, 032326 (2005)
dc.identifierdoi:10.1103/PhysRevA.72.032326
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/94829
dc.subjectQuantum Physics
dc.titleError tolerance in an NMR Implementation of Grover's Fixed-Point Quantum Search Algorithm
dc.typetext

Files

Collections

arXiv