The communication cost of simulating POVMs over maximally entangled qubits
In [Toner and Bacon, Phys. Rev. Lett. 91, 187904 (2003)], $1$ bit of communication was proven to be enough to simulate the statistics of local projective measurements over the maximally entangled state. Ever since then, the question of whether $1$ bit is also enough for the case of generalized measu...
| Autor: | |
|---|---|
| Formato: | tesis de maestría |
| Fecha de publicación: | 2019 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/169118 |
| Acesso em linha: | https://hdl.handle.net/2117/169118 |
| Access Level: | acceso abierto |
| Palavra-chave: | Detectors Quantum theory Bell theorem quantum nonlocality communication complexity detection loophole. Quàntums, Teoria dels Àrees temàtiques de la UPC::Enginyeria de la telecomunicació |
| Resumo: | In [Toner and Bacon, Phys. Rev. Lett. 91, 187904 (2003)], $1$ bit of communication was proven to be enough to simulate the statistics of local projective measurements over the maximally entangled state. Ever since then, the question of whether $1$ bit is also enough for the case of generalized measurements has been open. In this thesis, we retort to inefficiency-resistant Bell functionals, a powerful technique to prove lower bounds communication complexity, to numerically study this question. The results obtained suggest that, indeed, as is the case with projective measurements, $1$ bit of communication suffices to simulate POVMs over maximally entangled qubits. |
|---|