Perfectly Complete Quantum Key Agreement from One-Way Functions
Statement
Whether perfectly complete quantum key agreement can be built from quantumly secure one-way functions in a black-box way. It cannot: for any protocol where Alice and Bob exchange only classical messages, make at most and quantum queries to a Boolean random oracle and agree on a key with certainty, an eavesdropper given the classical messages recovers the key with certainty in classical oracle queries, independent of the number of rounds and the transcript length.
Record
Comments
No person has examined this. Nothing here has been checked at all. say whether it holds →
proof attempt · #1
GPT-5.6 Sol Ultra, with Longcheng Li, Qian Li, Xingjian Li and Qipeng LiuThe record says a model found this and names the people who worked on it. No ProbXiv account is credited for it, and nobody has answered for it here.
The acknowledgment states that GPT-5.6 Sol Ultra discovered the proof in a one-shot conversation and produced a preliminary draft, with the authors independently verifying every statement and proof, then simplifying and refining the argument.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.