Efficient growth of complex graph states via imperfect path erasure
Given a suitably large and well connected (complex) graph state, any quantum algorithm can be implemented purely through local measurements on the individual qubits. Measurements can also be used to create the graph state: path erasure techniques allow one to entangle multiple qubits by determining...
Príomhchruthaitheoirí: | Fitzsimons, J, Benjamin, S, Campbell, E, Kok, P |
---|---|
Formáid: | Journal article |
Foilsithe / Cruthaithe: |
IOP Publishing
2007
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Conditional Action and Imperfect Erasure of Qubits
de réir: Heinz-Jürgen Schmidt
Foilsithe / Cruthaithe: (2021-02-01) -
Adaptive strategies for graph-state growth in the presence of monitored errors
de réir: Campbell, E, et al.
Foilsithe / Cruthaithe: (2007) -
Edge erasures and chordal graphs
de réir: Jared Culbertson, et al.
Foilsithe / Cruthaithe: (2021-10-01) -
Graph Imperfection.
de réir: Gerke, S, et al.
Foilsithe / Cruthaithe: (2001) -
Extracting perfect GHZ states from imperfect weighted graph states via entanglement concentration
de réir: Rafail Frantzeskakis, et al.
Foilsithe / Cruthaithe: (2023-05-01)