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...
Asıl Yazarlar: | Fitzsimons, J, Benjamin, S, Campbell, E, Kok, P |
---|---|
Materyal Türü: | Journal article |
Baskı/Yayın Bilgisi: |
IOP Publishing
2007
|
Benzer Materyaller
-
Conditional Action and Imperfect Erasure of Qubits
Yazar:: Heinz-Jürgen Schmidt
Baskı/Yayın Bilgisi: (2021-02-01) -
Adaptive strategies for graph-state growth in the presence of monitored errors
Yazar:: Campbell, E, ve diğerleri
Baskı/Yayın Bilgisi: (2007) -
Edge erasures and chordal graphs
Yazar:: Jared Culbertson, ve diğerleri
Baskı/Yayın Bilgisi: (2021-10-01) -
Graph Imperfection.
Yazar:: Gerke, S, ve diğerleri
Baskı/Yayın Bilgisi: (2001) -
Extracting perfect GHZ states from imperfect weighted graph states via entanglement concentration
Yazar:: Rafail Frantzeskakis, ve diğerleri
Baskı/Yayın Bilgisi: (2023-05-01)