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 Symposium on Electronic System Design

Design of an Efficient Quantum Circuit Simulator

S Maity, A Pal, Tushar Kanti Roy, Sudhindu Bikash Mandal, Amlan Chakrabarti

Published Dec 1, 2010• 3 citations
Publisher

Abstract

Work is in progress throughout the globe to efficiently use the potential of the quantum theory of computation over their classical counterpart and hence there is a need of building quantum computing hardware. The target of building quantum computers can be achieved if we have better tools for the design of quantum hardware. Quantum circuit simulators are tools for the logic verification of quantum circuits and they can be an essential component of quantum CAD tools in the future. This work is the extension of the previous work by the authors, in order to increase the efficiency of the simulator and to incorporate more components in the gate library. In this paper we have proposed an efficient simulator which can simulate a quantum circuit specified using the proposed quantum hardware descriptive language (QHDL).

DOI
10.1109/ised.2010.18

Related papers

Using HDLs for describing quantum circuits: a framework for efficient quantum algorithm simulation

Mihai Udrescu, Lucian Prodan, Mircea Vlăduţiu

The quantum algorithms could efficiently solve problems having exponential classical solutions [8]. The circuit model is considered as the most feasible implementation of the quantum algorithms [17]. This paper tries to find common ground between classical circuit design techniques and quantum computation, by identifying quantum circuit specification and simulation tools under the form of Hardware Description Languages (HDLs). The HDL-based simulation approach could reduce the complexity of quantum circuit simulation, by considering entanglement as the main source of gate-level simulation complexity, and isolating it in an automated manner. This is possible by taking advantage of the HDL feature of describing a circuit with both structural and functional architectures. We also performed an analysis of our methodology effectiveness, for the arithmetic circuits involved in Shor's algorithm and the circuits implementing Grover's algorithm. Our method is further improved by an entangled representation avoidance technique called 'bubble logic insertion'.

ACM International Conference on Computing Frontiers (CF)•Apr 14, 2004•24 citations

HybridQ: A Hybrid Simulator for Quantum Circuits

Salvatore Mandrà, Jeffrey Marshall, Eleanor Gilbert Rieffel +1 more

Developing state-of-the-art classical simulators of quantum circuits is of utmost importance to test and evaluate early quantum technology and understand the true potential of full-blown error-corrected quantum computers. In the past few years, multiple theoretical and numerical advances have continuously pushed the boundary of what is classically simulable, hence the development of a plethora of tools which are often limited to a specific purpose or designed for a particular hardware (e.g. CPUs vs. GPUs). Moreover, such tools are typically developed using tailored languages and syntax, which makes it hard to compare results from, and create hybrid approaches using, different simulation techniques. To support unified and optimized use of these techniques across platforms, we developed HybridQ , a highly extensible platform designed to provide a common framework to integrate multiple state-of-the-art techniques to run on a variety of hardware. The philosophy behind its development has been driven by three main pillars: Easy to Use, Easy to Extend, and Use the Best Available Technology. The powerful tools of HybridQ allow users to manipulate, develop, and extend noiseless and noisy circuits for different hardware architectures. HybridQ supports large-scale high-performance computing (HPC) simulations, automatically balancing workload among different processor nodes and enabling the use of multiple backends to maximize parallel efficiency. Everything is then glued together by a simple and expressive language that allows seamless switching from one technique to another as well as from one hardware to the next, without the need to write lengthy translations, thus greatly simplifying the development of new hybrid algorithms and techniques.

arXiv:2111.06868•IEEE/ACM International Workshop on Quantum Computing Software (QCS)•Nov 1, 2021•15 citations

Gate-Level Simulation of Quantum Circuits

George F. Viamontes, Manoj Rajagopalan, Igor L. Markov +1 more

While thousands of experimental physicists and chemists are currently trying to build scalable quantum computers, it appears that simulation of quantum computation will be at least as critical as circuit simulation in classical VLSI design. However, since the work of Richard Feynman in the early 1980s little progress was made in practical quantum simulation. Most researchers focused on polynomial-time simulation of restricted types of quantum circuits that fall short of the full power of quantum computation. Simulating quantum computing devices and useful quantum algorithms on classical hardware now requires excessive computational resources, making many important simulation tasks infeasible. In this work we propose a new technique for gate-level simulation of quantum circuits which greatly reduces the difficulty and cost of such simulations. The proposed technique is implemented in a simulation tool called the Quantum Information Decision Diagram (QuIDD) and evaluated by simulating Grover's quantum search algorithm. The back-end of our package, QuIDD Pro, is based on Binary Decision Diagrams, well-known for their ability to efficiently represent many seemingly intractable combinatorial structures. This reliance on a well-established area of research allows us to take advantage of existing software for BDD manipulation and achieve unparalleled empirical results for quantum simulation.

arXiv:quant-ph/0208003•Aug 1, 2002•6 citations

ZENO: a new graphical tool for design and simulation of quantum circuits

Gustavo Eulalio M. Cabral, Bernardo Lula, Aércio Ferreira de Lima

Current technology for building digital computers is predicted to reach its limit within the next 10 years due to the increasing miniaturization of digital components. By reaching sizes of a few nanometers, electrons stop behaving as particles and start behaving as waves, obeying essentially the principles of Quantum Mechanics, and effects such as interference, superposition and entanglement become dominant. The utilization of those effects allows more that just an evolution of the miniaturization process. It allows for a computational parallelism impossible to be obtained efficiently through classical computational methods or devices. Several algorithms utilizing such effects have been proposed and indicated that Quantum Computation is significantly more efficient at solving certain class of problems than classical computation. Actually, there is not yet any hardware (a quantum computer) able to compute a useful algorithm outside of research labs. A turn-around to that problem is to simulate the behavior of a quantum computer by a classical computer. There are, to this day, a number of quantum computer simulators available which, in general, use the quantum circuit model defined by Deutsch. Just a few of them are universal. We have developed a novel universal quantum circuit simulator, called Zeno, to the design and test of quantum algorithms. Zeno offers a set of features that engulfs most of the features presented by the other existing universal quantum circuit simulators and that also allows it to be used in the design and simulation of quantum channels.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 25, 2005•1 citation

Quantum Circuit Verification - A Potential Roadmap (Invited Talk)

Abdulla, Parosh Aziz, Chen, Yu-Fang, Hečko, Michal +4 more

Quantum technologies are progressing at an extraordinary pace and are poised to transform numerous sectors both nationally and globally. Among them, quantum computing stands out for its potential to revolutionize areas such as cryptography, optimization, and the simulation of quantum systems, offering dramatic speed-ups for specific classes of problems. As quantum devices evolve and become increasingly pervasive, guaranteeing their correctness is of paramount importance. This necessitates the development of rigorous methods and tools to analyze and verify their behavior. However, the construction of such verification frameworks presents fundamental challenges. Quantum phenomena such as superposition and entanglement give rise to computational behaviors that differ profoundly from those of classical systems, leading to inherently probabilistic models and exponentially large state spaces, even for relatively small programs. Addressing these challenges requires building on the extensive expertise of the formal methods community in classical program verification, while incorporating recent advances and collaborative efforts in quantum systems. An interesting challenge for the verification community is to design and implement novel verification frameworks that transfer the key strengths of classical verification, such as expressive specification, precise error detection, automation, and scalability, to the quantum domain. We expect that the results of this research will play a crucial role in enabling the dependable deployment of quantum technologies across a wide range of future applications.

Leibniz international proceedings in informatics•Jan 1, 2025•0 citations

A Computer Aided Design Tool for NISQ Logic Synthesis

Albert B. Dinkins V, Austin Bristow, Kwang‐Cheng Chen

Computed Aided Design (CAD) is essential to synthesize noisy intermediate scale quantum (NISQ) information and communication systems. The prevailing model for NISQ systems is gate-based and uses logical components arranged into a circuit to represent different quantum operations. A CAD Tool for Quantum Logic is proposed to synthesize gate-based NISQ circuits for computing, communication, or sensing by supplying designers with parameterized versions of common quantum algorithms as well as a design space for simulating photonics hardware implementations. Available in a software package called the CADTQL, designers can test their conventional and optical quantum logic configurations and realize more efficient designs.

