Communication Cost of Quantum Processes

Abstract

A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer. An important problem is to determine the minimum amount of communication needed to specify the desired computation. Here we extend this problem to the quantum domain, analyzing the total amount of (classical and quantum) communication needed by a server in order to accurately execute a quantum process chosen by a client from a parametric family of quantum processes. We derive a general lower bound on the communication cost, establishing a relation with the precision limits of quantum metrology: if a $\nu$-dimensional family of processes can be estimated with mean squared error $n^{-\beta }$ by using $n$ parallel queries, then the communication cost for $n$ parallel executions of a process in the family is at least $(\beta \nu /2-\epsilon )\log n$ qubits at the leading order in $n$, for every $\epsilon >0$. For a class of quantum processes satisfying the standard quantum limit ($\beta =1$), we show that the bound can be attained by transmitting an approximate classical description of the desired process. For quantum processes satisfying the Heisenberg limit ($\beta =2$), our bound shows that the communication cost is at least twice as the cost of communicating standard quantum limited processes with the same number of parameters.

arXiv comment9 pages, 4 figures plus appendix; published version

References in corpus (56)

• Advances in Quantum Metrology
• Quantum metrology
• Quantum Teleportation is a Universal Computational Primitive
• General Benchmarks for Quantum Repeaters
• Fundamental Limits of Repeaterless Quantum Communications
• Prescription for experimental determination of the dynamics of a quantum black box
• A quantum network of clocks
• On quantum Renyi entropies: a new generalization and some properties
• Complete Characterization of a Quantum Process: the Two-Bit Quantum Gate
• Quantum computations without definite causal structure
• Theoretical framework for quantum networks
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Universal blind quantum computation
• Programmable quantum gate arrays
• Ancilla-assisted quantum process tomography
• Transforming quantum operations: quantum supermaps
• Unconditionally verifiable blind computation
• Quantum Reverse Shannon Theorem
• Optimal Quantum Clocks
• Quantum Reading of a Classical Digital Memory
• The Quantum Reverse Shannon Theorem based on One-Shot Information Theory
• Asymptotic teleportation scheme as a universal programmable quantum processor
• Efficient use of quantum resources for the transmission of a reference frame
• Parameter estimation of quantum channels
• Approaches for approximate additivity of the Holevo information of quantum channels
• On the strong converses for the quantum channel capacity theorems
• Fundamental bound on the reliability of quantum information transmission
• Ultimate Precision of Adaptive Noise Estimation
• A universal programmable quantum state discriminator that is optimal for unambiguously distinguishing between unknown states
• Comparison between the Cramer-Rao and the mini-max approaches in quantum channel estimation
• Multiparty Delegated Quantum Computing
• Optimal cloning of unitary transformations
• Quantum Reading Capacity
• Quantum reverse-engineering and reference frame alignment without non-local correlations
• Optimal quantum networks and one-shot entropies
• Universal measurement apparatus controlled by quantum software
• Optimal probabilistic storage and retrieval of unitary channels
• Quantum Data Compression of a Qubit Ensemble
• Quantum rate distortion, reverse Shannon theorems, and source-channel separation
• Quantum Channel Simulation and the Channel's Smooth Max-Information
• Fast rate estimation of an unitary operation in SU(d)
• Efficient compression of quantum information
• Error free quantum communication through noisy channels
• Efficient universal programmable quantum measurements
• Optimal compression for identically prepared qubit states
• Approximate programmable quantum processors
• Efficient Quantum Compression for Ensembles of Identically Prepared Mixed States
• Universal super-replication of unitary gates
• Resource Quantification for the No-Programming Theorem
• Deterministic superreplication of one-parameter unitary transformations
• Digital Quantum Estimation
• Quantum Stopwatch: How To Store Time in a Quantum Memory
• Quantum reading capacity: General definition and bounds
• Super-additivity in communication of classical information through quantum channels from a quantum parameter estimation perspective
• Units of rotational information
• Compression for quantum population coding

Cited by in corpus (5)

• Geometric distinguishability measures limit quantum channel estimation and discrimination
• RLD Fisher Information Bound for Multiparameter Estimation of Quantum Channels
• Heisenberg scaling based on population coding
• Measuring quantum relative entropy with finite-size effect
• Representation matching for delegated quantum computing