Experimental implementation of a continuous-time quantum random walk on a solid-state quantum information processor  

作　　者：Maimaitiyiming Tusun Yang Wu Wenquan Liu Xing Rong Jiangfeng Du 麦麦提依明·吐孙;伍旸;刘文权;荣星;杜江峰(Hefei National Laboratory for Physical Sciences at the Microscale,and Department of Modern Physics,University of Science and Technology of China,Hefei 230026,China;CAS Key Laboratory of Microscale Magnetic Resonance,University of Science and Technology of China,Hefei 230026,China;Synergetic Innovation Center of Quantum Information and Quantum Physics,University of Science and Technology of China,Hefei 230026,China;School of Physics and Electronic Engineering,Xinjiang Normal University,Urumqi 830054,China)

机构地区：[1]Hefei National Laboratory for Physical Sciences at the Microscale,and Department of Modern Physics,University of Science and Technology of China,Hefei 230026,China [2]CAS Key Laboratory of Microscale Magnetic Resonance,University of Science and Technology of China,Hefei 230026,China [3]Synergetic Innovation Center of Quantum Information and Quantum Physics,University of Science and Technology of China,Hefei 230026,China [4]School of Physics and Electronic Engineering,Xinjiang Normal University,Urumqi 830054,China

出　　处：《Chinese Physics B》2019年第11期105-108,共4页中国物理B（英文版）

基　　金：Project supported by the National Key Research and Development Program of China(Grant Nos.2018YFA0306600 and 2016YFB0501603);the National Natural Science Foundation of China(Grant No.11761131011);the Fund from the Chinese Academy of Sciences(Grant Nos.GJJSTD20170001,QYZDYSSW-SLH004,and QYZDB-SSW-SLH005);the Anhui Initiative Fund in Quantum Information Technologies,China(Grant No.AHY050000);the Youth Innovation Promotion Association of the Chinese Academy of Sciences

摘　　要：There are some problems that quantum computers seem to be exponentially faster than classical computers, like factoring large numbers, machine learning, and simulation of quantum systems. Constructing an appropriate quantum algorithm becomes more important for solving these specific problems. In principle, any quantum algorithm can recast by a quantum random walk algorithm. Although quantum random walk with a few qubits has been implemented in a variety of systems, the experimental demonstration of solid-state quantum random walk remains elusive. Here we report the experimental implementation of the quantum continuous-time random walk algorithm by a two-qubit quantum processor in a nitrogen–vacancy center in diamond. We found that quantum random walk on a circle does not converge to any stationary distribution and exhibit a reversible property. Our results represent a further investigation of quantum walking dynamics in solid spin platforms, may also lead to other practical applications by the use of quantum continuous-time random walk for quantum algorithm design and quantum coherence transport.There are some problems that quantum computers seem to be exponentially faster than classical computers, like factoring large numbers, machine learning, and simulation of quantum systems. Constructing an appropriate quantum algorithm becomes more important for solving these specific problems. In principle, any quantum algorithm can recast by a quantum random walk algorithm. Although quantum random walk with a few qubits has been implemented in a variety of systems, the experimental demonstration of solid-state quantum random walk remains elusive. Here we report the experimental implementation of the quantum continuous-time random walk algorithm by a two-qubit quantum processor in a nitrogen–vacancy center in diamond. We found that quantum random walk on a circle does not converge to any stationary distribution and exhibit a reversible property. Our results represent a further investigation of quantum walking dynamics in solid spin platforms, may also lead to other practical applications by the use of quantum continuous-time random walk for quantum algorithm design and quantum coherence transport.

关 键 词：QUANTUM COMPUTATIONS QUANTUM algorithm color CENTERS 

分 类 号：O41[理学—理论物理]