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

• Published in: Chinese physics B Vol. 28; no. 11; p. 110302
• Main Authors: Tusun, Maimaitiyiming, Wu, Yang, Liu, Wenquan, Rong, Xing, Du, Jiangfeng
• Format: Journal Article
• Language: English
• Published: 01.11.2019
• ISSN: 1674-1056
• DOI: 10.1088/1674-1056/ab44ae

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.