Representation matching for delegated quantum computing

TL;DR

This paper introduces a probabilistic protocol called representation matching that leverages symmetries in quantum tasks to significantly reduce communication and memory costs in quantum networks.

Contribution

It proposes a novel, generic protocol for optimizing quantum computation efficiency by exploiting inherent symmetries, applicable to various quantum tasks.

Findings

Reduces communication costs in remote quantum gate execution

Minimizes memory requirements for storing and retrieving unitaries

Effective across multiple quantum computational tasks

Abstract

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 reducing the cost of quantum computation in a quantum network. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks, including remote execution of unitary gate arrays, permutation gates and unitary conjugation, as well as the storage and retrieval of unitary gates.