posted on 2023-11-30, 06:02authored byHao Tang, Carlo Di Franco, Zi-Yu Shi, Tian-Shen He, Zhen Feng, Jun Gao, Ke Sun, Zhan-Ming Li, Zhi-Qiang Jiao, Tian-Yu Wang, M. S. Kim, Xian-Min Jin
Quantum walks are powerful kernels in quantum computing protocols that possess strong capabilities in speeding up various simulation and optimisation tasks. One striking example is given by quantum walkers evolving on glued trees for their faster hitting performances than in the case of classical random walks. However, its experimental implementation is challenging as it involves highly complex arrangements of 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 these graphs with up to 160 nodes and a depth of 8 layers, achieving a linear relationship between the optimal hitting time and the network depth. Our results open up a scalable way towards quantum speed-up in complex problems classically intractable.
History
Disclaimer
This arXiv metadata record was not reviewed or approved by, nor does it necessarily express or reflect the policies or opinions of, arXiv.