Representation matching for delegated quantum computing
arXiv:2009.06667 · doi:10.1103/PRXQuantum.2.020327
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.
arXiv comment11 pages, 7 figures; close to published version
References in corpus (44)
- The Quantum Internet
- Quantum Teleportation is a Universal Computational Primitive
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Error mitigation for short-depth quantum circuits
- A quantum network of clocks
- Optimal Quantum Cloning Machines
- Programmable quantum gate arrays
- Multi-parameter estimation in networked quantum sensors
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Phase covariant quantum cloning
- Optimal universal quantum cloning and state estimation
- Unconditionally verifiable blind computation
- Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
- Asymptotic teleportation scheme as a universal programmable quantum processor
- Optimal quantum learning of a unitary transformation
- Storing quantum dynamics in quantum states: stochastic programmable gate for U(1) operations
- Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations
- Probabilistic implementation of universal quantum processors
- Quantum Teleportation of Optical Quantum Gates
- Multiparty Delegated Quantum Computing
- Optimal cloning of unitary transformations
- Optimal quantum networks and one-shot entropies
- Impossibility of Classically Simulating One-Clean-Qubit Computation
- Optimal probabilistic storage and retrieval of unitary channels
- Computing Spin Networks
- Probabilistic exact universal quantum circuits for transforming unitary operations
- Efficient implementation of bipartite nonlocal unitary gates using prior entanglement and classical communication
- Quantum replication at the Heisenberg limit
- An efficient high dimensional quantum Schur transform
- Optimal universal programming of unitary gates
- Quantum Metrology Assisted with Abstention
- Universal super-replication of unitary gates
- Resource Quantification for the No-Programming Theorem
- Deterministic superreplication of one-parameter unitary transformations
- Secure assisted quantum computation
- Probabilistic programmable quantum processors with multiple copies of program state
- Quantum Schur Sampling Circuits can be Strongly Simulated
- Storing unitary operators in quantum states
- Units of rotational information
- The magic of universal quantum computing with permutations
- Communication Cost of Quantum Processes
- Quantum-enhanced learning of rotations about an unknown direction
- Faster quantum computation with permutations and resonant couplings
- Implementation of bipartite or remote unitary gates with repeater nodes