A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Partial-ignorance communication tasks in quantum theory
Tekijät: Kerppo Oskari
Kustantaja: AMER PHYSICAL SOC
Julkaisuvuosi: 2022
Journal: Physical Review A
Lehden akronyymi: PHYS REV A
Artikkelin numero: 062607
Vuosikerta: 105
Numero: 6
Sivujen määrä: 13
ISSN: 2469-9926
eISSN: 2469-9934
DOI: https://doi.org/10.1103/PhysRevA.105.062607
Verkko-osoite: https://journals.aps.org/pra/abstract/10.1103/PhysRevA.105.062607
Preprintin osoite: http://arxiv.org/pdf/2202.08581
Tiivistelmä
We introduce a generalization of the communication of partial ignorance where both parties of a prepare-andmeasure setup receive inputs from a third party before a success metric is maximized over the measurements and preparations. We call these communication scenarios partial ignorance communication tasks of type Tn,m, where n indicates the number of possible correct answers in the communication task and m loosely represents the information about the correct answer that is revealed to the party preparing states. Various methods are used to obtain bounds on the success metrics, including semidefinite programs, ultraweak monotones for communication matrices, and frame theory for quantum states. The simplest scenarios in this alternative generalized prepare-andmeasure setting, partial-ignorance communication tasks of types T3,1, T4,1, and T4,2, are analyzed exhaustively for bits and qudits. Finally, this generalized setting allows the introduction of operational equivalences to the preparations and measurements, allowing us to analyze and observe a contextual advantage for quantum theory in the partial ignorance communication task of type T4,1.
We introduce a generalization of the communication of partial ignorance where both parties of a prepare-andmeasure setup receive inputs from a third party before a success metric is maximized over the measurements and preparations. We call these communication scenarios partial ignorance communication tasks of type Tn,m, where n indicates the number of possible correct answers in the communication task and m loosely represents the information about the correct answer that is revealed to the party preparing states. Various methods are used to obtain bounds on the success metrics, including semidefinite programs, ultraweak monotones for communication matrices, and frame theory for quantum states. The simplest scenarios in this alternative generalized prepare-andmeasure setting, partial-ignorance communication tasks of types T3,1, T4,1, and T4,2, are analyzed exhaustively for bits and qudits. Finally, this generalized setting allows the introduction of operational equivalences to the preparations and measurements, allowing us to analyze and observe a contextual advantage for quantum theory in the partial ignorance communication task of type T4,1.
Turun yliopiston Tutkimustietojärjestelmän portaali