Communication Complexity of Private Simultaneous Quantum Messages Protocols

arXiv:2105.07120 · quant-ph, cs.CC, cs.CR · Submitted 2021-05-15 · Read on arXiv

quant-ph, cs.CC, cs.CR

Submitted: 2021-05-15

Updated: 2026-09-26

Comments: The first version contained technical errors in the proofs of Lemma 5 and Theorem 12. This version corrects the errors, as well as minor errors elsewhere. The main results of the first version remain valid

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

Terminology

• Entanglement — 34× in this paper · explained in 3 episodes
• Degeneracy — 3× in this paper · explained in 3 episodes
• Verification — 3× in this paper · explained in 2 episodes
• Communication Overhead — 2× in this paper · explained in 2 episodes
• Fingerprinting — 2× in this paper · explained in 2 episodes
• Trace — 2× in this paper · explained in 2 episodes
• Adam — 1× in this paper · explained in 2 episodes
• Hamming Distance — 1× in this paper · explained in 2 episodes
• Hilbert Space — 1× in this paper · explained in 2 episodes
• Information Leakage — 1× in this paper · explained in 2 episodes
• Quantum Circuits — 1× in this paper · explained in 2 episodes
• Verifier — 1× in this paper · explained in 2 episodes

Sources

• Quantum Garbled Circuits
• Quantum randomized encoding, verification of quantum computing, no-cloning, and blind quantum computing

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• A quasiparticle-protected superconducting qubit
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians