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

Abstract

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\ge 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$.

Accepted for publication in IEEE Communications Letters

References in corpus (7)

• Communication and Randomness Lower Bounds for Secure Computation
• Capacity of Quantum Private Information Retrieval with Collusion of All But One of Servers
• Hyperdense coding and superadditivity of classical capacities in hypersphere theories
• The Capacity of Classical Summation over a Quantum MAC with Arbitrarily Distributed Inputs and Entanglements
• Private Product Computation using Quantum Entanglement
• Communication Complexity of Private Simultaneous Quantum Messages Protocols
• Private Simultaneous Messages Based on Quadratic Residues

Cited by in corpus (2)

• The Capacity of Classical Summation over a Quantum MAC with Arbitrarily Distributed Inputs and Entanglements
• Quantum $X$-Secure $T$-Private Information Retrieval From MDS Coded Storage With Unresponsive and Byzantine Servers