Quantum Channel Simulation in Fidelity is no more difficult than State Splitting
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929396550467584 |
|---|---|
| author | Cao, Michael X. Jain, Rahul Tomamichel, Marco |
| author_facet | Cao, Michael X. Jain, Rahul Tomamichel, Marco |
| contents | Characterizing the minimal communication needed for the quantum channel simulation is a fundamental task in the quantum information theory. In this paper, we show that, in fidelity, the quantum channel simulation can be directly achieved via quantum state splitting without using a technique known as the de~Finetti reduction, and thus provide a pair of tighter one-shot bounds. Using the bounds, we also recover the quantum reverse Shannon theorem in a much simpler way. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_14416 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Quantum Channel Simulation in Fidelity is no more difficult than State Splitting Cao, Michael X. Jain, Rahul Tomamichel, Marco Quantum Physics Information Theory Characterizing the minimal communication needed for the quantum channel simulation is a fundamental task in the quantum information theory. In this paper, we show that, in fidelity, the quantum channel simulation can be directly achieved via quantum state splitting without using a technique known as the de~Finetti reduction, and thus provide a pair of tighter one-shot bounds. Using the bounds, we also recover the quantum reverse Shannon theorem in a much simpler way. |
| title | Quantum Channel Simulation in Fidelity is no more difficult than State Splitting |
| topic | Quantum Physics Information Theory |
| url | https://arxiv.org/abs/2403.14416 |