“For what it's worth, quantum computers might give a provably correct source of 2 (random numbers). The version I saw (requires 2 quantum devices): http://www.henryyuen.net/fall2018/scribe2.pdf New paper that claims to do it with only one quantum device: https://arxiv.org/pdf/1804.00640.pdf”
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
We consider a new model for the testing of untrusted quantum devices, consisting of a single polynomial-time bounded quantum device interacting with a classical polynomial-time verifier. In this model we propose solutions to two tasks - a protocol for efficient classical verification that the untrusted device is "truly quantum," and a protocol for producing certifiable randomness from a single untrusted quantum device. Our solution relies on the existence of a new cryptographic primitive for constraining the power of an untrusted quantum device: post-quantum secure trapdoor claw-free functions which must satisfy an adaptive hardcore bit property. We show how to construct this primitive based on the hardness of the learning with errors (LWE) problem.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及“You are oversimplifying the issue and solving a "strawman problem. From the abstract of one of the discussed papers [1], > We give a protocol for producing certifiable randomness from a single _untrusted_ quantum device that is _polynomial-time bounded_. The randomness is certified to be statistically close to uniform from the point of view of any _compu…”