Representation matching for delegated quantum computing

Yuxiang Yang, Masahito Hayashi

Published 2020-09-14Version 1

Many quantum computational tasks have inherent symmetries, suggesting a path to enhancing their efficiency and performance. Exploiting this observation, we propose representation matching, a generic probabilistic protocol for delegated quantum computing. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks, including delegated execution of unitary gate arrays, permutation gates, and unitary conjugation, as well as the storage and retrieval of unitary gates.