English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

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

MPS-Authors
/persons/resource/persons242666

Kramer,  Reinier
Max Planck Institute for Mathematics, Max Planck Society;

External Resource

https://doi.org/10.1063/1.5116655
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

arXiv:1904.09915.pdf
(Preprint), 735KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Groenland, K., Groenland, C., & Kramer, R. (2020). Stimulated Raman adiabatic passage-like protocols for amplitude transfer generalize to many bipartite graphs. Journal of Mathematical Physics, 61(7): 072201. doi:10.1063/1.5116655.


Cite as: https://hdl.handle.net/21.11116/0000-0006-D985-F
Abstract
Adiabatic passage techniques, used to drive a system from one quantum state
into another, find widespread application 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
Tunnelling 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.