Solid State Implementation of Quantum Random Walks on General Graphs

TL;DR

This paper proposes a novel scheme for implementing quantum random walks on complex graphs using quantum dots, supported by numerical simulations of single-qubit rotations via solving the time-dependent Schrödinger equation.

Contribution

It introduces a new method to realize quantum random walks on arbitrary graphs using quantum dot technology, extending control techniques to a two-dimensional grid.

Findings

Successful numerical simulation of single-qubit rotations.

Demonstration of control over quantum dot grid for quantum walks.

Potential scalability for quantum information processing.

Abstract

Advances in recent years have made it possible to explore quantum dots as a viable technology for scalable quantum information processing. Charge qubits for example can be realized in the lowest bound states of coupled quantum dots and the precision control of the confinement potential allows for the realization of a full set of universal qubit gates, including arbitrary single-qubit rotations and two-qubit C-NOT gates. In this work we describe a novel scheme for implementing quantum random walks on arbitrarily complex graphs by extending these elementary operations to the control of a two-dimensional quantum dot grid. As single-qubit rotations constitute the essential building blocks of our implementation scheme, we also present numerical simulations of one such mechanism by directly solving the corresponding time-dependent Schrodinger equation.