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...
| Päätekijät: | , , , |
|---|---|
| Aineistotyyppi: | Journal article |
| Julkaistu: |
IOP Publishing
2007
|