Optimal preparation of graph states

Details Optimal preparation of graph states Optimal preparation of graph states

2010-11-24

arxiv.org/abs/1011.5464v2

Phys. Rev. A 83 (2011) 042314

Physics

Quantum Physics

REVTeX4-1, 8 pages, 5 figures, 336 MB of data, 1 computer program

Scientific paper

10.1103/PhysRevA.83.042314

We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlled-Z gates, and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the fact that any graph state belongs to an equivalence class under local Clifford operations. We extend up to 12 qubits the classification of graph states according to their entanglement properties, and identify each class using only a reduced set of invariants. For any state, we provide a circuit with both properties (a) and (b), if it does exist, or, if it does not, one circuit with property (a) and one with property (b), including the explicit one-qubit gates needed.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-241665