TY - JOUR

T1 - Stimulated Raman adiabatic passage-like protocols for amplitude transfer generalize to many bipartite graphs

AU - Groenland, Koen

AU - Groenland, Carla

AU - Kramer, Reinier

PY - 2020/7

Y1 - 2020/7

N2 - Adiabatic passage techniques, used to drive a system from one quantum state into another, find widespread applications in physics and chemistry. We focus on techniques to spatially transport a quantum amplitude over a strongly coupled system, such as STImulated Raman Adiabatic Passage (STIRAP) and Coherent Tunneling by Adiabatic Passage (CTAP). Previous results were shown to work on certain graphs, such as linear chains, square and triangular lattices, and branched chains. We prove that similar protocols work much more generally in a large class of (semi-)bipartite graphs. In particular, under random couplings, adiabatic transfer is possible on graphs that admit a perfect matching both when the sender is removed and when the receiver is removed. Many of the favorable stability properties of STIRAP/CTAP are inherited, and our results readily apply to transfer between multiple potential senders and receivers. We numerically test transfer between the leaves of a tree and find surprisingly accurate transfer, especially when straddling is used. Our results may find applications in short-distance communication between multiple quantum computers and open up a new question in graph theory about the spectral gap around the value 0.

AB - Adiabatic passage techniques, used to drive a system from one quantum state into another, find widespread applications in physics and chemistry. We focus on techniques to spatially transport a quantum amplitude over a strongly coupled system, such as STImulated Raman Adiabatic Passage (STIRAP) and Coherent Tunneling by Adiabatic Passage (CTAP). Previous results were shown to work on certain graphs, such as linear chains, square and triangular lattices, and branched chains. We prove that similar protocols work much more generally in a large class of (semi-)bipartite graphs. In particular, under random couplings, adiabatic transfer is possible on graphs that admit a perfect matching both when the sender is removed and when the receiver is removed. Many of the favorable stability properties of STIRAP/CTAP are inherited, and our results readily apply to transfer between multiple potential senders and receivers. We numerically test transfer between the leaves of a tree and find surprisingly accurate transfer, especially when straddling is used. Our results may find applications in short-distance communication between multiple quantum computers and open up a new question in graph theory about the spectral gap around the value 0.

UR - https://www.mendeley.com/catalogue/73407534-bd4f-3193-a4f3-6f77eb0346f8/

U2 - 10.1063/1.5116655

DO - 10.1063/1.5116655

M3 - Article

SN - 0022-2488

VL - 61

JO - Journal of Mathematical Physics

JF - Journal of Mathematical Physics

IS - 7

M1 - 072201

ER -