.png){kind=icon}
.png){kind=icon}
Return
Representation Matching For Remote Quantum Computing
.png){kind=icon}
OA
AI
DOI：10.1103/PRXQuantum.2.020327.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 the 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.
Keywords:
COMPUTATION
CLONING
Journal
P
IF:
11
Papers:
919
Citations:
9.0K