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 m...

Descripción completa

Detalles Bibliográficos
Publicado: 2018
Materias:
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_24699926_v97_n5_p_Grande
http://hdl.handle.net/20.500.12110/paper_24699926_v97_n5_p_Grande
Aporte de:
id paper:paper_24699926_v97_n5_p_Grande
record_format dspace
spelling paper:paper_24699926_v97_n5_p_Grande2023-06-08T16:36:09Z Distinguishing computable mixtures of quantum states Mixtures Quantum cryptography Random processes Experimental realizations Finite time Mixed state Preparation process Pseudorandomness Quantum state Random sequence Success probabilities Quantum theory 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. © 2018 American Physical Society. 2018 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_24699926_v97_n5_p_Grande http://hdl.handle.net/20.500.12110/paper_24699926_v97_n5_p_Grande
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Mixtures
Quantum cryptography
Random processes
Experimental realizations
Finite time
Mixed state
Preparation process
Pseudorandomness
Quantum state
Random sequence
Success probabilities
Quantum theory
spellingShingle Mixtures
Quantum cryptography
Random processes
Experimental realizations
Finite time
Mixed state
Preparation process
Pseudorandomness
Quantum state
Random sequence
Success probabilities
Quantum theory
Distinguishing computable mixtures of quantum states
topic_facet Mixtures
Quantum cryptography
Random processes
Experimental realizations
Finite time
Mixed state
Preparation process
Pseudorandomness
Quantum state
Random sequence
Success probabilities
Quantum theory
description 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. © 2018 American Physical Society.
title Distinguishing computable mixtures of quantum states
title_short Distinguishing computable mixtures of quantum states
title_full Distinguishing computable mixtures of quantum states
title_fullStr Distinguishing computable mixtures of quantum states
title_full_unstemmed Distinguishing computable mixtures of quantum states
title_sort distinguishing computable mixtures of quantum states
publishDate 2018
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_24699926_v97_n5_p_Grande
http://hdl.handle.net/20.500.12110/paper_24699926_v97_n5_p_Grande
_version_ 1768541633107722240