L
Ll. Masanes
Researcher at University of Bristol
Publications - 5
Citations - 1042
Ll. Masanes is an academic researcher from University of Bristol. The author has contributed to research in topics: Quantum information science & Trace distance. The author has an hindex of 5, co-authored 5 publications receiving 896 citations. Previous affiliations of Ll. Masanes include University of Barcelona & University of Cambridge.
Papers
More filters
Journal ArticleDOI
Discriminating States: the quantum Chernoff bound.
Kmr Audenaert,John Calsamiglia,Ramon Muñoz-Tapia,Emilio Bagan,Ll. Masanes,Antonio Acín,Frank Verstraete +6 more
TL;DR: The problem of discriminating two different quantum states in the setting of asymptotically many copies is considered, and the minimal probability of error is determined, leading to the identification of the quantum Chernoff bound, thereby solving a long-standing open problem.
Journal ArticleDOI
General properties of nonsignaling theories
TL;DR: In this article, it was shown that for any distribution, the properties of non-local, no arbitrarily shareable, and positive secrecy content are equivalent, and that all these properties are solely a consequence of the no-signaling principle and non-locality.
Journal ArticleDOI
Quantum Chernoff bound as a measure of distinguishability between density matrices: Application to qubit and Gaussian states
TL;DR: A physically meaningful distinguishability measure and its corresponding metric in the space of states is defined and the latter is shown to coincide with the Wigner-Yanase metric.
Journal ArticleDOI
Multiple-copy two-state discrimination with individual measurements
TL;DR: In this paper, the problem of nonorthogonal two-state discrimination with multiple copies of the unknown state is addressed and the optimal strategy is shown to saturate the lower bound asymptotically.
Journal ArticleDOI
Secrecy properties of quantum channels
TL;DR: This work identifies those properties of a quantum channel that are relevant for cryptography and derives an easily computable necessary condition of security for protocols, which is shown to be tight for the Bennett-Brassard 1984 and six-state protocols.