Quantum Mechanical Square Root Speedup in a Structured Search Problem

Simple item page
dc.creatorFarhi, Edward
dc.creatorGutmann, Sam
dc.date1997-11-18
dc.date.accessioned2026-07-07T06:14:33Z
dc.date.available2026-07-07T06:14:33Z
dc.descriptionAn unstructured search for one item out of N can be performed quantum mechanically in time of order square root of N whereas classically this requires of order N steps. This raises the question of whether square root speedup persists in problems with more structure. In this note we focus on one example of a structured problem and find a quantum algorithm which takes time of order the square root of the classical time.
dc.description6 pages, REVTeX; correspondence to farhi@mitlns.mit.edu
dc.identifierhttps://arxiv.org/abs/quant-ph/9711035
dc.identifierhttp://arxiv.org/abs/quant-ph/9711035
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93506
dc.subjectQuantum Physics
dc.titleQuantum Mechanical Square Root Speedup in a Structured Search Problem
dc.typetext

Files

Collections

arXiv