Distinguishing computable mixtures of quantum states

In this article we extend results from our previous work [Bendersky, Phys. Rev. Lett. 116, 230402 (2016)PRLTAO0031-900710.1103/PhysRevLett.116.230402] by providing a protocol to distinguish in finite time and with arbitrarily high success probability any algorithmic mixture of pure states from the maximally mixed state. Moreover, we include an experimental realization, using a modified quantum key distribution setup, where two different random sequences of pure states are prepared; these sequences are indistinguishable according to quantum mechanics, but they become distinguishable when randomness is replaced with pseudorandomness within the experimental preparation process.

Palabras clave: Estados Mixtos , Aleatoriedad Algoritmica , Distribucion Cuantica de Claves

Ver el registro completo

Archivos asociados

Tamaño: 691.2Kb

Formato: PDF

Descargar

Licencia

Excepto donde se diga explícitamente, este item se publica bajo la siguiente descripción: Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Unported (CC BY-NC-SA 2.5)

Identificadores

URI: http://hdl.handle.net/11336/82667

DOI: http://dx.doi.org/10.1103/PhysRevA.97.052306

URL: https://journals.aps.org/pra/abstract/10.1103/PhysRevA.97.052306

Colecciones

Articulos(ICC)
Articulos de INSTITUTO DE INVESTIGACION EN CIENCIAS DE LA COMPUTACION

Articulos(OCA CIUDAD UNIVERSITARIA)
Articulos de OFICINA DE COORDINACION ADMINISTRATIVA CIUDAD UNIVERSITARIA

Articulos(UNIDEF)
Articulos de UNIDAD DE INVESTIGACION Y DESARROLLO ESTRATEGICOS PARA LA DEFENSA

Citación

López Grande, Ignacio Hernán; Senno, Gabriel Ignacio; De La Torre, Gonzalo; Larotonda, Miguel Antonio; Bendersky, Ariel Martin; et al.; Distinguishing computable mixtures of quantum states; American Physical Society; Physical Review A: Atomic, Molecular and Optical Physics; 97; 5; 5-2018; 1-8; 052306

Altmétricas