# US 2025/0094129 A1 · Method and device for quantum random number generation

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0094129 A1
- Document ID: US20250094129A1
- Status: Published application
- Kind: A1
- Application number: 18/701,420
- Filed: 2022-10-20
- Published: 2025-03-20
- Earliest claimed: 2021-10-20
- Assignees: Universite De Geneve
- Applicants: Université de Genève
- Inventors: Hugo Zbinden; Davide RUSCA; Nicolas BRUNNER
- Web page: https://patentgrep.com/patent/US20250094129A1

## CPC

- G06F 7/58: Random or pseudo-random number generators
- G06F 7/588: {Random number generators, i.e. based on natural stochastic processes}
- G06N 10/40: Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Quantum Random Number Generator comprising an emitting device (1) adapted to be triggered by a signal representing an input bit x and adapted to generate and send a stream of one of two possible non-orthogonal quantum states determined by a plurality of said input bit x at a rate in the range of Mb/s up to 10 Gb/s, a measurement device (2) adapted to detect each quantum state of the stream of quantum states sent by the emitting device (1) and to generate an output b based on the detected quantum state, a random selection device (3) adapted to receive said output b and carries out a random selection on said output b so as to select and pick out a first fraction of the bits b′ and a second fraction of the bit b-b′ sent to an entropy (I) estimation module (4, 4′), wherein the entropy (I) estimation module (4, 4′) is adapted to receive the input x, the output b′ and the output b-b′ over a certain number of rounds N and to estimate the entropy (I) of each output for each quantum state of the stream of quantum states, validating or not an extraction ratio, and at least two parallel randomness extraction devices (5, 5′) adapted to carry out a hybrid extraction protocol generating two final random output bit strings via a first extractor (5′) which extracts the first fraction of the bits b′ with bit block sizes in a first range and generates a string of certified random bits r′ at a first rate; and a second extractor (5) which extracts the second fraction of the bits b-b′ with bit block sizes in a second range, higher than the first range, and generates a string of true random bits r at a second rate, higher than the first rate.

## Claims

### Claim 1

Quantum Random Number Generator comprising
an emitting device (1) adapted to be triggered by a signal representing an input bit x and adapted to generate and send a stream of one of two possible non-orthogonal quantum states determined by a plurality of said input bit x at a rate in the range of Mb/s up to 10 Gb/s,
a measurement device (2) adapted to detect each quantum state of the stream of quantum states sent by the emitting device (1) and to generate an output b based on the detected quantum state,
a random selection device (3) adapted to receive said output b and carries out a random selection on said output b so as to select and pick out a first fraction of the bits b′ and a second fraction of the bit b-b′ sent to an entropy HminQ estimation module (4, 4′),
wherein the entropy HminQ estimation module (4, 4′) is adapted to receive the input x, the output b′ and the output b-b′ over a certain number of rounds N and to estimate the entropy HminQ of each output for each quantum state of the stream of quantum states, validating or not an extraction ratio, and
at least two parallel randomness extraction devices (5, 5′) adapted to carry out a hybrid extraction protocol generating two final random output bit strings via
a first extractor (5′) which extracts the first fraction of the bits b′ with bit block sizes in a first range and generates a string of certified random bits r′ at a first rate; and
a second extractor (5) which extracts the second fraction of the bits b-b′ with bit block sizes in a second range, higher than the first range, and generates a string of true random bits r at a second rate, higher than the first rate.

### Claim 2 (depends on 1)

Quantum Random Number Generator according to claim 1, characterized in that the first extractor is a “slow” extractor (5′) which extracts the first fraction of the bits b′ with block sizes in the range of 10{circumflex over ( )}5-10{circumflex over ( )}7 bits and generates a string of certified random bits r′ at a rate in the order of 1 Mb/s; and the second extractor is a “fast” extractor (5) which extracts the second fraction of the bits b-b′ with block sizes in the range of 28-210 bits and generating a string of true random bits r at a rate in the order of 100 Mb/s.

### Claim 3 (depends on 1)

Quantum Random Number Generator according to claim 1, characterized in that the measurement device is an unambiguous state discrimination measurement, where the output b represents whether the quantum state has been identified or not and, if it has been identified, which quantum state among the two possible quantum states to a processing device.

### Claim 4 (depends on 1)

