Efficient quantum walk on a quantum processor

Quantum walks are a potential framework for developing quantum algorithms, but have so far been limited to analogue quantum-simulation approaches that do not scale. Here, the authors provide a protocol for simulating exponentially large quantum walks using a polynomial number of quantum gates and qu...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Xiaogang Qiang, Thomas Loke, Ashley Montanaro, Kanin Aungskunsiri, Xiaoqi Zhou, Jeremy L. O’Brien, Jingbo B. Wang, Jonathan C. F. Matthews
Formato: article
Lenguaje:EN
Publicado: Nature Portfolio 2016
Materias:
Q
Acceso en línea:https://doaj.org/article/13931bfcadd8415b98cfb608706e2721
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Descripción
Sumario:Quantum walks are a potential framework for developing quantum algorithms, but have so far been limited to analogue quantum-simulation approaches that do not scale. Here, the authors provide a protocol for simulating exponentially large quantum walks using a polynomial number of quantum gates and qubits.