Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 3 min ago
PreprintarXiv licencearXiv

Need for Coherent Access in Constructing Quantum Cryptography

Abstract

We construct quantum oracles relative to which quantum-secure one-way functions (OWFs) exist but pseudorandom states (PRSs) with superlogarithmic output length do not. At first glance, this appears to contradict the known black-box constructions of PRS generators from quantum-secure OWFs. The distinction lies in the access model to the oracles; our oracle separation uses \emph{classical-accessible} random oracles that can be accessed only classically even by quantum algorithms. In fact, our impossibility of PRSs applies to \emph{any} classically accessible classical oracle in place of the random oracle, while keeping the other oracle component unchanged, showing the need for coherent access in constructing PRSs. We further show that logarithmic output length pseudorandom function-like states (PRFSs) exist relative to our oracles, giving an oracle separation between classically accessible logarithmic length PRFSs and superlogarithmic length PRSs. This shows that fully black-box PRS length extension from logarithmic to superlogarithmic output length must use coherent access to the underlying short PRS.

Related

  1. Constructing Arbitrary Coherent Rearrangements in Optical Lattices
    Alexander Roth, Liyang Qiu, Timon Hilker +2
    PRX QuantumPeer-reviewedCC BY 4.0Atomic, molecular & optical physicsAPS
  2. Consecutive Measurement Tradeoffs in Quantum Cryptography
    Chen-Xun Weng, Minglong Qin, Yanglin Hu +1
    PRX QuantumPeer-reviewedPublisher termsQuantum physics & quantum informationCrossref
  3. From Quantum Cryptography to Intuitionism and beyond: relativity, many-worlds and non-locality
    Nicolas Gisin
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  4. Reliable Entropy Estimation from Observed Statistics for Device-Independent Quantum Cryptography
    Gereon Koßmann, René Schwonnek
    QuantumPeer-reviewedCC BY 4.0Full textQuantum physics & quantum informationCrossref
  5. Quantum Cryptography and Autoformalization in Lean
    Maor Ben Shahar, Jonathan Morag, Dirk Englund +1
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
BibTeX
@misc{hhan2026need,
  title = {{Need for Coherent Access in Constructing Quantum Cryptography}},
  author = {Minki Hhan and Changhun Oh and Vaughn Sohn},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.40301},
  eprint = {2609.40301},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.40301},
}
RIS
TY  - UNPB
TI  - Need for Coherent Access in Constructing Quantum Cryptography
AU  - Minki Hhan
AU  - Changhun Oh
AU  - Vaughn Sohn
PY  - 2026
DA  - 2026/09/30
PB  - arXiv
DO  - 10.48550/arxiv.2609.40301
UR  - https://arxiv.org/abs/2609.40301
AB  - We construct quantum oracles relative to which quantum-secure one-way functions (OWFs) exist but pseudorandom states (PRSs) with superlogarithmic output length do not. At first glance, this appears to contradict the known black-box constructions of PRS generators from quantum-secure OWFs. The distinction lies in the access model to the oracles; our oracle separation uses \emph{classical-accessible} random oracles that can be accessed only classically even by quantum algorithms. In fact, our impossibility of PRSs applies to \emph{any} classically accessible classical oracle in place of the random oracle, while keeping the other oracle component unchanged, showing the need for coherent access in constructing PRSs. We further show that logarithmic output length pseudorandom function-like states (PRFSs) exist relative to our oracles, giving an oracle separation between classically accessible logarithmic length PRFSs and superlogarithmic length PRSs. This shows that fully black-box PRS length extension from logarithmic to superlogarithmic output length must use coherent access to the underlying short PRS.
ER  -