论文标题
代表匹配授权量子计算
Representation matching for delegated quantum computing
论文作者
论文摘要
许多量子计算任务具有固有的对称性，这暗示了提高其效率和性能的途径。利用此观察结果，我们提出了表示匹配的表示，这是一种降低量子网络中量子计算成本的通用概率协议。我们表明，表示匹配协议能够将通信或内存成本降低到各种任务中的最低限度，包括远程执行单一门阵列，置换门和单一共轭，以及统一门的存储和检索。
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.
