期刊
NATURE PHOTONICS
卷 12, 期 12, 页码 754-+出版社
NATURE PUBLISHING GROUP
DOI: 10.1038/s41566-018-0282-5
关键词
-
资金
- National Key R&D Program of China [2017YFA0303700]
- National Natural Science Foundation of China [11690033, 61734005, 11761141014, 11374211]
- Science and Technology Commission of Shanghai Municipality (STCSM) [15QA1402200, 16JC1400405, 17JC1400403]
- Shanghai Municipal Education Commission (SMEC) [16SG09, 2017-01-07-00-02-E00049]
- State Key Laboratory of High Performance Computing (HPCL) [201511-01]
- Samsung Global Research Outreach (GRO) project
- Korea Institute of Science and Technology (KIST) Institutional Program [2E26680-18-P025]
- Engineering and Physical Sciences Research Council (EPSRC) [EP/K034480/1]
- Royal Society
- National Young 1000 Talents Plan
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据