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

Springer eBooks

Refined Stationary Randomness of Quantum Random Sequences on Variant Maps

Jeffrey Zheng, Yamin Luo, Zhefei Li

Published Dec 17, 2018• 0 citations
Publisher

Abstract

Abstract In this chapter, a testing model is used to apply statistical probability in multiple distributions on three maps for a selected sequence to check refined stationary randomness on quantum sequences. Three random data sequences are collected from two quantum random resources: one from Australian National University (ANU) and two (initial and secure) from University of Science and Technology of China (USTC). Multiple results are created on three maps, and measurements of stationary randomness are illustrated and compared. Three samples show distinct stationary properties.

DOI
10.1007/978-981-13-2282-2_20

Related papers

Using Information Entropy to Measure Stationary Randomness of Quantum Random Sequences

Weizhong Yang, Yamin Luo, Zhefei Li +1 more

Abstract Different statistical measurements can be used to determine stationary randomness for random sequences. This chapter proposes a testing scheme for random sequences using information entropy as measurements. Datasets are collected from University of Science & Technology of China (USTC), three quantum random sequences are selected for testing. Multiple results are created on three maps, entropy curves, and quantitative measurements of stationary randomness are compared. Three differences of Max-Min entropy variation ratios are bounded in $$[0.08,0.09]\%$$ [ 0.08 , 0.09 ] % region. The whole structure has measurable stationary properties.

Springer eBooks•Dec 17, 2018•1 citation

Stationary Randomness of Quantum Cryptographic Sequences on Variant Maps

Jeffrey Zheng, Chris Zheng

Natural and artificial sequences of big data streams have various stationary and non-stationary properties. A Quantum Key Distribution (QKD) system has a quantum random number generator to protect data streams in quantum communication environments. From a cryptanalysis viewpoint, it is necessary to use statistical probability, stochastic processes and time series to evaluate quality of stationary randomness in quantum cryptographic sequrences.

IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)•Jul 31, 2017•5 citations

One-dimensional eigenvalue distributions of random sequences for FFT non-stationary randomness

Xin Zhang, Jeffrey Zheng

In modern photon statistics, classical and quantum behavior can be distinguished by various quantum states of photon statistical distributions: Poisson (coherent/semi-classical wave behavior), and sub-Poisson (compressed state/particle behavior). Since this type of measurement mechanism is often associated with advanced laser/optical or photonic techniques, can this type of distribution model be modeled using discrete 0-1 sequences? In this paper, several sets of simulation modes are designed, and FFT transformation is used to extract relevant eigenvalues. Following the processing methods in the variant construction, special filters are constructed using the quantum random sequence provided by ANU (Australian national university), and conditional random sub-sequences are collected as input sequences. Multiple segments are separated from a random sequence, and relevant eigenvalues of FFT are selected to form a special set of eigenvalues. The shift operations are used to transform each sequence, showing obvious non-stationary random effects on various maps.

Infrared Remote Sensing and Instrumentation•Sep 9, 2019•0 citations

IMPLEMENTATION AND EVALUATION OF A QUANTUM RANDOM NUMBER GENERATOR BASED ON ANU QRNG FOR CRYPTOGRAPHIC APPLICATION

Софія Парфило, Віталій Вікторович Коваль

Topicality. Reliable random number generation is one of the key requirements for modern cryptographic systems and cybersecurity applications. Traditional pseudo-random number generators are based on deterministic algorithms and may exhibit limited entropy and predictability, which can negatively affect information security. The subject of study in the article is methods of quantum random number generation and approaches to evaluating the quality of generated random sequences. The purpose of the article is to analyze modern methods of quantum random number generation, develop a software tool for obtaining quantum random numbers based on the ANU Quantum Random Number Generator service, perform statistical testing of the generated sequences, and analyze the obtained results. The following results were obtained. Modern quantum random number generation systems were analyzed and compared. A software tool was implemented in Python for automatic retrieval of quantum random numbers through the ANU QRNG API. The generated binary sequences were evaluated using Frequency Test and Block Frequency Test from the NIST SP 800-22 statistical test suite. The obtained p-values were 0.977181 and 0.200659 respectively, confirming successful completion of both tests. Additionally, visual analysis of the generated sequences revealed no noticeable patterns or repetitive structures. Conclusion. The obtained results confirm the high quality of quantum random sequences generated using ANU QRNG and demonstrate the applicability of the developed software tool for cryptographic and cybersecurity applications requiring high-quality randomness.

