RT Journal Article
SR Electronic
T1 Implementing graph-theoretic quantum algorithms on a silicon photonic quantum walk processor
JF Science Advances
JO Sci Adv
FD American Association for the Advancement of Science
SP eabb8375
DO 10.1126/sciadv.abb8375
VO 7
IS 9
A1 Qiang, Xiaogang
A1 Wang, Yizhi
A1 Xue, Shichuan
A1 Ge, Renyou
A1 Chen, Lifeng
A1 Liu, Yingwen
A1 Huang, Anqi
A1 Fu, Xiang
A1 Xu, Ping
A1 Yi, Teng
A1 Xu, Fufang
A1 Deng, Mingtang
A1 Wang, Jingbo B.
A1 Meinecke, Jasmin D. A.
A1 Matthews, Jonathan C. F.
A1 Cai, Xinlun
A1 Yang, Xuejun
A1 Wu, Junjie
YR 2021
UL http://advances.sciencemag.org/content/7/9/eabb8375.abstract
AB Applications of quantum walks can depend on the number, exchange symmetry and indistinguishability of the particles involved, and the underlying graph structures where they move. Here, we show that silicon photonics, by exploiting an entanglement-driven scheme, can realize quantum walks with full control over all these properties in one device. The device we realize implements entangled two-photon quantum walks on any five-vertex graph, with continuously tunable particle exchange symmetry and indistinguishability. We show how this simulates single-particle walks on larger graphs, with size and geometry controlled by tuning the properties of the composite quantum walkers. We apply the device to quantum walk algorithms for searching vertices in graphs and testing for graph isomorphisms. In doing so, we implement up to 100 sampled time steps of quantum walk evolution on each of 292 different graphs. This opens the way to large-scale, programmable quantum walk processors for classically intractable applications.