US 12,457,118 B1
Verification of quantum randomness using classical hardware with one round of communication
Vipin Singh Sehrawat, Fremont, CA (US)
Assigned to Circle Internet Group, Inc., Boston, MA (US)
Filed by Circle Internet Group, Inc., New York, NY (US)
Filed on Feb. 23, 2024, as Appl. No. 18/585,847.
Int. Cl. H04L 29/06 (2006.01); H04L 9/32 (2006.01)
CPC H04L 9/3278 (2013.01) [H04L 9/3297 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A computer implemented method for verifying randomness produced by a quantum computing device, the method comprising:
receiving, by a classical computing device and from the quantum computing device, data comprising a timestamp, a binary-valued vector, and a predicted response to a challenge string, wherein the predicted response to the challenge string is generated by the quantum computing device using a regression model that has been trained on training data during a setup process to fit learning parity with noise (LPN) instances as a linear function, and the LPN instances are constructed by the classical processing device using a physically unclonable function (PUF);
determining, by the classical computing device, a parity of a random number output by a public source of randomness at a time specified by the timestamp; and
performing, by the classical computing device and based on the parity of the random number, either a generation round or a test round to verify the randomness of a bit generated by the quantum computing device, wherein
the generation round uses the binary-valued vector and predicted response to the challenge string to verify a preimage of the binary-valued vector generated by the quantum computing device, and
the test round uses the binary-valued vector to verify an equation generated by the quantum computing device.