Optimal Database Search: Waves and Catalysis

dc.creatorPatel, Apoorva
dc.date2004-01-25
dc.date2007-06-04
dc.date.accessioned2026-07-07T08:09:35Z
dc.date.available2026-07-07T08:09:35Z
dc.descriptionGrover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any system that allows superposition of states. A physical realization of this algorithm is described using coupled simple harmonic oscillators, which can be exactly solved in both classical and quantum domains. Classical wave algorithms are far more stable against decoherence compared to their quantum counterparts. In addition to providing convenient demonstration models, they may have a role in practical situations, such as catalysis.
dc.description4 pages (v2) 6 pages, RevTeX4. Title changed. Substantially expanded to include stability considerations, quantum domain analysis, application to catalysis. (v3) Version accepted for publication. (v4) Error in Eqs.(10,11) corrected by replacing ωby ω^2. No change in implementation and application
dc.identifierhttps://arxiv.org/abs/quant-ph/0401154
dc.identifierhttp://arxiv.org/abs/quant-ph/0401154
dc.identifierInternational Journal of Quantum Information 4 (2006) 815-825; Erratum 5 (2007) 437
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/131584
dc.subjectQuantum Physics
dc.subjectOther Condensed Matter
dc.subjectAtomic and Molecular Clusters
dc.titleOptimal Database Search: Waves and Catalysis
dc.typetext

Files

Collections