Quantum Randomness Verification With PUF-Based One-Round Challenges
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Efficient certification of true randomness in quantum computing devices is challenging due to computational power limitations and restrictions imposed by quantum mechanics, making it difficult to verify the quantum behavior and certify randomness using classical computing devices.
Innovation Solution
A classical computing device verifies quantum randomness using a physically unclonable function (PUF) to generate training data for regression models, which are used in conjunction with a quantum computing device to perform one round of communication for randomness verification, incorporating hardware-based cryptographic functions and post-quantum cryptography for robustness.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If statistical tests (NIST, Diehard) are used to verify randomness, then the randomness can be tested, but true randomness cannot be certified with finite computational power
Solution Approach 1:
The patent introduces an intermediary classical verification protocol that bridges the gap between quantum randomness generation and classical verification. The protocol uses classical computing devices to verify quantum randomness through a structured interaction involving challenge-response pairs, thereby enabling certification without requiring finite computational power to directly certify true randomness.
Solution Approach 2:
The patent replaces direct statistical testing mechanisms with a quantum-mechanical based verification system. Instead of relying solely on classical statistical tests that cannot certify true randomness, the system uses quantum mechanical properties (superposition, entanglement) to generate and verify randomness, substituting the verification mechanism itself.
2Productivity
If quantum computing device computational power is utilized, then randomness can be generated, but verification becomes difficult due to restrictions imposed by quantum mechanics on access to internal state
Solution Approach 1:
The patent extracts the essential verification information from the quantum device's internal state through measurement and classical communication. Instead of requiring direct access to the quantum internal state, the protocol extracts verifiable randomness through measurement outcomes that can be communicated classically, separating the generation function from the verification function.
Solution Approach 2:
The patent introduces classical communication as an intermediary between the quantum randomness generation process and the verification process. This intermediary layer allows the verification of quantum randomness without requiring direct access to the quantum internal state, using classical challenge-response interactions instead.
3Reliability
If multiple rounds of communication are used for verification, then verification thoroughness can be improved, but communication efficiency deteriorates
Solution Approach 1:
The patent performs preliminary actions by pre-establishing trust through quantum key distribution and pre-agreeing on verification parameters before the actual randomness verification begins. This preliminary setup enables subsequent verification rounds to be more efficient, reducing the need for extensive back-and-forth communication while maintaining thoroughness.
Data Source
AI summary
Methods, systems, and apparatus for verifying quantum randomness. In one aspect a computing device receives data from a quantum computer. The data includes a timestamp, a binary-valued vector, and a predicted response to a challenge string. The predicted response to the challenge string is generated using a regression model that has been trained to fit LPN instances as a linear function, where the LPN instances are constructed using a physically unclonable function. The computing device determines a parity of a random number output by a public source of randomness at a time specified by the timestamp and performs either a generation round or a test round based on the parity to verify the randomness of a bit generated by the quantum computer. The generation round uses the data to verify a preimage of the binary-valued vector and the test round uses the data to verify an equation.