ProbXiv
sign in
Problem archiveProblem record

Unconditional One-Bit Unclonable Encryption

Quantum information & computing · posed by Anne Broadbent & Sébastien Lord, 2020 · solved

1 comment

Statement

Can one construct a plain-model, efficient, information-theoretically secure one-time unclonable-encryption scheme for one classical bit with exponentially small adversarial advantage?

Record

Source
Added
Links

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. construction · #1

    Prabhanjan Ananth and Amit Sahai, using GPT-5.6 Sol Ultra, Codex

    That credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.

    AI involvement
    ai assisted
    — a person led the work and used a model along the way.

    Two simultaneous papers achieve the goal independently; one construction, using random Pauli eigenstates, attains the optimal exponent up to constants (Ragavan, ePrint 2026/1509).

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

open in Claude →open in ChatGPT →

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.