Metraipolis › archive › dc_8b877bcd7b9e

Quantum Secure Non-Interactive Reductions — arXiv:2609.38452

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.38452
License (as archived)
CC0-1.0
Archived
2026-10-07T15:20:51.422Z
SHA-256 of the archived text
1bdbeab034954117b07fe028f8f84c429f7b43133b91e2c1a0e5aee57b3a306e
Stable URL of this page
https://metraipolis.com/documento/dc_8b877bcd7b9e

How to cite

Quantum Secure Non-Interactive Reductions — arXiv:2609.38452 — arXiv (en), https://arxiv.org/abs/2609.38452 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8b877bcd7b9e (Metraipolis archive dc_8b877bcd7b9e, sha256 1bdbeab034954117b07fe028f8f84c429f7b43133b91e2c1a0e5aee57b3a306e)
BibTeX
@misc{dc8b877bcd7b9e,
  title = {Quantum Secure Non-Interactive Reductions — arXiv:2609.38452},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.38452},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8b877bcd7b9e; sha256 1bdbeab034954117b07fe028f8f84c429f7b43133b91e2c1a0e5aee57b3a306e},
  year = {2026}
}

Archived text

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

Efficient models for secure computation often rely on offline preprocessed correlations, which subsequently enable private online computation from minimal assumptions. Within these models, the study of secure non-interactive reductions (SNIR) formalizes when one classical correlation can be non-interactively transformed into another, while guaranteeing information-theoretic simulation-based privacy. In this work, we introduce quantum secure non-interactive reductions (QSNIR), a natural extension of SNIR, in which the source and target resource are each a bipartite quantum state. Specifically, when the target resource is classical, our framework enables us to analyze the problem of disseminating private correlations from entanglement, in addition to classical resources. Our primary technical result is that QSNIR privacy in this context can be computed exactly via a semidefinite program (SDP) pair that quantifies an error operationally rooted in a simulation-based cheating advantage. We prove that QSNIR privacy is lower-bounded by a decision problem related to minimum-error state discrimination (MED), and use both definitions to compute exact one-shot privacy errors for universal two-party computation (2PC) preprocessing correlations.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-01 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.38452 — 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-07T14:53:56.606Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).