.png){kind=icon}
返回
Experimental quantum fast hitting on hexagonal graphs
.png){kind=icon}
PRE
AI
DOI：10.1038/s41566-018-0282-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Quantum walks are powerful kernels in quantum computing protocols, and possess strong capabilities in speeding up various simulation and optimization tasks. One striking example is provided by quantum walkers evolving on glued trees(1), which demonstrate faster hitting performances than classical random walks. However, their experimental implementation is challenging, as this involves highly complex arrangements of an exponentially increasing number of nodes. Here, we propose an alternative structure with a polynomially increasing number of nodes. We successfully map such graphs on quantum photonic chips using femtosecond-laser direct writing techniques in a geometrically scalable fashion. We experimentally demonstrate quantum fast hitting by implementing two-dimensional quantum walks on graphs with up to 160 nodes and a depth of eight layers, achieving a linear relationship between the optimal hitting time and the network depth. Our results open up a scalable path towards quantum speedup in classically intractable complex problems.
Keyword:
WALK
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
32.9
论文数:
4.3K
被引数:
6.1W
机构
引用论文
The genetics of visual system development in Drosophila: specification, connectivity and asymmetry
.png){kind=icon}
PREAI
分享收藏
Relationships Among Liquid–Vapor Interfacial Region Properties: Predictions of a Thermodynamic Model
PREAI
分享收藏
查看更多内容