Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes on data engineering and communications technologies

The Novel Multi Source Method for the Randomness Extraction

Maksim Iavich, Tamari Kuchukhidze

Published Jan 1, 2023• 0 citations
Publisher
DOI
10.1007/978-3-031-24475-9_6

Related papers

How to Extract Useful Randomness from Unreliable Sources

Divesh Aggarwal, Maciej Obremski, João Ribeiro +2 more

Lecture notes in computer science•Jan 1, 2020•15 citations

Sharp lower bounds on the extractable randomness from non-uniform sources

Boris Škorić, Chibuzo Obi, Evgeny A. Verbitskiy +1 more

Information and Computation•Jun 24, 2011•16 citations

Algebraic Symmetry and Stochastic Independence: A Comparative Study of Deterministic, Seeded, and Matrix-based Randomness Extraction on QRNG-Generated Datasets

Muhammad Kamran, Roohi Zafar, Tahir Malik

Theoretically, Quantum random number generators (QRNGs) can produce truly random numbers that cannot be predicted in advance and have numerous uses. But in practice, it cannot escape the problem of unwanted classical noise, which reduces the quality of the random bits they produce. Therefore, we need to post-process data from a QRNG’s entropy source to improve the statistical quality of the classical output sequence generated from the quantum entropy source. In this work, we implement and compare six extraction primitives: Von Neumann, Multi-level Peres, Toeplitz-hash, Circulant-hash, Trevisan’s construction, and SHA-256 distillation. Using a large classical random bit stream generated by an experimental QRNG, we evaluate these algorithms based on extraction efficiency (η), computational complexity, and seed-entropy requirements. The findings show that although deterministic approaches, such as Multi-level Peres, outperform von Neumann maps, algebraic approaches, especially Circulant extractors, offer higher throughput (η = 0.90) and lower seed consumption by leveraging the cyclicity of the group Zn. The Trevisan extractor provides strong theoretical security with reduced seed growth, but at the cost of higher computational complexity. In contrast, the SHA-256-based method offers fast practical post-processing but provides no information-theoretic entropy guarantees. Statistical validation via autocorrelation and inter-sequence cross-correlation confirms that all evaluated methods successfully decouple hardware-induced dependencies

International Journal of Modern Physics C•Oct 30, 2026•0 citations

Two-Source Extractors Secure Against Quantum Adversaries

Roy Kasher, Julia Kempe

We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two quantum adversaries store a bounded amount of information. Our main result is a two-source extractor secure against quantum adversaries, with parameters closely matching the classical case and tight in several instances. Moreover, the extractor is secure even if the adversaries share entanglement. The construction is the Chor-Goldreich [CG88] two-source inner product extractor and its multi-bit variant by Dodis et al. [DEOR04]. Previously, research in this area focused on the construction of seeded extractors secure against quantum adversaries; the multi-source setting poses new challenges, among which is the presence of entanglement that could potentially break the independence of the sources.

arXiv:1005.0512•May 4, 2010•6 citations

Quantum-Resilient Randomness Extraction

Renato Renner

Lecture notes in computer science•Jan 1, 2011•0 citations

Multi-Gbps quantum randomness source based on direct detection and vacuum states

Dino Solar Nikolic, Cosmo Lupo, Runjia Zhang +3 more

Quantum random number generators (QRNGs) based on quadrature measurements of the vacuum have so far used balanced homodyne detection to obtain a source of high entropy. Here we propose a simple direct detection measurement scheme using only a laser and a photodiode that still extracts randomness from vacuum fluctuations. We prove the security of the QRNG based on a reduced set of assumptions in comparison to previous security proofs for quadrature detection as our proof does not require the laser or electronic noise to be Gaussian. Using a low-cost setup based on a vertical-cavity surface-emitting laser we experimentally implement the QRNG scheme. We propose a system characterization method, apply it to our implementation and demonstrate a real-time randomness extraction rate of 3.41 Gbit per second. The unique combination of speed, low cost, and rigorous security proof gives our QRNG design a large potential for a wide-scale usage in a variety of applications ranging from quantum key distribution to mobile applications and internet of things.

arXiv:2310.02354•Oct 3, 2023•2 citations
Theoretically, Quantum random number generators (QRNGs) can produce truly random numbers that cannot be predicted in advance and have numerous uses. But in practice, it cannot escape the problem of unwanted classical noise, which reduces the quality of the random bits they produce. Therefore, we need to post-process data from a QRNG’s entropy source to improve the statistical quality of the classical output sequence generated from the quantum entropy source. In this work, we implement and compare six extraction primitives: Von Neumann, Multi-level Peres, Toeplitz-hash, Circulant-hash, Trevisan’s construction, and SHA-256 distillation. Using a large classical random bit stream generated by an experimental QRNG, we evaluate these algorithms based on extraction efficiency (η), computational complexity, and seed-entropy requirements. The findings show that although deterministic approaches, such as Multi-level Peres, outperform von Neumann maps, algebraic approaches, especially Circulant extractors, offer higher throughput (η = 0.90) and lower seed consumption by leveraging the cyclicity of the group Zn. The Trevisan extractor provides strong theoretical security with reduced seed growth, but at the cost of higher computational complexity. In contrast, the SHA-256-based method offers fast practical post-processing but provides no information-theoretic entropy guarantees. Statistical validation via autocorrelation and inter-sequence cross-correlation confirms that all evaluated methods successfully decouple hardware-induced dependencies
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two quantum adversaries store a bounded amount of information. Our main result is a two-source extractor secure against quantum adversaries, with parameters closely matching the classical case and tight in several instances. Moreover, the extractor is secure even if the adversaries share entanglement. The construction is the Chor-Goldreich [CG88] two-source inner product extractor and its multi-bit variant by Dodis et al. [DEOR04]. Previously, research in this area focused on the construction of seeded extractors secure against quantum adversaries; the multi-source setting poses new challenges, among which is the presence of entanglement that could potentially break the independence of the sources.
Quantum random number generators (QRNGs) based on quadrature measurements of the vacuum have so far used balanced homodyne detection to obtain a source of high entropy. Here we propose a simple direct detection measurement scheme using only a laser and a photodiode that still extracts randomness from vacuum fluctuations. We prove the security of the QRNG based on a reduced set of assumptions in comparison to previous security proofs for quadrature detection as our proof does not require the laser or electronic noise to be Gaussian. Using a low-cost setup based on a vertical-cavity surface-emitting laser we experimentally implement the QRNG scheme. We propose a system characterization method, apply it to our implementation and demonstrate a real-time randomness extraction rate of 3.41 Gbit per second. The unique combination of speed, low cost, and rigorous security proof gives our QRNG design a large potential for a wide-scale usage in a variety of applications ranging from quantum key distribution to mobile applications and internet of things.