Computing entanglement costs of non-local operations on the basis of algebraic geometry
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909817121013760 |
|---|---|
| author | Akibue, Seiseki Miyazaki, Jisho Osaka, Hiroyuki |
| author_facet | Akibue, Seiseki Miyazaki, Jisho Osaka, Hiroyuki |
| contents | In the study of distributed quantum information processing, it is crucial to minimize the entanglement consumption by optimizing local operations. We develop a framework based on algebraic geometry to systematically simplify the optimization over separable (SEP) channels, which serve as widely used models for local operations. We apply this framework to computing one-shot entanglement cost for implementing non-local operations under SEP channels, in both probabilistic and zero-error settings. First, we present a unified generalization of previous analytical results on the entanglement cost. Via the generalization, we resolve an open problem posed by Yu et al. regarding the entanglement cost of local state discrimination. Second, we strengthen the Doherty--Parrilo--Spedalieri hierarchy and determine the trade-off between the entanglement cost and the success probability of implementing various operations -- such as entanglement distillation, non-local unitary channels, measurements, state verification, and multipartite entanglement distribution. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_17394 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Computing entanglement costs of non-local operations on the basis of algebraic geometry Akibue, Seiseki Miyazaki, Jisho Osaka, Hiroyuki Quantum Physics Mathematical Physics In the study of distributed quantum information processing, it is crucial to minimize the entanglement consumption by optimizing local operations. We develop a framework based on algebraic geometry to systematically simplify the optimization over separable (SEP) channels, which serve as widely used models for local operations. We apply this framework to computing one-shot entanglement cost for implementing non-local operations under SEP channels, in both probabilistic and zero-error settings. First, we present a unified generalization of previous analytical results on the entanglement cost. Via the generalization, we resolve an open problem posed by Yu et al. regarding the entanglement cost of local state discrimination. Second, we strengthen the Doherty--Parrilo--Spedalieri hierarchy and determine the trade-off between the entanglement cost and the success probability of implementing various operations -- such as entanglement distillation, non-local unitary channels, measurements, state verification, and multipartite entanglement distribution. |
| title | Computing entanglement costs of non-local operations on the basis of algebraic geometry |
| topic | Quantum Physics Mathematical Physics |
| url | https://arxiv.org/abs/2501.17394 |