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

A Com parison of Classical and Quantum Implement ations of a Random Number Generator: An Introduction to Quantum Computing

Charlotte Coffin

Published Jan 1, 2018• 0 citations
OpenAlex

Abstract

Quantum computers have potential to contribute to advancements in many disciplines including chemistry, material science, and artificial intelligence. As quantum computers become more accessible, there is a greater need for people to understand quantum computation to spearhead such advancements. This thesis discusses the basics of quantum computing, including fundamental concepts and a literature review. In order to demonstrate how quantum computation works, a random number generator is implemented on a quantum computer simulator and compared to a random number generator implemented on a classical computer. The results of the two experiments are compared. The results show that a quantum random number generator creates truly random numbers. This work contributes to the basic understanding of quantum computing by computer science novice learners, thus opening quantum computing to further exploration. 2

Related papers

Introduction to Quantum Computing

Surya Teja Marella, Hemanth Sai Kumar Parisa

Quantum computing is a modern way of computing that is based on the science of quantum mechanics and its unbelievable phenomena. It is a beautiful combination of physics, mathematics, computer science and information theory. It provides high computational power, less energy consumption and exponential speed over classical computers by controlling the behavior of small physical objects i.e. microscopic particles like atoms, electrons, photons, etc. Here, we present an introduction to the fundamental concepts and some ideas of quantum computing. This paper starts with the origin of traditional computing and discusses all the improvements and transformations that have been done due to their limitations until now. Then it moves on to the basic working of quantum computing and the quantum properties it follows like superposition, entanglement and interference. To understand the full potentials and challenges of a practical quantum computer that can be launched commercially, the paper covers the architecture, hardware, software, design, types and algorithms that are specifically required by the quantum computers. It uncovers the capability of quantum computers that can impact our lives in various viewpoints like cyber security, traffic optimization, medicines, artificial intelligence and many more. At last, we concluded all the importance, advantages and disadvantages of quantum computers. Small-scale quantum computers are being developed recently. This development is heading towards a great future due to their high potential capabilities and advancements in ongoing research. Before focusing on the significances of a general-purpose quantum computer and exploring the power of the new arising technology, it is better to review the origin, potentials, and limitations of the existing traditional computing. This information helps us in understanding the possible challenges in developing exotic and competitive technology. It will also give us an insight into the ongoing progress in this field.

IntechOpen eBooks•Nov 6, 2020•52 citations

An Overview of Quantum Computing's Potential to Solve Complex Problems

Syeda Kawsar -

Quantum computing is necessary to be described as a powerful tool is the new generation of computational power that works based on the principles of quantum mechanics, allowing the solving of problems that are intractable for classical computers. Due to the utilization of such phenomena as superposition, quantum entanglement and quantum interference, quantum computers are said to be able to solve problems in such areas as cryptography, artificial intelligence, optimization problems and material sciences, among others. This paper attempts to examine the basic concepts of quantum computing while focusing on their different aspects and their potential impacts. This study its experience and potential in its current form and in future applications through examples, illustrations, and theoretical discussion. Specific problems, including error correction, hardware scalability, and requirements for resources to address, make the paper a comprehensive overview of the quantum computing potential and weaknesses. Moving towards practical examples, the discussion covers all aspects of the book, providing readers with a holistic understanding of how quantum computing is going to change technological paradigms in the forthcoming decades.

Journal of Mathematical & Computer Applications•Dec 28, 2022•1 citation

Quantum Random Numbers: A Survey on Sources, Numerical Evidence, and Applications in Security and Computing

Sebastian Raubitzek, Stefan Mühlhauser, Kevin Mallinger

Random numbers are used to generate cryptographic keys, to run Monte Carlo simulations, and to train and sample machine learning models. Most software obtains them from deterministic pseudo-random number generators, which have good statistical properties but are predictable once their internal state is known. Quantum random number generators take their output from measurements on quantum systems, whose outcomes are not fixed by any prior state of the device. This article introduces the types of random number generators, reviews studies that compare quantum and pseudo-random numbers in numerical experiments, and lists the sources of randomness available in current computing systems. It then describes applications of quantum randomness in security, hashing, software, artificial intelligence, and public randomness. The quality of encryption is treated as depending on three factors: the algorithm, its implementation, and the randomness of keys and other security-relevant values. We give arguments for which applications benefit from quantum randomness, name further areas in which it could be tested, and outline next steps.

Entropy•Nov 10, 2026•0 citations

A REVIEW: A BEGINNER'S JOURNEY TO THE FASCINATING WORLD OF QUANTUM COMPUTING

Subhasish Sarkar

The world of "Quantum Computing" is a fascinating, exciting and challenging one.A Quantum Computer operates based on the science of Quantum Physics.Therefore, it is inevitable that people willing to dive into the world of Quantum Computing need to have at least a very basic understanding of the concepts of Quantum Physics.The objective of this technical article is to enable people, having no knowledge of Quantum Physics, grasp the very basic concepts that enable the functioning of a Quantum Computer and thus, generating an interest in further pursuing this new field of computing technology.

