
Open access
Date
2021Type
- Journal Article
ETH Bibliography
yes
Altmetrics
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 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. Show more
Permanent link
https://doi.org/10.3929/ethz-b-000498475Publication status
publishedExternal links
Journal / series
PRX QuantumVolume
Pages / Article No.
Publisher
American Physical SocietyOrganisational unit
03781 - Renner, Renato / Renner, Renato
Funding
165843 - Fully quantum thermodynamics of finite-size systems (SNF)
More
Show all metadata
ETH Bibliography
yes
Altmetrics