Optimizing Quantum Models of Classical Channels: The reverse Holevo problem
arXiv:1709.08101
Abstract
Given a classical channel---a stochastic map from inputs to outputs---the input can often be transformed to an intermediate variable that is informationally smaller than the input. The new channel accurately simulates the original but at a smaller transmission rate. Here, we examine this procedure when the intermediate variable is a quantum state. We determine when and how well quantum simulations of classical channels may improve upon the minimal rates of classical simulation. This inverts Holevo's original question of quantifying the capacity of quantum channels with classical resources. We also show that this problem is equivalent to another, involving the local generation of a distribution from common entanglement.
arXiv comment13 pages, 6 figures; http://csc.ucdavis.edu/~cmg/compmech/pubs/qfact.htm; substantially updated from v1
References in corpus (11)
- Quantum algorithm for solving linear systems of equations
- Entanglement-Assisted Classical Capacity of Noisy Quantum Channels
- Computational Mechanics: Pattern and Prediction, Structure and Simplicity
- Quantum Reverse Shannon Theorem
- Occam's Quantum Razor: How Quantum Mechanics can reduce the complexity of classical models
- The Capacity of Quantum Channel with General Signal States
- Above and Beyond the Landauer Bound: Thermodynamics of Modularity
- A practical, unitary simulator for non-Markovian complex processes
- A Closed-Form Shave from Occam's Quantum Razor: Exact Results for Quantum Compression
- Simulation of Classical Thermal States on a Quantum Computer: A Transfer Matrix Approach
- Towards Quantifying Complexity with Quantum Mechanics