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

Information systems engineering and management

Understanding Quantum Computing: From Qubits to Quantum Algorithms

Vikash Kumar, Ankush Joshi, Gesu Thakur, Naman Chauhan, Ritik Kumar Singh

Published Jan 1, 2025• 1 citation
Publisher
DOI
10.1007/978-3-031-99786-0_6

Related papers

Quantum Computers and Their Simulation.

Thomas Lippert

Quantum computing is based on the exploitation of quantum effects to perform some important computations more efficiently than ever possible on classical computers. Well known quantum algorithms are Shors polynomial time factoring algorithm and Grovers data base search scheme. Their potential is due to the parallelism of a quantum computation increasing exponentially with the size of the computing device. IBM has succeeded in building a first working quantum computing device with up to 7 qubits based on NMR technology, however, the construction of large multi-qubit systems appears to become extremely difficult due to the loss of coherence of the quantum states. Like the design process of modern microprocessors which is carried out by means of sophisticated software, modelling and simulation of the entire QC device is even more relevant. Simulation is required in order to understand the functioning of quantum algorithms, to construct novel quantum algorithms, to write quantum programs, to teach quantum computing, to construct real quantum computers, to understand and fight de-coherence and to understand and control the influence of the environment. Since quantum parallelism increases exponentially with the size of the quantum computer, parallel supercomputers are required for realistic simulations. I intend to give an introduction into the simulation of quantum computers using conventional computers. The simulation is based on a generic physical model of quantum computer hardware. Issues like parallel gate level simulators, modelling of QCs, simulators for physical quantum computers are addressed.

ARCS Workshops•Jan 1, 2004•0 citations

Understanding the Fundamentals of Quantum Computing

K.R. Vijayalakshmi, B.G. Deepa, Vijayalakshmi A. Lepakshi +1 more

Information systems engineering and management•Jan 1, 2025•1 citation

Subject Experiments with a Learning Support System for Grover's Algorithm

Hayato Yasunaga, Mariko Sasakura, Akito Monden

An appropriate quantum algorithm is needed for each problem to achieve the full performance of a quantum computer. It is necessary to understand the principles of quantum computation to implement quantum algorithms. Quantum computation simulators can assist in understanding the principles and behavior of quantum computation. Combining this with explanations of quantum algorithms using visualization techniques and interactions can further aid learning. In this study, to support the understanding of quantum computation, a difficult concept for beginners, we develop an interactive system in which diagrams and graphs are added to a quantum computation simulator to support the explanation and understanding of qubits and quantum algorithms. To verify the effectiveness of the interaction in supporting learning, a subject experiment is conducted to compare the amount of knowledge understood by a group of novice quantum computer students who learned using the developed system with a group who learned using paper-based materials.

International Conference on Information Visualisation (IV)•Jul 25, 2023•0 citations

Introduction to Quantum Computing

Ray LaPierre

The Materials Research Society series•Jan 1, 2021•34 citations

Evolutionary Computation in Coded Communications: an Implementation of Viterbi Algorithm

Jamal S., Dia I., Mohammed Haw

Quantum Computing hopefully is the future of computing systems. It still on its first steps. The development of some quantum algorithms gives the quantum computing a boost on its importance. These algorithms (such as Shor’s and Grover’s algorithms) proved to have superior performance over classical algorithms [1-4]. The recent findings, that quantum error correction can be used, showed that the decoherence problem can be solved and hence the quantum computers can be realized [5-7]. The quantum algorithms are based on the use of special gates applied on one, two or more qubits (quantum bits). The classical computer uses different gates (NOT, AND, NAND, OR and XOR). Quantum gates are in many aspects different from classical gates where all gates must be reversible. This makes the quantum gates act as 2x2 transformation operators, where we have n input qubits and n output qubits. To understand the quantum bits and gates we describe the group of amplitudes that describes the state of a quantum register as a vector. A qubit with state 0 , which is

InTech eBooks•Oct 1, 2009•1 citation

An Introduction to Quantum Computing

Noson S. Yanofsky

Springer eBooks•Jan 1, 2011•18 citations
Quantum computing is based on the exploitation of quantum effects to perform some important computations more efficiently than ever possible on classical computers. Well known quantum algorithms are Shors polynomial time factoring algorithm and Grovers data base search scheme. Their potential is due to the parallelism of a quantum computation increasing exponentially with the size of the computing device. IBM has succeeded in building a first working quantum computing device with up to 7 qubits based on NMR technology, however, the construction of large multi-qubit systems appears to become extremely difficult due to the loss of coherence of the quantum states. Like the design process of modern microprocessors which is carried out by means of sophisticated software, modelling and simulation of the entire QC device is even more relevant. Simulation is required in order to understand the functioning of quantum algorithms, to construct novel quantum algorithms, to write quantum programs, to teach quantum computing, to construct real quantum computers, to understand and fight de-coherence and to understand and control the influence of the environment. Since quantum parallelism increases exponentially with the size of the quantum computer, parallel supercomputers are required for realistic simulations. I intend to give an introduction into the simulation of quantum computers using conventional computers. The simulation is based on a generic physical model of quantum computer hardware. Issues like parallel gate level simulators, modelling of QCs, simulators for physical quantum computers are addressed.
An appropriate quantum algorithm is needed for each problem to achieve the full performance of a quantum computer. It is necessary to understand the principles of quantum computation to implement quantum algorithms. Quantum computation simulators can assist in understanding the principles and behavior of quantum computation. Combining this with explanations of quantum algorithms using visualization techniques and interactions can further aid learning. In this study, to support the understanding of quantum computation, a difficult concept for beginners, we develop an interactive system in which diagrams and graphs are added to a quantum computation simulator to support the explanation and understanding of qubits and quantum algorithms. To verify the effectiveness of the interaction in supporting learning, a subject experiment is conducted to compare the amount of knowledge understood by a group of novice quantum computer students who learned using the developed system with a group who learned using paper-based materials.
Quantum Computing hopefully is the future of computing systems. It still on its first steps. The development of some quantum algorithms gives the quantum computing a boost on its importance. These algorithms (such as Shor’s and Grover’s algorithms) proved to have superior performance over classical algorithms [1-4]. The recent findings, that quantum error correction can be used, showed that the decoherence problem can be solved and hence the quantum computers can be realized [5-7]. The quantum algorithms are based on the use of special gates applied on one, two or more qubits (quantum bits). The classical computer uses different gates (NOT, AND, NAND, OR and XOR). Quantum gates are in many aspects different from classical gates where all gates must be reversible. This makes the quantum gates act as 2x2 transformation operators, where we have n input qubits and n output qubits. To understand the quantum bits and gates we describe the group of amplitudes that describes the state of a quantum register as a vector. A qubit with state 0 , which is