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

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) sc...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2023-10, Vol.27 (10), p.2598-2602
Main Authors: Lu, Yuxiang, Yao, Yuhang, Jafar, Syed A.
Format: Article
Language:English
Subjects:
Capacity
Computation
Costs
Fields (mathematics)
Galois fields
private simultaneous quantum messages
Protocols
Quantum entanglement
quantum multiple access
Qubit
secure computation
Servers
Transmitters
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 .
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2023.3311368