A low complexity scheme for entanglement distributor buses

DOI10.1007/S11128-010-0214-XMaRDI QIDQ638596zbMATH OpenOpenAlexFDO

Authors Majid Ghojavand

Publication date 13 September 2011

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0805.3392

zbMATH Keywords

axially symmetric graphentanglement distributor busentanglement provisionlow complexity

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum coherence, entanglement, quantum correlations (81P40) Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05)

Abstract: For technological purposes and theoretical curiosity, it is very interesting to have a building block that produces a considerable amount of entanglement between on-demand sites through a simple control of a few sites. Here, we consider permanently-coupled spin networks and study entanglement generation between qubit pairs to find low-complexity structures capable of generating considerable entanglement between various qubit pairs. We find that in axially symmetric networks the generated entanglement between some qubit pairs is rather larger than generic networks. We show that in uniformly-coupled spin rings each pair can be considerably entangled through controlling suitable vertices. To set the location of controlling-vertices, we observe that the symmetry has to be broken for a definite time. To achieve this, a magnetic flux can be applied to break symmetry via Aharonov-Bohm effect. Such a set up can serve as an efficient entanglement distributor bus in which each vertex-pair can be efficiently entangled through exciting only one fixed vertex and controlling the evolution time. The low-complexity of this scheme makes it attractive for use in nanoscale quantum information processors.

Recommendations

• Efficient entanglement purification via quantum communication bus
• Distribution algorithm of entangled particles for wireless quantum communication mesh networks
• scientific article; zbMATH DE number 7774292
• Robust entanglement distribution via quantum network coding
• Bound on distributed entanglement
• A general protocol for distributed quantum gates
• Optimizing teleportation cost in distributed quantum circuits
• Distributed quantum packet transmission in non-maximally entangled relay system
• Entanglement and quantum strategies reduce congestion costs in Pigou networks

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Entanglement in theXYspin chain
• Entanglement of formation of an arbitrary state of two qubits
• Mixed-state entanglement and quantum error correction
• Quantum Information Storage in the Localized State of a Spin Chain
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Twisted boundary conditions and effective mass in Heisenberg-Ising and Hubbard rings

Cited in

(3)

• Information free quantum bus for generating stabiliser states
• Transport of quantum correlations across a spin chain
• Entanglement distribution in star network based on spin chain in diamond

This page was built for publication: A low complexity scheme for entanglement distributor buses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638596)