International Journal of Engineering Applied Sciences and Technology•May 31, 2020•0 citations

Quantum Computing for Novice Learners: Developing the EduQubit Learning Environment

Haeun Choa, Dukhoi Koo

Abstract As quantum computing education expands into K-12 settings, learning environments that help novice learners understand abstract quantum concepts and explore quantum circuits are increasingly needed. This study developed EduQubit, a web-based quantum computing learning environment, and compared it with IBM Quantum Composer. A pretest–posttest study was conducted with 84 sixth-grade students from four intact classrooms at an elementary school in South Korea. The four classrooms were randomly assigned to the EduQubit or IBM Quantum Composer condition. EduQubit structured learning through step-by-step missions and subsequent open-ended exploration, whereas the IBM Quantum Composer condition relied on teacher guidance for the same learning tasks. The results included conceptual understanding of quantum computing, self-efficacy of quantum programming, subjective workload, and user experience; student interviews were also conducted.Student-level ANCOVA showed significantly higher posttest conceptual understanding in the EduQubit group after controlling for pretest scores (p = .036, partial η2 = .053). In contrast, quantum programming self-efficacy, subjective workload, and user experience did not differ significantly between the two groups. The exploratory classroom-level analysis showed the same directional pattern for conceptual understanding, although only four classrooms were included. Interviews indicated that both environments supported hands-on circuit exploration, but differed in how that exploration was guided and in the difficulties students encountered.These findings suggest that quantum computing learning environments for novice learners may benefit from going beyond circuit-manipulation functionality to structure learners’ exploration, with greater guidance during initial learning and progressively increasing autonomy. Given the small number of classrooms and the short intervention, the findings should be interpreted as exploratory rather than definitive evidence of the effects of the learning-environment.

•Sep 18, 2026•0 citations

AN INTRODUCTION TO QUANTUM COMPUTING ALGORITHMS

Mr. Gajendra K. Shirsale, Dr. Deepak S. Sharma, Dr. Yogita D. Patil

With the increasing accessibility of quantum computers to the wider population, there is a growing demand for the education and training of a group of quantum programmers. This cohort predominantly consists of individuals who have primarily focused on the development of classical computer programs throughout their professional careers. Although existing quantum computers currently possess fewer than 100 qubits, it is widely anticipated that the quantum computing hardware will experience significant advancements in terms of qubit quantity, quality, and connectivity. The objective of this review is to elucidate the fundamental principles of quantum programming, which diverge significantly from classical programming. This will be achieved through the utilization of concise algebraic expressions, allowing for an optional comprehension of the captivating underlying principles of quantum mechanics. This paper provides an overview of quantum computing algorithms and their practical implementation on physical quantum hardware. In this study, we undertake a comprehensive examination of various quantum algorithms, with the objective of providing concise and self-contained descriptions for each. In this study, we demonstrate the practical implementation of the aforementioned algorithms on IBM's quantum computer. For each algorithm, we thoroughly analyze and compare the outcomes obtained from the implementation on the quantum computer with those obtained from the simulator. This analysis focuses on identifying and discussing any disparities that arise between the results obtained from the simulator and the actual hardware runs. This article serves as an introduction to quantum algorithms for computer scientists, physicists, and engineers, offering a comprehensive guide for their practical implementation.

