Solid State Implementation of Quantum Random Walks on General Graphs

Details Solid State Implementation of Quantum Random Walks on General Graphs Solid State Implementation of Quantum Random Walks on General Graphs

2008-11-11

arxiv.org/abs/0811.1795v1

Physics

Quantum Physics

6 manuscript pages, 6 figures, to appear in the proceedings of the 2nd International Workshop on Solid-State Quantum Computing

Scientific paper

10.1063/1.3037138

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.

Affiliated with

Also associated with

No associations

Rating

Solid State Implementation of Quantum Random Walks on General Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solid State Implementation of Quantum Random Walks on General Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solid State Implementation of Quantum Random Walks on General Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-100326