Certified Quantum Randomness Verification With Untrusted Hardware
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems lack a method to generate certified random numbers using an untrusted quantum computer, as skepticism about the trustworthiness of the quantum device complicates the verification of randomness.
Innovation Solution
A classical client issues a sequence of challenges to an untrusted quantum computer, executing apparently-random quantum circuits, and uses verification models to ensure the generated bit sequences meet a requisite degree of randomness, thereby certifying the randomness of the output.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a classical device is used to measure quantum system state to extract random bits, then randomness can be generated, but the skeptic cannot trust the classical device or the construction of the quantum device
Solution Approach 1:
The patent introduces a verification system as an intermediary that bridges the untrusted quantum device and the classical skeptic. This verification system uses classical simulation models to independently verify the quantum device's output without requiring direct trust in the quantum device's internal operations or construction.
Solution Approach 2:
The patent replaces direct physical measurement and trust in quantum device construction with a computational verification approach. Instead of relying on the physical trustworthiness of the quantum device, the system uses classical computers to simulate and verify the quantum device's output, substituting physical trust with computational verification.
2Reliability
If quantum phenomena are used as a source of randomness, then inherent randomness is achieved, but skepticism about the trustworthiness of the quantum device complicates verification
Solution Approach 1:
The patent creates a classical copy or model of the quantum device's expected behavior. By simulating the quantum device using classical computers, the verification system can compare the actual quantum output against the expected output from the classical model, making verification accessible without requiring direct measurement of quantum phenomena.
Solution Approach 2:
The verification system acts as an intermediary that translates quantum randomness verification into a classical computational problem. It mediates between the quantum device and the skeptic by providing a classical simulation framework that can independently verify randomness without requiring direct quantum measurement or trust in the device's physical construction.
3Productivity
If an untrusted quantum computer executes quantum circuits to generate bit sequences, then high-entropy output is produced, but the output may be spoofed by other devices
Solution Approach 1:
The verification system implements feedback by continuously monitoring and verifying the quantum device's output against the classical simulation model. This feedback mechanism allows the system to detect and reject spoofed output while maintaining high generation rates, as verification can be performed in parallel with the quantum circuit execution.
Solution Approach 2:
The system performs preliminary verification using classical simulation before accepting the quantum device's output. By pre-computing the expected output distribution through classical simulation, the system can quickly verify authenticity without delaying the high-speed quantum random number generation process.
Applied Scientific Principles
This section explains which scientific principles are used to turn an abstract innovation direction into a practical engineering solution.
Function Achieved in This Case
The system effectively verifies the randomness of bit sequences generated by the quantum computer, ensuring they are not spoofed by other devices, thus providing certified random numbers.
Implementation Method 1
Quantum phenomena, such as radioactive decay or the behavior of entangled systems of multiple quantum objects (e.g., photons or ions), exhibit inherent randomness due to the non-deterministic nature of quantum mechanics
Data Source
AI summary
Classical computer systems can generate certified random bit strings using an untrusted quantum computer. The classical computer system can issue a sequence of challenges to the quantum computer, with each challenge involving execution of an apparently-random quantum circuit generated by the classical client. By executing the quantum circuits, the quantum computer can generate a high-entropy bit sequence, and the classical client can use the high-entropy bit sequence to generate sequences of random bits. The classical client can use models of quantum probability distributions for at least some of the challenges to verify that the bit sequence was generated by a quantum computer executing the quantum circuit generated by the classical client, thereby supporting certification of the randomness of the sequence of bits.