Quantum Random Number Generator according to claim 1, characterized in that the entropy HminQ estimation module comprises a first processing device (4′) adapted to estimates the entropy HminQ of the output b′ and a second processing device (4) adapted to estimates the entropy HminQ of the output b-b′.

### Claim 5 (depends on 4)

Quantum Random Number Generator according to claim 4, characterized in that the processing devices (4′, 4) estimate the probabilities p(b′|x) and r p(b-b′|x) representing the probability of observing output b′ and b-b′ for a state preparation x and estimates the entropy HminQ of the output b′ and b-b′.

### Claim 6 (depends on 1)

Quantum Random Number Generator according to claim 1, characterized in that the two possible non-orthogonal quantum states are encoded in one of the temporal mode of photons, the polarization of photons, the frequency mode of photons, the photon number degree of freedom of light, the spatial mode of photons, the path degree of freedom of photons, or the phase of weak coherent pulses.

### Claim 7 (depends on 1)

Quantum Random Number Generator according to claim 1, characterized in that the two possible non-orthogonal quantum states are encoded using a combination of two or more of the temporal mode of photons, the polarization of photons, the frequency mode of photons, the photon number degree of freedom of light, the spatial mode of photons, the path degree of freedom of photons, or the phase of weak coherent pulses, or using other quantum systems such as atomic systems and superconducting systems.

### Claim 8 (depends on 1)

Quantum Random Number Generator according to claim 1, characterized in that the random selection device (3) carries out the random selection using a pseudorandom number generator.

### Claim 9 (depends on 1)

Quantum Random Number Generator according to claim 1, characterized in that the raw key is 0 if the output b is conclusive or 1 if the output b is inconclusive.

### Claim 10 (depends on 1)

Quantum Random Number Generator according to claim 1, characterized in that the entropy estimation is made according to HminQ=−log2(pg), where the guessing probability pg can be upper bounded from the probabilities p(b|x) as follows: pg=Σx,bvx,bp(b|x)+γ, where the parameter vxb and γ are obtained via an adapted semi-definite program (SDP).

### Claim 11 (depends on 1)

Quantum Random Number Generator according to claim 1, characterized in that the randomness extraction is realized by a vector-matrix multiplication between a vector formed by the raw bit value generated at the output of the unambiguous quantum state discrimination measurement device and a random matrix M where the dimension is adapted as a function of the quantity of entropy HminQ estimated (140).

### Claim 12 (depends on 1)

Quantum Key Distribution System comprising at least one Quantum Random Number Generator of claim 1.

### Claim 13

Self-testing method carried out by a Quantum Random Number Generator comprising the steps of:
preparing and sending (S101, S102) a stream of one of two possible non-orthogonal quantum states determined by a plurality of input bit x at a rate in the range of Mb/s up to 10 Gb/s,
detecting and measuring (520) each quantum state of the stream of quantum states sent and generating an output b based on the detected quantum state,
carrying out a random selection (S104, S106) on the output b so as to select and pick out a first fraction of the bits b′ and a second fraction of the bit b-b′ sent to an entropy estimation module (4′, 4),
estimating (550) the entropy HminQ of each the output b′ and the output b-b′ for each quantum state of the stream of quantum states and validating or not an extraction ratio, and
randomness extracting (560) via two parallel randomness extraction procedures adapted to carry out a hybrid extraction protocol generating two final random output bit strings via
a first extraction (5) which extracts the first fraction of the bits b′ with bit block sizes in a first range and generates a string of certified random bits r′ at a first rate; and
a second extraction (5′) which extracts the second fraction of the bits b-b′ with bit block sizes in a second range, higher than the first range, and generates a string of true random bits r at a second rate, higher than the first rate.

### Claim 14 (depends on 13)

Self-testing method according to claim 13, characterized in that the first extraction is a “slow” extraction (5′) which extracts the first fraction of the bits b′ with block sizes in the range of 10{circumflex over ( )}5-10{circumflex over ( )}7 bits and generates a string of certified random bits r′ at a rate in the order of 1 Mb/s; and
the second extraction is a “fast” extraction (5′) which extracts the second fraction of the bits b-b′ with block sizes in the range of 28-210 bits and generating a string of true random bits r at a rate in the order of 100 Mb/s.

### Claim 15 (depends on 13)

Self-testing method according to claim 13, characterized in that the preparation device prepares and sends a physical system prepare in any number of non-orthogonal quantum states and the measurement device consists in an adapted unambiguous state discrimination measurement.
