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...
Главные авторы: | Fitzsimons, J, Benjamin, S, Campbell, E, Kok, P |
---|---|
Формат: | Journal article |
Опубликовано: |
IOP Publishing
2007
|
Схожие документы
-
Conditional Action and Imperfect Erasure of Qubits
по: Heinz-Jürgen Schmidt
Опубликовано: (2021-02-01) -
Adaptive strategies for graph-state growth in the presence of monitored errors
по: Campbell, E, и др.
Опубликовано: (2007) -
Edge erasures and chordal graphs
по: Jared Culbertson, и др.
Опубликовано: (2021-10-01) -
Graph Imperfection.
по: Gerke, S, и др.
Опубликовано: (2001) -
Extracting perfect GHZ states from imperfect weighted graph states via entanglement concentration
по: Rafail Frantzeskakis, и др.
Опубликовано: (2023-05-01)