Computer Science > Information Theory
arXiv:2305.20073 (cs)
[Submitted on 31 May 2023 (v1), last revised 29 Aug 2023 (this version, v2)]
Title:On the Capacity of Secure $K$-user Product Computation over a Quantum MAC
View a PDF of the paper titled On the Capacity of Secure $K$-user Product Computation over a Quantum MAC, by Yuxiang Lu and 1 other authors
View PDFAbstract: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$.
| Comments: | Accepted for publication in IEEE Communications Letters |
| Subjects: | Information Theory (cs.IT) |
| Cite as: | arXiv:2305.20073 [cs.IT] |
| (orarXiv:2305.20073v2 [cs.IT] for this version) | |
| https://doi.org/10.48550/arXiv.2305.20073 arXiv-issued DOI via DataCite |
Submission history
From: Yuxiang Lu [view email][v1] Wed, 31 May 2023 17:46:15 UTC (14 KB)
[v2] Tue, 29 Aug 2023 02:05:09 UTC (184 KB)
Full-text links:
Access Paper:
- View PDF
- TeX Source
- Other Formats
View a PDF of the paper titled On the Capacity of Secure $K$-user Product Computation over a Quantum MAC, by Yuxiang Lu and 1 other authors
References & Citations
Bookmark
Bibliographic and Citation Tools
Bibliographic Explorer(What is the Explorer?)
Connected Papers(What is Connected Papers?)
Litmaps(What is Litmaps?)
scite Smart Citations(What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv(What is alphaXiv?)
CatalyzeX Code Finder for Papers(What is CatalyzeX?)
DagsHub(What is DagsHub?)
Gotit.pub(What is GotitPub?)
Hugging Face(What is Huggingface?)
Papers with Code(What is Papers with Code?)
ScienceCast(What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower(What are Influence Flowers?)
CORE Recommender(What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community?Learn more about arXivLabs.