Faithful Simulation of Distributed Quantum Measurement with Coding for Computing
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915354349928448 |
|---|---|
| author | Høst-Madsen, Anders |
| author_facet | Høst-Madsen, Anders |
| contents | This paper considers a two-terminal problem in which Alice and Bob aim to perform a joint measurement on a bipartite quantum system $ρ^{AB}$. Alice transmits the results of her measurements to Bob over a classical channel, and the two share common randomness. The central question is: what is the minimum amount of communication and common randomness required to faithfully simulate the measurement? This paper derives an achievable rate region. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_12271 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Faithful Simulation of Distributed Quantum Measurement with Coding for Computing Høst-Madsen, Anders Information Theory This paper considers a two-terminal problem in which Alice and Bob aim to perform a joint measurement on a bipartite quantum system $ρ^{AB}$. Alice transmits the results of her measurements to Bob over a classical channel, and the two share common randomness. The central question is: what is the minimum amount of communication and common randomness required to faithfully simulate the measurement? This paper derives an achievable rate region. |
| title | Faithful Simulation of Distributed Quantum Measurement with Coding for Computing |
| topic | Information Theory |
| url | https://arxiv.org/abs/2501.12271 |