132,808 research outputs found

    Distinguishability, Ensemble Steering, and the No-Signaling Principle

    Full text link
    We consider a fundamental operational task, distinguishing systems in different states, in the framework of generalized probabilistic theories and provide a general formalism of minimum-error discrimination of states in convex optimization. With the formalism established, we show that the distinguishability is generally a global property assigned to the ensemble of given states rather than other details of a given state space or pairwise relations of given states. Then, we consider bipartite systems where ensemble steering is possible, and show that show that with two operational tasks, ensemble steering and the no-signaling condition, the distinguishability is tightly determined. The result is independent to the structure of the state space. This concludes that the distinguishability is generally determined by the compatibility between two tasks, ensemble steering on states and the non-signaling principle on probability distributions of outcomes.Comment: In Proceedings QPL 2013, arXiv:1412.791

    Designing Quantum Information Processing via Structural Physical Approximation

    Full text link
    In quantum information processing it may be possible to have efficient computation and secure communication beyond the limitations of classical systems. In a fundamental point of view, however, evolution of quantum systems by the laws of quantum mechanics is more restrictive than classical systems, identified to a specific form of dynamics, that is, unitary transformations and, consequently, positive and completely positive maps to subsystems. This also characterizes classes of disallowed transformations on quantum systems, among which positive but not completely maps are of particular interest as they characterize entangled states, a general resource in quantum information processing. Structural physical approximation offers a systematic way of approximating those non-physical maps, positive but not completely positive maps, with quantum channels. Since it has been proposed as a method of detecting entangled states, it has stimulated fundamental problems on classifications of positive maps and the structure of Hermitian operators and quantum states, as well as on quantum measurement such as quantum design in quantum information theory. It has developed efficient and feasible methods of directly detecting entangled states in practice, for which proof-of-principle experimental demonstrations have also been performed with photonic qubit states. Here, we present a comprehensive review on quantum information processing with structural physical approximations and the related progress. The review mainly focuses on properties of structural physical approximations and their applications toward practical information applications.Comment: 53 pages, To appear in Reports on Progress in Physics as a review on structural physical approximation, see also related one, F. Shultz F Journal of Mathematical Physics 57 015218 (2016

    Discrimination of two-qubit unitaries via local operations and classical communication

    Full text link
    Distinguishability is a fundamental and operational task generally connected to information applications. In quantum information theory, from the postulates of quantum mechanics it often has an intrinsic limitation, which then dictates and also characterises capabilities of related information tasks. In this work, we consider discrimination between bipartite two-qubit unitary transformations by local operations and classical communication (LOCC) and its relations to entangling capabilities of given unitaries. We show that a pair of entangling unitaries which do not contain local parts, if they are perfectly distinguishable by global operations, can also be perfectly distinguishable by LOCC. There also exist non-entangling unitaries, e.g. local unitaries, that are perfectly discriminated by global operations but not by LOCC. The results show that capabilities of LOCC are strictly restricted than global operations in distinguishing bipartite unitaries for a finite number of repetitions, contrast to discrimination of a pair of bipartite states and also to asymptotic discrimination of unitaries.Comment: 9pages, 3 figure
    corecore