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)