International Engineering Journal For Research & Development•Mar 8, 2024•0 citations
Quantum computers have potential to contribute to advancements in many disciplines including chemistry, material science, and artificial intelligence. As quantum computers become more accessible, there is a greater need for people to understand quantum computation to spearhead such advancements. This thesis discusses the basics of quantum computing, including fundamental concepts and a literature review. In order to demonstrate how quantum computation works, a random number generator is implemented on a quantum computer simulator and compared to a random number generator implemented on a classical computer. The results of the two experiments are compared. The results show that a quantum random number generator creates truly random numbers. This work contributes to the basic understanding of quantum computing by computer science novice learners, thus opening quantum computing to further exploration. 2
Quantum computing is a modern way of computing that is based on the science of quantum mechanics and its unbelievable phenomena. It is a beautiful combination of physics, mathematics, computer science and information theory. It provides high computational power, less energy consumption and exponential speed over classical computers by controlling the behavior of small physical objects i.e. microscopic particles like atoms, electrons, photons, etc. Here, we present an introduction to the fundamental concepts and some ideas of quantum computing. This paper starts with the origin of traditional computing and discusses all the improvements and transformations that have been done due to their limitations until now. Then it moves on to the basic working of quantum computing and the quantum properties it follows like superposition, entanglement and interference. To understand the full potentials and challenges of a practical quantum computer that can be launched commercially, the paper covers the architecture, hardware, software, design, types and algorithms that are specifically required by the quantum computers. It uncovers the capability of quantum computers that can impact our lives in various viewpoints like cyber security, traffic optimization, medicines, artificial intelligence and many more. At last, we concluded all the importance, advantages and disadvantages of quantum computers. Small-scale quantum computers are being developed recently. This development is heading towards a great future due to their high potential capabilities and advancements in ongoing research. Before focusing on the significances of a general-purpose quantum computer and exploring the power of the new arising technology, it is better to review the origin, potentials, and limitations of the existing traditional computing. This information helps us in understanding the possible challenges in developing exotic and competitive technology. It will also give us an insight into the ongoing progress in this field.
Quantum computing is necessary to be described as a powerful tool is the new generation of computational power that works based on the principles of quantum mechanics, allowing the solving of problems that are intractable for classical computers. Due to the utilization of such phenomena as superposition, quantum entanglement and quantum interference, quantum computers are said to be able to solve problems in such areas as cryptography, artificial intelligence, optimization problems and material sciences, among others. This paper attempts to examine the basic concepts of quantum computing while focusing on their different aspects and their potential impacts. This study its experience and potential in its current form and in future applications through examples, illustrations, and theoretical discussion. Specific problems, including error correction, hardware scalability, and requirements for resources to address, make the paper a comprehensive overview of the quantum computing potential and weaknesses. Moving towards practical examples, the discussion covers all aspects of the book, providing readers with a holistic understanding of how quantum computing is going to change technological paradigms in the forthcoming decades.
Random numbers are used to generate cryptographic keys, to run Monte Carlo simulations, and to train and sample machine learning models. Most software obtains them from deterministic pseudo-random number generators, which have good statistical properties but are predictable once their internal state is known. Quantum random number generators take their output from measurements on quantum systems, whose outcomes are not fixed by any prior state of the device. This article introduces the types of random number generators, reviews studies that compare quantum and pseudo-random numbers in numerical experiments, and lists the sources of randomness available in current computing systems. It then describes applications of quantum randomness in security, hashing, software, artificial intelligence, and public randomness. The quality of encryption is treated as depending on three factors: the algorithm, its implementation, and the randomness of keys and other security-relevant values. We give arguments for which applications benefit from quantum randomness, name further areas in which it could be tested, and outline next steps.
The world of "Quantum Computing" is a fascinating, exciting and challenging one.A Quantum Computer operates based on the science of Quantum Physics.Therefore, it is inevitable that people willing to dive into the world of Quantum Computing need to have at least a very basic understanding of the concepts of Quantum Physics.The objective of this technical article is to enable people, having no knowledge of Quantum Physics, grasp the very basic concepts that enable the functioning of a Quantum Computer and thus, generating an interest in further pursuing this new field of computing technology.
Abstract As quantum computing education expands into K-12 settings, learning environments that help novice learners understand abstract quantum concepts and explore quantum circuits are increasingly needed. This study developed EduQubit, a web-based quantum computing learning environment, and compared it with IBM Quantum Composer. A pretest–posttest study was conducted with 84 sixth-grade students from four intact classrooms at an elementary school in South Korea. The four classrooms were randomly assigned to the EduQubit or IBM Quantum Composer condition. EduQubit structured learning through step-by-step missions and subsequent open-ended exploration, whereas the IBM Quantum Composer condition relied on teacher guidance for the same learning tasks. The results included conceptual understanding of quantum computing, self-efficacy of quantum programming, subjective workload, and user experience; student interviews were also conducted.Student-level ANCOVA showed significantly higher posttest conceptual understanding in the EduQubit group after controlling for pretest scores (p = .036, partial η2 = .053). In contrast, quantum programming self-efficacy, subjective workload, and user experience did not differ significantly between the two groups. The exploratory classroom-level analysis showed the same directional pattern for conceptual understanding, although only four classrooms were included. Interviews indicated that both environments supported hands-on circuit exploration, but differed in how that exploration was guided and in the difficulties students encountered.These findings suggest that quantum computing learning environments for novice learners may benefit from going beyond circuit-manipulation functionality to structure learners’ exploration, with greater guidance during initial learning and progressively increasing autonomy. Given the small number of classrooms and the short intervention, the findings should be interpreted as exploratory rather than definitive evidence of the effects of the learning-environment.
With the increasing accessibility of quantum computers to the wider population, there is a growing demand for the education and training of a group of quantum programmers. This cohort predominantly consists of individuals who have primarily focused on the development of classical computer programs throughout their professional careers. Although existing quantum computers currently possess fewer than 100 qubits, it is widely anticipated that the quantum computing hardware will experience significant advancements in terms of qubit quantity, quality, and connectivity. The objective of this review is to elucidate the fundamental principles of quantum programming, which diverge significantly from classical programming. This will be achieved through the utilization of concise algebraic expressions, allowing for an optional comprehension of the captivating underlying principles of quantum mechanics. This paper provides an overview of quantum computing algorithms and their practical implementation on physical quantum hardware. In this study, we undertake a comprehensive examination of various quantum algorithms, with the objective of providing concise and self-contained descriptions for each. In this study, we demonstrate the practical implementation of the aforementioned algorithms on IBM's quantum computer. For each algorithm, we thoroughly analyze and compare the outcomes obtained from the implementation on the quantum computer with those obtained from the simulator. This analysis focuses on identifying and discussing any disparities that arise between the results obtained from the simulator and the actual hardware runs. This article serves as an introduction to quantum algorithms for computer scientists, physicists, and engineers, offering a comprehensive guide for their practical implementation.