Shortcuts to nonabelian braiding

TL;DR

This paper demonstrates how counterdiabatic corrections can significantly improve the fidelity of nonabelian braiding operations in topological quantum computing, enabling faster and more accurate quantum information processing.

Contribution

It introduces a method to eliminate errors in nonabelian braiding by designing counterdiabatic Hamiltonian corrections, enhancing the speed and accuracy of topological quantum gates.

Findings

Counterdiabatic corrections reduce braiding errors substantially.

Approximate implementations of corrections still achieve significant error suppression.

Shortcuts enable faster nonabelian braiding operations.

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.