Efficient generation of graph states for quantum computation
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 whi...
Main Authors: | Clark, SR, Alves, C, Jaksch, D |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2004
|
Similar Items
-
Efficient generation of graph states for quantum computation
by: Clark, S, et al.
Published: (2005) -
Graph state generation with noisy mirror-inverting spin chains
by: Clark, SR, et al.
Published: (2007) -
Graph state generation with noisy mirror-inverting spin chains
by: Clark, S, et al.
Published: (2007) -
Graph states and quantum computing
by: Mhalla, S
Published: (2006) -
Brokered graph-state quantum computation
by: Fitzsimons, J, et al.
Published: (2006)