Efficient generation of graph states for quantum computation

Details Efficient generation of graph states for quantum computation Efficient generation of graph states for quantum computation

2004-06-21

arxiv.org/abs/quant-ph/0406150v2

New J. Phys. 7, 124 (2005)

Physics

Quantum Physics

4 pages, 3 figures, RevTex 4; v2 - Major changes and new results

Scientific paper

10.1088/1367-2630/7/1/124

We present an entanglement generation scheme which allows arbitrary graph states to be efficiently created in a linear quantum register via an auxiliary entangling bus. The dynamics of the entangling bus is described by an effective non-interacting fermionic system undergoing mirror-inversion in which qubits, encoded as local fermionic modes, become entangled purely by Fermi statistics. We discuss a possible implementation using two species of neutral atoms stored in an optical lattice and find that the scheme is realistic in its requirements even in the presence of noise.

Affiliated with

Also associated with

No associations

Rating

Efficient generation of graph states for quantum computation 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 Efficient generation of graph states for quantum computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient generation of graph states for quantum computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57704