Terra security•Jul 4, 2026•0 citations

Quantum generators of random numbers

Marcin M. Jacak, Piotr Paweł Jóźwiak, Jakub Niemczuk +1 more

Generation of random numbers is a central problem for many applications in the field of information processing, including, e.g., cryptography, in classical and quantum regime, but also mathematical modeling, Monte Carlo methods, gambling and many others. Both, the quality of the randomness and efficiency of the random numbers generation process are crucial for the most of these applications. Software produced pseudorandom bit sequences, though sufficiently quick, do not fulfill required randomness quality demands. Hence, the physical hardware methods are intensively developed to generate truly random number sequences for information processing and electronic security application. In the present paper we discuss the idea of the quantum random number generators. We also present a variety of tests utilized to assess the quality of randomness of generated bit sequences. In the experimental part we apply such tests to assess and compare two quantum random number generators, PQ4000KSI (of company ComScire US) and JUR01 (constructed in Wroclaw University of Science and Technology upon the project of The National Center for Research and Development) as well as a pseudorandom generator from the Mathematica Wolfram package. Finally, we present our new prototype of fully operative miniaturized quantum random generator JUR02 producing a random bit sequence with velocity of 1 Mb/s, which successfully passed standard tests of randomness quality (like NIST and Dieharder tests). We also shortly discuss our former concept of an entanglement-based quantum random number generator protocol with unconditionally secure public randomness verification.

Scientific Reports•Aug 9, 2021•85 citations

Generating 2D statistical distributions from Fock to Poissonian states on variant maps using random sequences

Jeffrey Zheng, Xinming Zhang, Chris Zheng

From a quantum statistical viewpoint, four typical quantum states are Fock, Sub-Poissonian, Poissonian and SuperPoissonian states. Quantum interactions are focus among Fock and Poissonian states. Using quantum statistics, model and simulation, this paper proposes two models: matrix and variant transformations: 1. MT Matrix Transformation – eigenvalue states; 2. VT Variant Transformation – invariant states to analyze three random sequences: 1) random; 2) conditional random in a constant; 3) periodic pattern. Four procedures are proposed. Fast Fourier Transformation FFT is applied as one of MT schemes and two invariant scheme of VT schemes are applied, three random sequences are in M segments and each segment has a length m to generate a measuring sequence. Shifting operations are applied on each random sequence to create m+1 spectrum distributions. For FFT, a pair of eigenvalues are selected as the output. Two types of 1D and 2D variant maps are generated to illustrate multiple parameter selections to generate a series of results. Since sequences 1) and 3) are related simple, more cases are focus on sequences 2). Better than FFT, VT distinguishes various Fock, Sub-Poissonian, Poissonian states in random analysis to distinguish three random sequences as three levels of statistical ensembles: Micro-canonical, Canonical, and Grand-Canonical ensembles. Applying two transformations, quantum statistics, model and simulation of modern quantum theory and applications can be explored.

