Metraipolis › archive › dc_4ebf61e6ef17

Quantum interaction can superactivate cheating under parallel repetition — arXiv:2609.31223

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.31223
License (as archived)
CC0-1.0
Archived
2026-10-08T03:42:59.707Z
SHA-256 of the archived text
a977cc2a429bf4376949597c682aedbe5c09dea18c2093498044f8ade5a39c51
Stable URL of this page
https://metraipolis.com/documento/dc_4ebf61e6ef17

How to cite

Quantum interaction can superactivate cheating under parallel repetition — arXiv:2609.31223 — arXiv (en), https://arxiv.org/abs/2609.31223 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4ebf61e6ef17 (Metraipolis archive dc_4ebf61e6ef17, sha256 a977cc2a429bf4376949597c682aedbe5c09dea18c2093498044f8ade5a39c51)
BibTeX
@misc{dc4ebf61e6ef17,
  title = {Quantum interaction can superactivate cheating under parallel repetition — arXiv:2609.31223},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.31223},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4ebf61e6ef17; sha256 a977cc2a429bf4376949597c682aedbe5c09dea18c2093498044f8ade5a39c51},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.31223. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study interactive multiprover games and many-round protocols in which the communication between the verifier and the provers is quantum. Parallel repetition is known to suppress soundness error of classical two-prover games arbitrarily close to zero, as shown by Raz (STOC '95), even with quantum strategies as shown by Yuen (ICALP '16), and Bavarian, Vidick and Yuen (STOC '17). Yet, we show that quantum communication can have the opposite, unexpected effect. Specifically, we exhibit a one-round quantum game and two-round $\mathsf{QMIP}$ protocols whose local (unentangled) value is strictly less than one for a single instance, yet equals one under $n$-fold parallel repetition for every $n \geq 2$. The key is that parallel repetition not only imposes additional winning conditions but also supplies additional quantum resources as entanglement in the exchanged states can be exploited jointly across copies. Our multiround examples build on superactivation of zero-error capacities of quantum channels. To establish this connection, we introduce quantum games and interactive protocols which capture the one-shot zero-error classical and quantum capacities, both with and without entanglement assistance. Our constructions use quantum-state verification and a teleportation-based reduction from two rounds to one. In contrast, when shared entanglement is allowed, we show that parallel repetition cannot increase the entangled value when at most $3$ messages are exchanged, consistent with classical results of Bellare, Impagliazzo and Naor (FOCS '97), and that of single-prover systems by Kitaev and Watrous (STOC '00). Combining this monotonicity with our quantum game-channel correspondence, we show that entanglement-assisted zero-error classical and quantum capacities cannot be superactivated.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-28 in cs.CC).
Categorie arXiv: Quantum Physics (quant-ph) ; Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2609.31223 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T03:12:56.416Z dalla pagina https://arxiv.org/catchup/cs.CC/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).