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...
| Үндсэн зохиолчид: | , , , |
|---|---|
| Формат: | Journal article |
| Хэвлэсэн: |
IOP Publishing
2007
|
| _version_ | 1826261346397716480 |
|---|---|
| author | Fitzsimons, J Benjamin, S Campbell, E Kok, P |
| author_facet | Fitzsimons, J Benjamin, S Campbell, E Kok, P |
| author_sort | Fitzsimons, J |
| collection | OXFORD |
| description | 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 only global properties of the qubits. Here, this powerful approach is extended by demonstrating that even imperfect path erasure can produce the required graph states with high efficiency. By characterizing the degree of error in each path erasure attempt, one can subsume the resulting imperfect entanglement into an extended graph state formalism. The subsequent growth of the improper graph state can be guided, through a series of strategic decisions, in such a way as to bound the growth of the error and eventually yield a high-fidelity graph state. As an implementation of these techniques, we develop an analytic model for atom (or atom-like) qubits in mismatched cavities, under the double-heralding entanglement procedure of Barrett and Kok (2005 Phys. Rev. A 71 060310). Compared to straightforward post-selection techniques our protocol offers a dramatic improvement in growing complex high-fidelity graph states. |
| first_indexed | 2024-03-06T19:19:57Z |
| format | Journal article |
| id | oxford-uuid:19b9739f-76e5-4dee-a8d4-0a67d75a95cc |
| institution | University of Oxford |
| last_indexed | 2024-03-06T19:19:57Z |
| publishDate | 2007 |
| publisher | IOP Publishing |
| record_format | dspace |
| spelling | oxford-uuid:19b9739f-76e5-4dee-a8d4-0a67d75a95cc2022-03-26T10:50:39ZEfficient growth of complex graph states via imperfect path erasureJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:19b9739f-76e5-4dee-a8d4-0a67d75a95ccSymplectic Elements at OxfordIOP Publishing2007Fitzsimons, JBenjamin, SCampbell, EKok, PGiven 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 only global properties of the qubits. Here, this powerful approach is extended by demonstrating that even imperfect path erasure can produce the required graph states with high efficiency. By characterizing the degree of error in each path erasure attempt, one can subsume the resulting imperfect entanglement into an extended graph state formalism. The subsequent growth of the improper graph state can be guided, through a series of strategic decisions, in such a way as to bound the growth of the error and eventually yield a high-fidelity graph state. As an implementation of these techniques, we develop an analytic model for atom (or atom-like) qubits in mismatched cavities, under the double-heralding entanglement procedure of Barrett and Kok (2005 Phys. Rev. A 71 060310). Compared to straightforward post-selection techniques our protocol offers a dramatic improvement in growing complex high-fidelity graph states. |
| spellingShingle | Fitzsimons, J Benjamin, S Campbell, E Kok, P Efficient growth of complex graph states via imperfect path erasure |
| title | Efficient growth of complex graph states via imperfect path erasure |
| title_full | Efficient growth of complex graph states via imperfect path erasure |
| title_fullStr | Efficient growth of complex graph states via imperfect path erasure |
| title_full_unstemmed | Efficient growth of complex graph states via imperfect path erasure |
| title_short | Efficient growth of complex graph states via imperfect path erasure |
| title_sort | efficient growth of complex graph states via imperfect path erasure |
| work_keys_str_mv | AT fitzsimonsj efficientgrowthofcomplexgraphstatesviaimperfectpatherasure AT benjamins efficientgrowthofcomplexgraphstatesviaimperfectpatherasure AT campbelle efficientgrowthofcomplexgraphstatesviaimperfectpatherasure AT kokp efficientgrowthofcomplexgraphstatesviaimperfectpatherasure |