Quantum Private Distributed Matrix Multiplication: Extending the Classical Codes and Limitations

arXiv:2511.23406 · cs.IT, cs.CR, cs.NI, eess.SP, math.IT, quant-ph · Submitted 2025-11-28 · Read on arXiv

cs.IT, cs.CR, cs.NI, eess.SP, math.IT, quant-ph

Submitted: 2025-11-28

Updated: 2026-09-01

Comments: Abstract is trimmed due to abstract characters limit on Arxiv

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Abstraction — 9× in this paper · explained in 1 episode
• Trace — 6× in this paper · explained in 2 episodes
• Entanglement — 4× in this paper · explained in 3 episodes
• Hilbert Space — 4× in this paper · explained in 2 episodes
• Generalization — 2× in this paper · explained in 13 episodes
• Cooperation — 1× in this paper · explained in 2 episodes
• Decode — 1× in this paper · explained in 2 episodes

Sources

• CAT and DOG: Improved Codes for Private Distributed Matrix Multiplication
• Quantum $X$-Secure $T$-Private Information Retrieval From MDS Coded Storage With Unresponsive and Byzantine Servers
• On the Capacity of Vector Linear Computation over a Noiseless Quantum Multiple Access Channel with Entangled Transmitters

Related papers

• Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
• Discrepancy for Random Linear Codes
• A New Approach to Code Smoothing Bounds
• Contextual Memory-Enhanced Source Coding for Low-SNR Communications
• Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels
• Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions