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

International Conference on Machine Learning and Cybernetics

Simulating quantum computing: Quantum eXpress

Kareem S. Aggour, Renee Guhde, M.K. Sommins, M.J. Simon

Published May 13, 2004• 5 citations
Publisher

Abstract

Quantum computing (QC) research has gained a lot of momentum recently due to several theoretical analyses that indicate that QC is significantly more efficient at solving certain classes of problems than classical computing. While experimental validation will ultimately be required, the primitive nature of current QC hardware leaves practical testing limited to trivial examples. Thus, a robust simulator is needed to study complex QC issues. Most QC simulators model ideal operations, and thus cannot predict the actual time required to execute an algorithm or quantify the effects of errors in the calculation. We have developed a novel QC simulator that models physical hardware implementations. This simulator not only allows the accurate simulation of quantum algorithms on various hardware implementations, but also takes an important step towards providing a framework to determine their true performance and vulnerability to errors.

DOI
10.1109/wsc.2003.1261513

Related papers

Simulation and verification II: simulating quantum computing: quantum express

Kareem S. Aggour, Renee Guhde, Melvin K. Simmons +1 more

Quantum Computing (QC) research has gained a lot of momentum recently due to several theoretical analyses that indicate that QC is significantly more efficient at solving certain classes of problems than classical computing. While experimental validation will ultimately be required, the primitive nature of current QC hardware leaves practical testing limited to trivial examples. Thus, a robust simulator is needed to study complex QC issues. Most QC simulators model ideal operations, and thus cannot predict the actual time required to execute an algorithm or quantify the effects of errors in the calculation. We have developed a novel QC simulator that models physical hardware implementations. This simulator not only allows the accurate simulation of quantum algorithms on various hardware implementations, but also takes an important step towards providing a framework to determine their true performance and vulnerability to errors.

Winter Simulation Conference•Dec 7, 2003•0 citations

Quantum Computing Simulation

Manju S Nair, Jobin Johnson, Kiran Babu +1 more

Quantum computing is one of the emerging technologies with its immense capability, allowing us to solve computationally challenging problems more efficiently. Gaining a real quantum computer for running and testing algorithms is very costly. In order for developers and researchers to build and test algorithms, they can use simulators that can model the behaviour of a real quantum computer inside a classical computer. Simulating a quantum system on a classical machine is complex and requires a lot of processing power. This paper introduces some basic algorithms and methodologies we used to simulate an ideal multi-qubit simulator in classical terms

International Journal of Advanced Research in Science Communication and Technology•Jul 30, 2023•0 citations

Efficient quantum computing simulation through dynamic matrix restructuring and distributed evaluation

Kareem S. Aggour, Robert M. Mattheyses, Joseph Shultz

Quantum computing has the potential to revolutionize the field of computing, but with hardware and algorithms unlike any in use today. Due to the primitive state of existing quantum hardware, simulation is one of the most effective methods for studying quantum computing issues. Our team previously developed a general-purpose simulator capable of modeling arbitrary quantum algorithms executing on any hardware device. The simulator performs over a thousand matrix multiplications per step as part of its operations. To improve the simulator performance, optimizations were designed to dynamically restructure the problem. The resulting calculations were then distributed across a cluster. These enhancements reduced both the order of the simulator operations and the memory overhead, achieving an overall performance improvement of 99.94% from the initial implementation of a key quantum algorithm, reducing the simulator run time for this algorithm from two days on a single processor to under two minutes on a cluster.

IEEE International Conference on Cluster Computing (CLUSTER)•Jan 1, 2007•2 citations

Research of Quantum Neural Networks and Development of a Single-qubit Model of Neuron

Sergey M. Gushanskiy, Viktor Potapov, Alexey Samoylov

Recently, there has been a rapid increase interest in quantum computers. Their work is based on the use of quantum-mechanical phenomena such as superposition and entanglement for computing to transform input data into outputs, which can actually provide effective performance 3-4 orders of magnitude higher than any modern computing devices. In the past few decades, there has been an acute problem of creating a quantum computer that uses quantum mechanical effects for computations. Currently, there are prototypes of devices of this class, but it is not yet possible to achieve an effective solution to the planned tasks with their help due to a number of difficulties in implementation. However, there is a mathematical apparatus that describes the behavior of quantum particles using a wave function. Hence, it becomes possible to simulate quantum computations on the classical architecture and check the reliability of algorithms belonging to the NP class, which are theoretically executed on a quantum computer in polynomial time and which cannot be solved on classical computers within an acceptable time frame. Effectively simulate the operation of a quantum system on devices with classical architecture is impossible, it remains to propose methods for acceleration of quantum computing on classical systems.

Panhellenic Conference on Informatics•Nov 26, 2021•1 citation

Implementation and Performance Analysis of the Deutsch–Jozsa Quantum Algorithm Using Qiskit

Dr CH Pavan Satish, M.Anvesh, K.Bhavana +2 more

The quantum computing is a giant leap forward in comparison with our common computer models as it allows us to solve some problems with a much smaller number of steps. In this paper, we will demonstrate the design, development, and testing of the DeutschJozsa quantum algorithm using Qiskit. The algorithm can determine whether a Boolean function is identical or evenly divides with a single special query where traditional algorithms may require as many as 2n -1 +1 checks in the worst-case. We simulated the algorithm on an ideal simulator (Qiskit Aer) and IBM Quantum real hardware. Three aspects that we examined were the measurement accuracy, the depth of the quantum circuit, and how the noise of the real world, including decoherence and gate errors as well as readout errors, would influence the outcome of the NISQ devices. The simulator has nearly excellent precision, whereas the actual hardware has some visible disparities due to noise. These findings verify a undeniable quantum efficiency in query complexity and the cost decreases to a constant cost of O(1) quantum versus an exponential cost of O(2n) using a classical computer. Altogether, this paper is an example of quantum parallelism and quantum interference in a practical sense and serves as a good reference point to the capabilities of the current quantum hardware.

International Journal of Engineering Research and Science & Technology•Mar 22, 2026•0 citations

A Novel Approach for Quantum Simulation Software Framework

Ki‐Sung Jin, Jinho On, Gyu‐Il Cha

Rapid advances in quantum computing lead to an increasing requirement for digital quantum simulators that enable both quantum algorithm design and the verification of results obtained from quantum hardware. We introduce a new quantum simulator framework for computationally simulating the evolution of quantum states. The proposed framework ensures quantum circuit execution in a lightweight, scalable, and fast manner compared to traditional simulators. This feature enables an optimized environment for various quantum circuit simulations and, in particular, offers a great advantage in the efficient execution of specific large-scale quantum circuits. In this study, we present comparisons of the proposed idea with conventional simulators through both analytical and experimental approaches.

International Conference on Consumer Electronics•Jan 11, 2025•0 citations
Quantum computing (QC) research has gained a lot of momentum recently due to several theoretical analyses that indicate that QC is significantly more efficient at solving certain classes of problems than classical computing. While experimental validation will ultimately be required, the primitive nature of current QC hardware leaves practical testing limited to trivial examples. Thus, a robust simulator is needed to study complex QC issues. Most QC simulators model ideal operations, and thus cannot predict the actual time required to execute an algorithm or quantify the effects of errors in the calculation. We have developed a novel QC simulator that models physical hardware implementations. This simulator not only allows the accurate simulation of quantum algorithms on various hardware implementations, but also takes an important step towards providing a framework to determine their true performance and vulnerability to errors.
Quantum Computing (QC) research has gained a lot of momentum recently due to several theoretical analyses that indicate that QC is significantly more efficient at solving certain classes of problems than classical computing. While experimental validation will ultimately be required, the primitive nature of current QC hardware leaves practical testing limited to trivial examples. Thus, a robust simulator is needed to study complex QC issues. Most QC simulators model ideal operations, and thus cannot predict the actual time required to execute an algorithm or quantify the effects of errors in the calculation. We have developed a novel QC simulator that models physical hardware implementations. This simulator not only allows the accurate simulation of quantum algorithms on various hardware implementations, but also takes an important step towards providing a framework to determine their true performance and vulnerability to errors.
Quantum computing is one of the emerging technologies with its immense capability, allowing us to solve computationally challenging problems more efficiently. Gaining a real quantum computer for running and testing algorithms is very costly. In order for developers and researchers to build and test algorithms, they can use simulators that can model the behaviour of a real quantum computer inside a classical computer. Simulating a quantum system on a classical machine is complex and requires a lot of processing power. This paper introduces some basic algorithms and methodologies we used to simulate an ideal multi-qubit simulator in classical terms
Quantum computing has the potential to revolutionize the field of computing, but with hardware and algorithms unlike any in use today. Due to the primitive state of existing quantum hardware, simulation is one of the most effective methods for studying quantum computing issues. Our team previously developed a general-purpose simulator capable of modeling arbitrary quantum algorithms executing on any hardware device. The simulator performs over a thousand matrix multiplications per step as part of its operations. To improve the simulator performance, optimizations were designed to dynamically restructure the problem. The resulting calculations were then distributed across a cluster. These enhancements reduced both the order of the simulator operations and the memory overhead, achieving an overall performance improvement of 99.94% from the initial implementation of a key quantum algorithm, reducing the simulator run time for this algorithm from two days on a single processor to under two minutes on a cluster.
Recently, there has been a rapid increase interest in quantum computers. Their work is based on the use of quantum-mechanical phenomena such as superposition and entanglement for computing to transform input data into outputs, which can actually provide effective performance 3-4 orders of magnitude higher than any modern computing devices. In the past few decades, there has been an acute problem of creating a quantum computer that uses quantum mechanical effects for computations. Currently, there are prototypes of devices of this class, but it is not yet possible to achieve an effective solution to the planned tasks with their help due to a number of difficulties in implementation. However, there is a mathematical apparatus that describes the behavior of quantum particles using a wave function. Hence, it becomes possible to simulate quantum computations on the classical architecture and check the reliability of algorithms belonging to the NP class, which are theoretically executed on a quantum computer in polynomial time and which cannot be solved on classical computers within an acceptable time frame. Effectively simulate the operation of a quantum system on devices with classical architecture is impossible, it remains to propose methods for acceleration of quantum computing on classical systems.
The quantum computing is a giant leap forward in comparison with our common computer models as it allows us to solve some problems with a much smaller number of steps. In this paper, we will demonstrate the design, development, and testing of the DeutschJozsa quantum algorithm using Qiskit. The algorithm can determine whether a Boolean function is identical or evenly divides with a single special query where traditional algorithms may require as many as 2n -1 +1 checks in the worst-case. We simulated the algorithm on an ideal simulator (Qiskit Aer) and IBM Quantum real hardware. Three aspects that we examined were the measurement accuracy, the depth of the quantum circuit, and how the noise of the real world, including decoherence and gate errors as well as readout errors, would influence the outcome of the NISQ devices. The simulator has nearly excellent precision, whereas the actual hardware has some visible disparities due to noise. These findings verify a undeniable quantum efficiency in query complexity and the cost decreases to a constant cost of O(1) quantum versus an exponential cost of O(2n) using a classical computer. Altogether, this paper is an example of quantum parallelism and quantum interference in a practical sense and serves as a good reference point to the capabilities of the current quantum hardware.
Rapid advances in quantum computing lead to an increasing requirement for digital quantum simulators that enable both quantum algorithm design and the verification of results obtained from quantum hardware. We introduce a new quantum simulator framework for computationally simulating the evolution of quantum states. The proposed framework ensures quantum circuit execution in a lightweight, scalable, and fast manner compared to traditional simulators. This feature enables an optimized environment for various quantum circuit simulations and, in particular, offers a great advantage in the efficient execution of specific large-scale quantum circuits. In this study, we present comparisons of the proposed idea with conventional simulators through both analytical and experimental approaches.