Solid State Implementation of Quantum Random Walks on General Graphs
arXiv:0811.1795 · doi:10.1063/1.3037138
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.
6 manuscript pages, 6 figures, to appear in the proceedings of the 2nd International Workshop on Solid-State Quantum Computing and the Mini-School on Quantum Information Science
References in corpus (14)
- A Quantum Random Walk Search Algorithm
- Spatial search by quantum walk
- Optimal search strategies for hidden targets
- Implementing the quantum random walk
- Experimental Implementation of Discrete Time Quantum Random Walk on an NMR Quantum Information Processor
- Quantum walk on the line as an interference phenomenon
- Continuous-time Quantum Walks on a Cycle Graph
- One- and two-dimensional quantum walks in arrays of optical traps
- Complementarity and quantum walks
- Quantum random walk of the field in an externally driven cavity
- Scattering model for quantum random walk on the hypercube
- Quantum random walks without walking
- Critical scaling in standard biased random walks
- Single atom quantum walk with 1D optical superlattices