arXiv Open Access 2023

On the Capacity of Secure $K$-user Product Computation over a Quantum MAC

Yuxiang Lu Yuhang Yao Syed A. Jafar

Lihat Sumber

Abstrak

Inspired by recent work by Christensen and Popovski on secure $2$-user product computation for finite-fields of prime-order over a quantum multiple access channel, the generalization to $K$ users and arbitrary finite fields is explored. Asymptotically optimal (capacity-achieving for large alphabet) schemes are proposed. Additionally, the capacity of modulo-$d$ ($d\geq 2$) secure $K$-sum computation is shown to be $2/K$ computations/qudit, generalizing a result of Nishimura and Kawachi beyond binary, and improving upon it for odd $K$.

Topik & Kata Kunci

cs.IT

Penulis (3)

Yuxiang Lu

Yuhang Yao

Syed A. Jafar

Format Sitasi

APA MLA BibTeX

Lu, Y., Yao, Y., Jafar, S.A. (2023). On the Capacity of Secure $K$-user Product Computation over a Quantum MAC. https://arxiv.org/abs/2305.20073

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2023
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