By the same authors

From the same journal

Generation and robustness of quantum entanglement in spin graphs

Research output: Contribution to journalArticlepeer-review

Full text download(s)

Published copy (DOI)

Author(s)

Department/unit(s)

Publication details

JournalQuantum Information Processing
DateSubmitted - 17 Feb 2020
DateAccepted/In press - 16 Nov 2020
DatePublished (current) - 18 Dec 2020
Issue number1
Volume20
Number of pages20
Original languageEnglish

Abstract

Entanglement is a crucial resource for quantum information processing, and so protocols to generate high-fidelity entangled states on various hardware platforms are in demand. While spin chains have been extensively studied to generate entanglement, graph structures also have such potential; however, only a few classes of graphs have been explored for this specific task. In this paper, we apply a particular coupling scheme involving two different coupling strengths to a graph of two interconnected 3 × 3 square graphs such that it effectively contains three defects. We show how this structure allows generation of a Bell state whose fidelity depends on the chosen coupling ratio. We apply partitioned graph theory in order to reduce the dimension of the graph and show that, using a reduced graph or a reduced chain, we can still simulate the same protocol with identical dynamics. Finally, we investigate how fabrication errors affect the entanglement generation protocol and how the different equivalent structures are affected, finding that for some specific coupling ratios they are extremely robust.

Bibliographical note

© The Author(s) 2020

    Research areas

  • Partition graphs, Quantum computation, Quantum entanglement, Quantum information, Quantum networks, Spin graphs

Discover related content

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

View graph of relations