International Symposium on Wireless Personal Multimedia Communications (WPMC)•Nov 19, 2023•3 citations
Work is in progress throughout the globe to efficiently use the potential of the quantum theory of computation over their classical counterpart and hence there is a need of building quantum computing hardware. The target of building quantum computers can be achieved if we have better tools for the design of quantum hardware. Quantum circuit simulators are tools for the logic verification of quantum circuits and they can be an essential component of quantum CAD tools in the future. This work is the extension of the previous work by the authors, in order to increase the efficiency of the simulator and to incorporate more components in the gate library. In this paper we have proposed an efficient simulator which can simulate a quantum circuit specified using the proposed quantum hardware descriptive language (QHDL).
The quantum algorithms could efficiently solve problems having exponential classical solutions [8]. The circuit model is considered as the most feasible implementation of the quantum algorithms [17]. This paper tries to find common ground between classical circuit design techniques and quantum computation, by identifying quantum circuit specification and simulation tools under the form of Hardware Description Languages (HDLs). The HDL-based simulation approach could reduce the complexity of quantum circuit simulation, by considering entanglement as the main source of gate-level simulation complexity, and isolating it in an automated manner. This is possible by taking advantage of the HDL feature of describing a circuit with both structural and functional architectures. We also performed an analysis of our methodology effectiveness, for the arithmetic circuits involved in Shor's algorithm and the circuits implementing Grover's algorithm. Our method is further improved by an entangled representation avoidance technique called 'bubble logic insertion'.
Developing state-of-the-art classical simulators of quantum circuits is of utmost importance to test and evaluate early quantum technology and understand the true potential of full-blown error-corrected quantum computers. In the past few years, multiple theoretical and numerical advances have continuously pushed the boundary of what is classically simulable, hence the development of a plethora of tools which are often limited to a specific purpose or designed for a particular hardware (e.g. CPUs vs. GPUs). Moreover, such tools are typically developed using tailored languages and syntax, which makes it hard to compare results from, and create hybrid approaches using, different simulation techniques. To support unified and optimized use of these techniques across platforms, we developed HybridQ , a highly extensible platform designed to provide a common framework to integrate multiple state-of-the-art techniques to run on a variety of hardware. The philosophy behind its development has been driven by three main pillars: Easy to Use, Easy to Extend, and Use the Best Available Technology. The powerful tools of HybridQ allow users to manipulate, develop, and extend noiseless and noisy circuits for different hardware architectures. HybridQ supports large-scale high-performance computing (HPC) simulations, automatically balancing workload among different processor nodes and enabling the use of multiple backends to maximize parallel efficiency. Everything is then glued together by a simple and expressive language that allows seamless switching from one technique to another as well as from one hardware to the next, without the need to write lengthy translations, thus greatly simplifying the development of new hybrid algorithms and techniques.
While thousands of experimental physicists and chemists are currently trying to build scalable quantum computers, it appears that simulation of quantum computation will be at least as critical as circuit simulation in classical VLSI design. However, since the work of Richard Feynman in the early 1980s little progress was made in practical quantum simulation. Most researchers focused on polynomial-time simulation of restricted types of quantum circuits that fall short of the full power of quantum computation. Simulating quantum computing devices and useful quantum algorithms on classical hardware now requires excessive computational resources, making many important simulation tasks infeasible. In this work we propose a new technique for gate-level simulation of quantum circuits which greatly reduces the difficulty and cost of such simulations. The proposed technique is implemented in a simulation tool called the Quantum Information Decision Diagram (QuIDD) and evaluated by simulating Grover's quantum search algorithm. The back-end of our package, QuIDD Pro, is based on Binary Decision Diagrams, well-known for their ability to efficiently represent many seemingly intractable combinatorial structures. This reliance on a well-established area of research allows us to take advantage of existing software for BDD manipulation and achieve unparalleled empirical results for quantum simulation.
Current technology for building digital computers is predicted to reach its limit within the next 10 years due to the increasing miniaturization of digital components. By reaching sizes of a few nanometers, electrons stop behaving as particles and start behaving as waves, obeying essentially the principles of Quantum Mechanics, and effects such as interference, superposition and entanglement become dominant. The utilization of those effects allows more that just an evolution of the miniaturization process. It allows for a computational parallelism impossible to be obtained efficiently through classical computational methods or devices. Several algorithms utilizing such effects have been proposed and indicated that Quantum Computation is significantly more efficient at solving certain class of problems than classical computation. Actually, there is not yet any hardware (a quantum computer) able to compute a useful algorithm outside of research labs. A turn-around to that problem is to simulate the behavior of a quantum computer by a classical computer. There are, to this day, a number of quantum computer simulators available which, in general, use the quantum circuit model defined by Deutsch. Just a few of them are universal. We have developed a novel universal quantum circuit simulator, called Zeno, to the design and test of quantum algorithms. Zeno offers a set of features that engulfs most of the features presented by the other existing universal quantum circuit simulators and that also allows it to be used in the design and simulation of quantum channels.
Quantum technologies are progressing at an extraordinary pace and are poised to transform numerous sectors both nationally and globally. Among them, quantum computing stands out for its potential to revolutionize areas such as cryptography, optimization, and the simulation of quantum systems, offering dramatic speed-ups for specific classes of problems. As quantum devices evolve and become increasingly pervasive, guaranteeing their correctness is of paramount importance. This necessitates the development of rigorous methods and tools to analyze and verify their behavior. However, the construction of such verification frameworks presents fundamental challenges. Quantum phenomena such as superposition and entanglement give rise to computational behaviors that differ profoundly from those of classical systems, leading to inherently probabilistic models and exponentially large state spaces, even for relatively small programs. Addressing these challenges requires building on the extensive expertise of the formal methods community in classical program verification, while incorporating recent advances and collaborative efforts in quantum systems. An interesting challenge for the verification community is to design and implement novel verification frameworks that transfer the key strengths of classical verification, such as expressive specification, precise error detection, automation, and scalability, to the quantum domain. We expect that the results of this research will play a crucial role in enabling the dependable deployment of quantum technologies across a wide range of future applications.
Computed Aided Design (CAD) is essential to synthesize noisy intermediate scale quantum (NISQ) information and communication systems. The prevailing model for NISQ systems is gate-based and uses logical components arranged into a circuit to represent different quantum operations. A CAD Tool for Quantum Logic is proposed to synthesize gate-based NISQ circuits for computing, communication, or sensing by supplying designers with parameterized versions of common quantum algorithms as well as a design space for simulating photonics hardware implementations. Available in a software package called the CADTQL, designers can test their conventional and optical quantum logic configurations and realize more efficient designs.