Infrared Remote Sensing and Instrumentation•Sep 9, 2019•0 citations
Abstract In this chapter, a testing model is used to apply statistical probability in multiple distributions on three maps for a selected sequence to check refined stationary randomness on quantum sequences. Three random data sequences are collected from two quantum random resources: one from Australian National University (ANU) and two (initial and secure) from University of Science and Technology of China (USTC). Multiple results are created on three maps, and measurements of stationary randomness are illustrated and compared. Three samples show distinct stationary properties.
Abstract Different statistical measurements can be used to determine stationary randomness for random sequences. This chapter proposes a testing scheme for random sequences using information entropy as measurements. Datasets are collected from University of Science & Technology of China (USTC), three quantum random sequences are selected for testing. Multiple results are created on three maps, entropy curves, and quantitative measurements of stationary randomness are compared. Three differences of Max-Min entropy variation ratios are bounded in [0.08,0.09]%[0.08,0.09]\%[0.08,0.09]% [ 0.08 , 0.09 ] % region. The whole structure has measurable stationary properties.
In modern photon statistics, classical and quantum behavior can be distinguished by various quantum states of photon statistical distributions: Poisson (coherent/semi-classical wave behavior), and sub-Poisson (compressed state/particle behavior). Since this type of measurement mechanism is often associated with advanced laser/optical or photonic techniques, can this type of distribution model be modeled using discrete 0-1 sequences? In this paper, several sets of simulation modes are designed, and FFT transformation is used to extract relevant eigenvalues. Following the processing methods in the variant construction, special filters are constructed using the quantum random sequence provided by ANU (Australian national university), and conditional random sub-sequences are collected as input sequences. Multiple segments are separated from a random sequence, and relevant eigenvalues of FFT are selected to form a special set of eigenvalues. The shift operations are used to transform each sequence, showing obvious non-stationary random effects on various maps.
Topicality. Reliable random number generation is one of the key requirements for modern cryptographic systems and cybersecurity applications. Traditional pseudo-random number generators are based on deterministic algorithms and may exhibit limited entropy and predictability, which can negatively affect information security. The subject of study in the article is methods of quantum random number generation and approaches to evaluating the quality of generated random sequences. The purpose of the article is to analyze modern methods of quantum random number generation, develop a software tool for obtaining quantum random numbers based on the ANU Quantum Random Number Generator service, perform statistical testing of the generated sequences, and analyze the obtained results. The following results were obtained. Modern quantum random number generation systems were analyzed and compared. A software tool was implemented in Python for automatic retrieval of quantum random numbers through the ANU QRNG API. The generated binary sequences were evaluated using Frequency Test and Block Frequency Test from the NIST SP 800-22 statistical test suite. The obtained p-values were 0.977181 and 0.200659 respectively, confirming successful completion of both tests. Additionally, visual analysis of the generated sequences revealed no noticeable patterns or repetitive structures. Conclusion. The obtained results confirm the high quality of quantum random sequences generated using ANU QRNG and demonstrate the applicability of the developed software tool for cryptographic and cybersecurity applications requiring high-quality randomness.
Generation of random numbers is a central problem for many applications in the field of information processing, including, e.g., cryptography, in classical and quantum regime, but also mathematical modeling, Monte Carlo methods, gambling and many others. Both, the quality of the randomness and efficiency of the random numbers generation process are crucial for the most of these applications. Software produced pseudorandom bit sequences, though sufficiently quick, do not fulfill required randomness quality demands. Hence, the physical hardware methods are intensively developed to generate truly random number sequences for information processing and electronic security application. In the present paper we discuss the idea of the quantum random number generators. We also present a variety of tests utilized to assess the quality of randomness of generated bit sequences. In the experimental part we apply such tests to assess and compare two quantum random number generators, PQ4000KSI (of company ComScire US) and JUR01 (constructed in Wroclaw University of Science and Technology upon the project of The National Center for Research and Development) as well as a pseudorandom generator from the Mathematica Wolfram package. Finally, we present our new prototype of fully operative miniaturized quantum random generator JUR02 producing a random bit sequence with velocity of 1 Mb/s, which successfully passed standard tests of randomness quality (like NIST and Dieharder tests). We also shortly discuss our former concept of an entanglement-based quantum random number generator protocol with unconditionally secure public randomness verification.
From a quantum statistical viewpoint, four typical quantum states are Fock, Sub-Poissonian, Poissonian and SuperPoissonian states. Quantum interactions are focus among Fock and Poissonian states. Using quantum statistics, model and simulation, this paper proposes two models: matrix and variant transformations: 1. MT Matrix Transformation – eigenvalue states; 2. VT Variant Transformation – invariant states to analyze three random sequences: 1) random; 2) conditional random in a constant; 3) periodic pattern. Four procedures are proposed. Fast Fourier Transformation FFT is applied as one of MT schemes and two invariant scheme of VT schemes are applied, three random sequences are in M segments and each segment has a length m to generate a measuring sequence. Shifting operations are applied on each random sequence to create m+1 spectrum distributions. For FFT, a pair of eigenvalues are selected as the output. Two types of 1D and 2D variant maps are generated to illustrate multiple parameter selections to generate a series of results. Since sequences 1) and 3) are related simple, more cases are focus on sequences 2). Better than FFT, VT distinguishes various Fock, Sub-Poissonian, Poissonian states in random analysis to distinguish three random sequences as three levels of statistical ensembles: Micro-canonical, Canonical, and Grand-Canonical ensembles. Applying two transformations, quantum statistics, model and simulation of modern quantum theory and applications can be explored.