中国物理B ›› 2019, Vol. 28 ›› Issue (11): 110302-110302.doi: 10.1088/1674-1056/ab44ae
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(杜江峰)
- 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
Experimental implementation of a continuous-time quantum random walk on a solid-state quantum information processor
Maimaitiyiming Tusun(麦麦提依明·吐孙)1,2,3,4, Yang Wu(伍旸)1,2,3, Wenquan Liu(刘文权)1,2,3, Xing Rong(荣星)1,2,3, Jiangfeng Du(杜江峰)1,2,3
- 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
摘要： 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 computation architectures and implementations)
- 03.67.Lx