Search via Quantum Walk

We propose a new method for designing quantum search algorithms for finding a "marked" element in the state space of a classical Markov chain. The algorithm is based on a quantum walk a la Szegedy [Quantum speed-up of Markov chain based algorithms, in Proceedings of the 45th IEEE Symposium...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	SIAM journal on computing Ročník 40; číslo 1; s. 142 - 164
Hlavní autoři:	Magniez, Frédéric, Nayak, Ashwin, Roland, Jérémie, Santha, Miklos
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2011
Témata:	Algorithmics. Computability. Computer arithmetics Algorithms Amplification Applied sciences Approximation Computer science Computer science; control theory; systems Exact sciences and technology Foundations Markov analysis Markov chains Mathematics Miscellaneous Numerical analysis Numerical analysis. Scientific computation Numerical methods in probability and statistics Operators Presses Quantum theory Reflection Sciences and techniques of general use Studies Theoretical computing amplitude amplification Costs 68Q12 Estimation quantum walk State space 05C81 State space method hitting time Implementation Search algorithm Markov chain Computer science phase estimation search 81P68 Algorithm analysis
ISSN:	0097-5397, 1095-7111
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!