By the same authors

From the same journal

From the same journal

Robust quantum entanglement generation and generation-plus-storage protocols with spin chains

Research output: Contribution to journalArticle

Author(s)

Department/unit(s)

Publication details

JournalPhysical Review A
DateSubmitted - 15 Dec 2016
DateAccepted/In press - 24 Mar 2017
DatePublished (current) - 24 Apr 2017
Issue number4
Volume95
Number of pages7
Pages (from-to)1-7
Original languageEnglish

Abstract

Reliable quantum communication and/or processing links between modules are a necessary building block for various quantum processing architectures. Here we consider a spin-chain system with alternating strength couplings and containing three defects, which impose three domain walls between topologically distinct regions of the chain. We show that - in addition to its useful, high-fidelity, quantum state transfer properties - an entangling protocol can be implemented in this system, with optional localization and storage of the entangled states. We demonstrate both numerically and analytically that, given a suitable initial product-state injection, the natural dynamics of the system produces a maximally entangled state at a given time. We present detailed investigations of the effects of fabrication errors, analyzing random static disorder both in the diagonal and off-diagonal terms of the system Hamiltonian. Our results show that the entangled state formation is very robust against perturbations of up to ∼10% the weaker chain coupling, and also robust against timing injection errors. We propose a further protocol, which manipulates the chain in order to localize and store each of the entangled qubits. The engineering of a system with such characteristics would thus provide a useful device for quantum information processing tasks involving the creation and storage of entangled resources.

Bibliographical note

©2017 American Physical Society

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations