Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.