Distinguishability and Copiability of Programs in General Process Theories
    Download PDF
Giulio Chiribella. Distinguishability and Copiability of Programs in General Process Theories. International Journal of Software and Informatics, 2014,8(3-4):209~223
Hits: 51921
Download times: 1114
Fund:This work was supported by the National Basic Research Program of China (973)(Grants 2011CBA00300, 2011CBA00301) and by the National Natural Science Foundation of China (Grants 11350110207, 61033001, 61061130540), by the 1000 Youth Fellowship Program of China, by the Foundational Questions Institute (Grants FQXi-RFP3-1325).
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:state discrimination  quantum cloning  programmable gates
View Full Text  View/Add Comment  Download reader



Top Paper  |  FAQ  |  Guest Editors  |  Email Alert  |  Links  |  Copyright  |  Contact Us

© Copyright by Institute of Software, the Chinese Academy of Sciences

京公网安备 11040202500065号