Shortcuts to nonabelian braiding
classification
❄️ cond-mat.mes-hall
cond-mat.supr-con
keywords
braidingnonabeliancounterdiabaticshortcutstermsadiabaticadiabaticityapproximate
read the original abstract
Topological quantum information processing relies on adiabatic braiding of nonabelian quasiparticles. Performing the braiding operations in finite time introduces transitions out of the ground-state manifold and deviations from the nonabelian Berry phase. We show that these errors can be eliminated by suitably designed counterdiabatic correction terms in the Hamiltonian. We implement the resulting shortcuts to adiabaticity for simple protocols of nonabelian braiding and show that the error suppression can be substantial even for approximate realizations of the counterdiabatic terms.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.