Abstract
Transporting quantum information is an important prerequisite for quantum computers. We study how this can be done in Heisenberg-coupled spin networks using adiabatic control over the coupling strengths. We find that qudits can be transferred and entangled pairs can be created between distant sites of bipartite graphs with a certain balance between the maximum spin of both parts, extending previous results that were limited to linear chains. The transfer fidelity in a small star-shaped network is numerically analysed, and possible experimental implementations are discussed.
Highlights
Reliable transport of quantum states is essential for future quantum technologies [1]
If the quantum information is carried by a spin degree of freedom, it is a natural choice to transport the states over a network of spinful particles [2, 3]
If Alice and Bob can adiabatically change the strengths of the couplings surrounding a small subsystem of a suitable network, they can send each other quantum information and establish entanglement
Summary
Reliable transport of quantum states is essential for future quantum technologies [1]. Alice and Bob can establish maximally entangled states between their sites by starting with the full network, including their sites, in a global s = 0 ground state. They adiabatically uncouple their sites from the system, ending up with the unique s = 0 state shared between their sites. Such protocols have been abundant in existing literature (see Sec. 1.1), but were mainly focused on linear chains. Our results generalize these protocols to more general spin networks, and to more receivers in the case of transfer, under the assumptions given below
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
