Pāriet uz galveno navigāciju Pāriet uz meklēšanu Pāriet uz galveno saturu

Quantum search of spatial regions

  • University of California at Berkeley

Zinātniskās darbības rezultāts: Nodaļa grāmatā/enciklopēdijā/konferences krājumā › Konferences zinātniskais raksts › Pētniecība › koleģiāli recenzēts

80 Atsauces (Scopus)

Kopsavilkums

Can Grover's quantum search algorithm speed up search of a physical region-for example a 2-D grid of size √n × √n? The problem is that √n time seems to be needed for each query, just to move amplitude across the grid. Here we show that this problem can be surmounted, refuting a claim to the contrary by Benioff. In particular, we show how to search a d-dimensional hypercube in time O(√n) for d > 3, or O(√n log3 n) for d = 2. More generally, we introduce a model of quantum query complexity on graphs, motivated by fundamental physical limits on information storage, particularly the holographic principle from black hole thermodynamics. Our results in this model include almost-tight upper and lower bounds for many search tasks; a generalized algorithm that works for any graph with good expansion properties, not just hypercubes; and relationships among several notions of 'locality' for unitary matrices acting on graphs. As an application of our results, we give on O(√n)-qubit communication protocol for the disjointness problem, which improves an upper bound of Høyer and de Wolf and matches a lower bound of Razborov.

OriģinālvalodaAngļu
Publikācijas avota nosaukumsProceedings - 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003
IzdevējsIEEE Computer Society
Lapas200-209
Lapu skaits10
ISBN (Drukātā versija)0769520405
Publikācijas statussPublicēts - 2003
Pasākums44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003 - Cambridge, MA, Amerikas Savienotās Valstis
Ilgums: 11 okt. 2003 → 14 okt. 2003

Publikāciju sērijas

NosaukumsAnnual Symposium on Foundations of Computer Science - Proceedings
ISSN (Drukātā versija)0272-5428

Konference

Konference44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003
Valsts/TeritorijaAmerikas Savienotās Valstis
PilsētaCambridge, MA
Periods11/10/03 → 14/10/03

Nospiedums

Uzziniet vairāk par pētniecības tēmām “Quantum search of spatial regions”. Kopā tie veido unikālu nospiedumu.

Citēt šo