Show simple item record

dc.contributor.authorCabello, Adáneng
dc.contributor.authorDanielsen, Lars Eirikeng
dc.contributor.authorLópez-Tarrida, Antonio J.eng
dc.contributor.authorPortillo, José R.eng
dc.date.accessioned2013-04-23T11:26:53Z
dc.date.available2013-04-23T11:26:53Z
dc.date.issued2011-04-12eng
dc.identifier.citationPhys. Rev. A 83, 042314eng
dc.identifier.issn1050-2947eng
dc.identifier.urihttp://hdl.handle.net/1956/6536
dc.description.abstractWe 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.eng
dc.language.isoengeng
dc.publisherAmerican Physical Societyeng
dc.titleOptimal preparation of graph stateseng
dc.typePeer reviewedeng
dc.typeJournal articleeng
dc.rights.holderCopyright 2011 American Physical Society
dc.type.versionacceptedVersioneng
bora.peerreviewedPeer reviewedeng
bora.journalTitlePhysical Review Aeng
bibo.volume83eng
bibo.doihttp://dx.doi.org/10.1103/PhysRevA.83.042314eng
dc.identifier.cristinID806606eng
dc.identifier.doi10.1103/physreva.83.042314


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record