IonQ Inc Team Separates Public Encryption from Hard Problems
IonQ and NTT researchers theoretically prove that quantum public‑key encryption can exist without quantum one‑way functions.
Quantum Public‑Key Encryption Without One‑Way Functions
A recent pre‑print from IonQ Inc. and NTT Research challenges a long‑standing assumption in quantum cryptography: that secure quantum public‑key encryption (qPKE) must rely on quantum one‑way functions (qOWFs). By constructing a qPKE scheme using quantum indistinguishability obfuscation and efficiently verifiable puzzles—both weaker assumptions—the authors demonstrate a formal separation between qPKE and qOWFs under specific oracle models.
Theoretical Breakthrough
The paper shows that, when an oracle is unitary, real, and self‑inverse, a qPKE protocol can be built even if no qOWFs exist. This result mirrors earlier work that relaxed assumptions for quantum digital signatures, but it is the first to address public‑key encryption directly. The construction adapts classical techniques—public‑key encryption from indistinguishability obfuscation—to the quantum setting, preserving classical readability of ciphertexts while leveraging quantum computation for security.
Why It Matters
Quantum one‑way functions have been viewed as a “hard problem” cornerstone for many quantum cryptographic primitives. Proving that qPKE does not fundamentally depend on them expands the design space for quantum‑secure protocols. It suggests that future quantum‑resistant communication systems might be built on assumptions that are easier to analyze or potentially more robust against advances in quantum algorithms.
Practical Outlook
While the result is purely theoretical, it highlights concrete engineering challenges that remain. Implementing the required quantum indistinguishability obfuscation and efficiently verifiable puzzles at scale will demand stable, high‑fidelity quantum hardware—capabilities that are still in early development. Nonetheless, the work provides a clear roadmap for researchers exploring alternative foundations for quantum cryptography.
Context Within Post‑Quantum Cryptography
The broader post‑quantum community is actively seeking cryptographic schemes that survive both classical and quantum attacks. This separation result adds a new tool to that toolbox, showing that classical‑key, classical‑ciphertext encryption can be secured by quantum means without invoking the strongest known hardness assumptions. It also clarifies the relationships between various quantum primitives, helping to map out which assumptions are truly necessary for different security goals.
---
The findings are detailed in the arXiv pre‑print “Quantum Cryptomania with Classical Communication without One‑Way Functions” (arXiv:2610.32145).
Hype check
RealThe paper provides a concrete theoretical construction separating qPKE from qOWFs, backed by an arXiv pre‑print; no external verification is needed for a proof‑type result.
- Peer-reviewed paper, or press release only?Press release only — Result appears only as an arXiv pre‑print, not a peer‑reviewed article.
- Error-corrected (logical) qubits, or physical qubits only?Logical / not a qubit claim — The claim does not involve qubit counts or logical vs physical qubits.
- A new milestone, or a rebrand / restatement?New — First theoretical separation of qPKE from qOWFs under defined oracles.
- Independent confirmation?Not yet — No external replication or confirmation mentioned in the input.
- Does the headline claim match what the source shows?Matches — Headline accurately reflects the paper’s claim of separating encryption from hard problems.
An editorial assessment of the claim as reported, not a judgment of the company or researchers. Checked against: arxiv.org. How we rate hype →
Source
Read original sourceWhy we picked this
Accepted from curated QuantumUnzipped source (relevance scoring disabled).