.png){kind=icon}
返回
Efficient quantum walk on a quantum processor
.png){kind=icon}
OA
AI
DOI：10.1038/ncomms11511.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle, we experimentally implement the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor.
Keyword:
ALGORITHMS
SIMULATION
STABILITY
MOTION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
15.7
论文数:
9.4W
被引数:
91.2W
机构
引用论文
On the experimental verification of quantum complexity in linear optics关于线性光学中量子复杂性的实验验证.png)
NATURE PHOTONICSOAAI
NATURE PHOTONICSIF32.9
OAAI分享收藏Folding and cutting DNA into reconfigurable topological nanostructuresNATURE NANOTECHNOLOGYOAAI
NATURE NANOTECHNOLOGYIF34.9
OAAI分享收藏
查看更多内容