Cited by 15Quantum Information and CryptographyQuantum Computing Algorithms and ArchitectureQuantum Mechanics and Applications

Hybrid Hadamard and controlled-Hadamard based quantum random number generators in IBM QX

Salehi, Ramin, Razaghi, Mohammad, Fotouhi, Bashir·2022·Physica Scripta

Abstract

Designing novel circuits and models for generating truly random numbers is of great importance. Recent attention has been focused on the idea of using real quantum computers to generate random numbers. In order to generate purely random bits and numbers, one method relies on the natural superposition of quantum gates. Here, we design a Quantum Random Number Generator (QRNG) exploiting combinations of Hadamard and controlled-Hadamard gates in IBM Quantum Experience (QX). In order to verify that the generated bit sequences were truly random, the proposed circuit’s outputs were subjected to the National Institute of Standards and Technology (NIST) test suite. In comparison to previous works, we found that not only had the total number of passed tests increased, but the P-values had also improved in many cases. For example, in the simulation style of the IBM QX, the number of passed tests is 14 out of 15 standard NIST tests. For the experimental mood of the IBM 16Q Melbourne, the number of passed tests is six without using any extractions. Furthermore, one more test is passed by adding Barrier operations to the circuits, and the P-values have increased. As a result, we found that the proposed method had more passed tests than previous works. The average of P-values for the six passed tests in former research for the mood of using a combination of extractors is about 0.43 . However, the best result we can get with our circuits is around 0.60 (the average of P-values for 14 passed tests), which is an improvement of 0.17 compared to former works . Because of this, our circuits are getting ever closer to being a true QRNG.

Integrity signals

Registry

Crossref · 10.1088/1402-4896/ac698b

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

The citation lists haven’t been fetched yet

References 34 · Cited by 15

Authors
Salehi, R., Razaghi, M., & Fotouhi, B.
Affiliations
University of Kurdistan (IR)
Corresponding author
Razaghi, Mohammad
Venue
Physica Scripta
Published
2022-05-11
Volume
97
Issue
6
Pages
065101
ISSN
  • 0031-8949 (ISSN-L)
  • 1402-4896
OpenAlex
W4224248306
Cited by
15
References
34
Citations by year
2026: 3 · 2025: 7 · 2024: 4 · 2023: 1
FWCI
0.99
Type
journal article
Language
en
Open access
closed
Locations
Physica Scripta (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
quantum random number generation, Hadamard gate, IBM Quantum Experience, NIST randomness tests, p-values, quantum circuit design, true randomness

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review