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.

arXiv comment14 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

References in corpus (7)

• In defense of the epistemic view of quantum states: a toy theory
• Informational derivation of Quantum Theory
• Quantum Theory From Five Reasonable Axioms
• A generalized no-broadcasting theorem
• Causal categories: relativistically interacting processes
• Complete set of circuit equations for Stabilizer Quantum Mechanics
• Confusability graphs for symmetric sets of quantum states

Cited by in corpus (5)

• Reconstructing quantum theory from diagrammatic postulates
• A Categorical Reconstruction of Quantum Theory
• Towards the classification of odd dimensional homogeneous reversible Finsler spaces with positive flag curvature
• Deriving Dagger Compactness
• Reversible homogeneous Finsler metrics with positive flag curvature