On the Capacity of Secure K-User Product Computation Over a Quantum MAC

被引：2

作者：

Lu, Yuxiang ^{[1
]}

Yao, Yuhang ^{[1
]}

Jafar, Syed A. ^{[1
]}

机构：

[1] Univ Calif Irvine, CPCC, Irvine, CA 92697 USA

来源：

IEEE COMMUNICATIONS LETTERS | 2023年 / 27卷 / 10期

基金：

美国国家科学基金会;

关键词：

Capacity; quantum multiple access; secure computation; private simultaneous quantum messages;

D O I：

10.1109/LCOMM.2023.3311368

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

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 >= 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.

引用

页码：2598 / 2602

页数：5

共 5 条

[1] Covert Communication Over a K-User Multiple-Access Channel
Arumugam, Keerthi Suria Kumar
Bloch, Matthieu R.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (11) : 7020 - 7044
[2] Secure GDoF of K-User Gaussian Interference Channels: When Secrecy Incurs No Penalty
Geng, Chunhua
Jafar, Syed A.
IEEE COMMUNICATIONS LETTERS, 2015, 19 (08) : 1287 - 1290
[3] Multi-Stream Information Transmission over K-User Interference Networks
Truhachev, Dmitri
2010 INFORMATION THEORY AND APPLICATIONS WORKSHOP (ITA), 2010, : 491 - 499
[4] Capacity Results for Classes of Partially Ordered K-User Broadcast Channels With Two Nested Multicast Messages
Salman, Mohamed
Varanasi, Mahesh K.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (01) : 65 - 81
[5] The Capacity of Classical Summation Over a Quantum MAC With Arbitrarily Distributed Inputs and Entanglements
Yao, Yuhang
Jafar, Syed A.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (09) : 6350 - 6370

← 1 →