Perfect State Transfer in Quantum Spin Networks

Matthias Christandl, Nilanjana Datta, Artur Ekert, and Andrew J. Landahl
Phys. Rev. Lett. 92, 187902 – Published 4 May 2004

Abstract

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.

  • Figure
  • Received 22 September 2003

DOI:https://doi.org/10.1103/PhysRevLett.92.187902

©2004 American Physical Society

Authors & Affiliations

Matthias Christandl1,*, Nilanjana Datta2, Artur Ekert1,3, and Andrew J. Landahl4,5

  • 1Centre for Quantum Computation, Centre for Mathematical Sciences, DAMTP, University of Cambridge, Wilberforce Road, Cambridge CB3 0WA, United Kingdom
  • 2Statistical Laboratory, Centre for Mathematical Science, University of Cambridge, Wilberforce Road, Cambridge CB3 0WB, United Kingdom
  • 3Department of Physics, National University of Singapore, Singapore 117 542, Singapore
  • 4Center for Bits and Atoms, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA
  • 5HP Labs, Palo Alto, California 94304-1126, USA

  • *Electronic address: matthias.christandl@qubit.org

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 92, Iss. 18 — 7 May 2004

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×