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)