Perfect state transfer in quantum spin networks.
We propose a class of qubit networks that admit the perfect state transfer of any quantum state in a fixed period of time. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to N-qubit spin net...
Main Authors: | , , , |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2004
|
_version_ | 1797069224797011968 |
---|---|
author | Christandl, M Datta, N Ekert, A Landahl, A |
author_facet | Christandl, M Datta, N Ekert, A Landahl, A |
author_sort | Christandl, M |
collection | OXFORD |
description | We propose a class of qubit networks that admit the perfect state transfer of any quantum state in a fixed period of time. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to N-qubit spin networks of identical qubit couplings, we show that 2log3N is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits, then perfect state transfer can be achieved over arbitrarily long distances in a linear chain. |
first_indexed | 2024-03-06T22:21:18Z |
format | Journal article |
id | oxford-uuid:5525e2f7-180d-4f3c-8f9b-8cfd7855e70a |
institution | University of Oxford |
language | English |
last_indexed | 2024-03-06T22:21:18Z |
publishDate | 2004 |
record_format | dspace |
spelling | oxford-uuid:5525e2f7-180d-4f3c-8f9b-8cfd7855e70a2022-03-26T16:42:09ZPerfect state transfer in quantum spin networks.Journal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:5525e2f7-180d-4f3c-8f9b-8cfd7855e70aEnglishSymplectic Elements at Oxford2004Christandl, MDatta, NEkert, ALandahl, AWe propose a class of qubit networks that admit the perfect state transfer of any quantum state in a fixed period of time. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to N-qubit spin networks of identical qubit couplings, we show that 2log3N is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits, then perfect state transfer can be achieved over arbitrarily long distances in a linear chain. |
spellingShingle | Christandl, M Datta, N Ekert, A Landahl, A Perfect state transfer in quantum spin networks. |
title | Perfect state transfer in quantum spin networks. |
title_full | Perfect state transfer in quantum spin networks. |
title_fullStr | Perfect state transfer in quantum spin networks. |
title_full_unstemmed | Perfect state transfer in quantum spin networks. |
title_short | Perfect state transfer in quantum spin networks. |
title_sort | perfect state transfer in quantum spin networks |
work_keys_str_mv | AT christandlm perfectstatetransferinquantumspinnetworks AT dattan perfectstatetransferinquantumspinnetworks AT ekerta perfectstatetransferinquantumspinnetworks AT landahla perfectstatetransferinquantumspinnetworks |