Distinguishability and copiability of programs in general process theories
Abstract
We propose a notion of state distinguishability that does not refer to probabilities, but rather to the ability of a set of states to serve as programs for a desired set of gates. Using this notion, we reconstruct the structural features of the task of state discrimination, such as the equivalence with cloning and the impossibility to extract information from two non-distinguishable pure states without causing a disturbance. All these features express intrinsic links among operational tasks, which are valid independently of the particular theory under consideration.
Keywords
Cite
@article{arxiv.1411.3035,
title = {Distinguishability and copiability of programs in general process theories},
author = {Giulio Chiribella},
journal= {arXiv preprint arXiv:1411.3035},
year = {2015}
}
Comments
14 pages, contribution to the Special Issue on "Quantum Computation and Quantum Information", International Journal of Software and Informatics, S.-L. Luo, M. G. A. Paris, and Y. Shang editors, published version