Metraipolis › archive › dc_282fcee46651

Equivalence Between Average-Case Hardness of Learning and Cryptography for Mixed Quantum States — arXiv:2608.14331

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.14331
License (as archived)
CC0-1.0
Archived
2026-10-19T02:29:36.683Z
SHA-256 of the archived text
235ce6f15f76bc685bb57a919a9f299d14d2253bacd082a2e69abe0cbb222691
Stable URL of this page
https://metraipolis.com/documento/dc_282fcee46651

How to cite

Equivalence Between Average-Case Hardness of Learning and Cryptography for Mixed Quantum States — arXiv:2608.14331 — arXiv (en), https://arxiv.org/abs/2608.14331 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_282fcee46651 (Metraipolis archive dc_282fcee46651, sha256 235ce6f15f76bc685bb57a919a9f299d14d2253bacd082a2e69abe0cbb222691)
BibTeX
@misc{dc282fcee46651,
  title = {Equivalence Between Average-Case Hardness of Learning and Cryptography for Mixed Quantum States — arXiv:2608.14331},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.14331},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_282fcee46651; sha256 235ce6f15f76bc685bb57a919a9f299d14d2253bacd082a2e69abe0cbb222691},
  year = {2026}
}

Archived text

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

The relationship between cryptography and learning theory has long been a central theme in the foundations of theoretical computer science: cryptographic primitives can imply hardness of learning, while hardness of learning can in turn be used to construct cryptographic schemes. Recent works have begun exploring analogous connections in the quantum setting, relating the average-case hardness of learning quantum states (AHL) to cryptographic primitives such as one-way state generators (OWSG). Despite recent progress exploring this for pure states, the relationship for mixed states has remained an open question. In this work, we prove that the existence of AHL for mixed quantum states is equivalent to the existence of inefficiently verifiable one-way state generators (IV-OWSGs). As a consequence, this relates mixed-state AHL to EFI pairs. Moreover, as a corollary of existing results, we obtain a separation between IV-OWSGs and OWSGs relative to the SWAP oracle.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-08-17 in cs.CR).
Categorie arXiv: Quantum Physics (quant-ph) ; Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2608.14331 — 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-19T02:25:38.624Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-08-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).