from    
to    
search  

 


Symmetry restoration and quantum Mpemba effects in chaotic andlocalization sy...
Quantum Gases 2024
Stories of Fermions in an Optical Box
Contractive Unitary and Classical Shadow Tomography
报告题目:
Quantum walk based search algorithms
 报告人:
Miklos Santha
Universite Paris Sud, Laboratoire de Recherche en Informatique
France
报告时间:
2008-04-23 16:30
报告地点:
Room 4-603, FIT Building, Tsinghua University
主办单位:
ITCS, Tsinghua University
  简介:
In this survey talk we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Ambainis, Szegedy and Magniez/Nayak/Roland/Santha will be stated as quantum analogues of classical search procedures. We present a rather detailed description of the MNRS algorithm. Finally, in the query complexity model, we show how quantum walks can be applied to the following search problems: Element Distinctness, Matrix Product Verification, Restricted Range Associativity, Triangle, and Group Commutativity.

Miklos Santha is a research director of Information Research Lab in Paris-Sud University. His fields of interest are theoretical computer science, quantum and approximation algorithms.

今日相关信息
美国的区域水资源控制与政策—以加利福尼亚...
【时代论坛】戏剧--以先锋的名义
<奥运百日聊奥运之--无线互联>科技奥运 ...
阅读、观看与使用--三种不同的信息行为
 
同类别相关信息
网络空间安全学术论坛
技术合同中的知识产权
科研创新中专利信息分析预警与专利布局
清华论坛第60讲:Global Talents: on ...
专利技术成果转移与技术评估
学术活动