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

arXiv:1412.4704 · PLoS ONE

Quantum++: A modern C++ quantum computing library

Vlad Gheorghiu

Published Dec 10, 2018• 68 citations
arXivHTMLPDF

Abstract

Quantum++ is a modern general-purpose multi-threaded quantum computing library written in C++11 and composed solely of header files. The library is not restricted to qubit systems or specific quantum information processing tasks, being capable of simulating arbitrary quantum processes. The main design factors taken in consideration were the ease of use, portability, and performance. The library's simulation capabilities are only restricted by the amount of available physical memory. On a typical machine (Intel i5 8Gb RAM) Quantum++ can successfully simulate the evolution of 25 qubits in a pure state or of 12 qubits in a mixed state reasonably fast. The library also includes support for classical reversible logic, being able to simulate classical reversible operations on billions of bits. This latter feature may be useful in testing quantum circuits composed solely of Toffoli gates, such as certain arithmetic circuits.

DOI
10.1371/journal.pone.0208073

Related papers

Quantum++ - A C++11 quantum computing library

Vlad Gheorghiu

Quantum++ is a modern general-purpose multi-threaded quantum computing library and simulator written in C++11 and composed solely of header files. The library is not restricted to qubit systems or specific quantum information processing tasks, being capable of simulating arbitrary quantum processes. The main design factors taken in consideration were the ease of use, portability, and performance.

•Dec 15, 2014•6 citations

Design and Implementation of a Quantum Reversible Full Adder-Subtractor

Indra J, Siva Prasanna E, Sushma V.R

Arithmetic units are the computational cores of any processor, and among them, the full adder-subtractor circuit can be regarded as the most fundamental, as it can support the entire spectrum of computation, ranging from integer arithmetic to filtering and cryptographic functions. In the context of quantum computing, these units must be implemented using reversible logic gates that preserve the information processed, as any loss of information violates the principles of the unitary dynamics of quantum mechanics and the thermodynamic principle of bit erasure. In the context of the full adder-subtractor circuit, the previous implementations had three main drawbacks, namely, the use of multiple ancilla input qubits, the generation of garbage qubits, and the use of non-native gates. In this paper, a novel implementation of the reversible full adder-subtractor circuit using the IBM Quantum Composer tool, with the support of only the native gates of the IBM Quantum device, namely, the Hadamard, the Controlled-NOT, and the Toffoli gates, is proposed. The proposed circuit works with six qubits and thirteen gates, with a quantum cost of 13, zero ancilla inputs, and zero garbage outputs simultaneously. The circuit uses only one mode select qubit (M) for operation. When M is 0, the circuit works for full addition with Sum and Carry-out. When M is 1, the circuit works for full subtraction with Difference and Borrow-out through a two's complement B-inversion method. The circuit is simulated using the IBM Quantum composer Simulator with 1024 shots. The Hadamard-based superposition method is used to test all eight input combinations simultaneously in a single run.

International Conference Inventive Material Science Applications•May 1, 2026•0 citations

Quantum Computing Tools: An Overview

Augustine Chidiebere Onuora, Prince Ana, Anthony Obogo Otiko +1 more

A significant new frontier in computing has been opened up by the emergence of the quantum computing paradigm in recent years. By utilising the special abilities of quantum bits, or qubits, to complete complicated calculations tenfold quicker than with traditional computers, quantum computing has the potential to completely transform the computing industry. As this nascent field advances, the need for accessible and versatile quantum computing tools becomes increasingly evident. This research highlights the evolving landscape of quantum computing tools, emphasizing their critical role in the development and application of quantum algorithms and technologies. These tools encompass a spectrum of software and hardware components that aid researchers, engineers, and developers in utilising quantum computing's potential.

•Nov 1, 2023•0 citations

Optimal Design of Reversible Circuits in the Strict NCT Library

GEORGE PAPAKONSTANTINOU

The synthesis of reversible logic circuits is a fundamental step in the design of fault-tolerant quantum arithmetic. Existing literature frequently minimizes Quantum Cost (QC) by utilizing the NCV library, which permits controlled-V and Vdagger gates. However, in the context of Fault-Tolerant Quantum Computing (FTQC), the strict NCT library (NOT, CNOT, Toffoli) is often preferred due to the high cost of distilling non-Clifford states required for arbitrary V-gates. Moreover, in the classical design of reversible circuits, only the NCT library can be used as V-gates are not available. In this paper, a new design method for reversible circuits is proposed, based on Mixed-Integer Non-Linear Programming (MINLP) within the Strict NCT Library. By formulating the problem as an MINLP model in GAMS, we successfully automated the optimization of five prominent reversible primitives (TSG, MKG, MIG, SAYEM, and URG) within the strict NCT library. Comparative analysis with the NCV costs found in the literature shows that the costs within the NCT library are comparable or better.

•Jan 13, 2026•0 citations

Quantum computing in Fortran

Adriaan Albert Markus

Quantum computing is the delicate art of using a quantum-mechanical system to perform some kind of computation. Such a system differs in a number of significant ways from ordinary computers:• A quantum computer actually does a lot of computations at the same time, each solution is represented by a particular possible state. This is inherent to the physical properties of such a system.• Unless you are sure that you have reached the final (unique) solution, you can not "look" at the "values" of the variables in the computer program that is being run: since all solutions are possible at the same time, observing the values will influence the system and put it into one particular, but otherwise arbitrary, state.• All computations must be reversible, that is, a statement like "a = 5" can only appear in the initialization phase of a program, because the previous value will be lost. On the other hand, a statement like "a = a + 5" is reversible, since you can retrieve the original value.The properties of such a quantum computer make it possible to devise very efficient algorithms. One such algorithm, described by L. Grover (see the references), is searching in an unsorted array of items. With ordinary computers this can not be done more efficiently than in O (N) steps (an exhaustive search: each item is examined in the worst case), with this quantum algorithm, however, the number of steps needed is O (N 1/2 ).Devising quantum algorithms requires a thorough understanding of quantum mechanics, there is no doubt about that. Another question is: do we need quantum computers and special programming languages to program (or perhaps emulate) these algorithms? This article tries to show that, at least for the quantum search algorithm, a classical programming language like Fortran is quite fit (yes, the pun is fortunate).

ACM SIGPLAN Fortran Forum•Aug 1, 2004•2 citations

Optimal Design of Reversible Circuits in the Strict NCT Library

GEORGE PAPAKONSTANTINOU

The synthesis of reversible logic circuits is a fundamental step in the design of fault-tolerant quantum arithmetic. Existing literature frequently minimizes Quantum Cost (QC) by utilizing the NCV library, which permits controlled-V and Vdagger gates. However, in the context of Fault-Tolerant Quantum Computing (FTQC), the strict NCT library (NOT, CNOT, Toffoli) is often preferred due to the high cost of distilling non-Clifford states required for arbitrary V-gates. Moreover, in the classical design of reversible circuits, only the NCT library can be used as V-gates are not available. In this paper, a new design method for reversible circuits is proposed, based on Mixed-Integer Non-Linear Programming (MINLP) within the Strict NCT Library. By formulating the problem as an MINLP model in GAMS, we successfully automated the optimization of five prominent reversible primitives (TSG, MKG, MIG, SAYEM, and URG) within the strict NCT library. Comparative analysis with the NCV costs found in the literature shows that the costs within the NCT library are comparable or better.

•Feb 16, 2026•3 citations
Quantum++ is a modern general-purpose multi-threaded quantum computing library written in C++11 and composed solely of header files. The library is not restricted to qubit systems or specific quantum information processing tasks, being capable of simulating arbitrary quantum processes. The main design factors taken in consideration were the ease of use, portability, and performance. The library's simulation capabilities are only restricted by the amount of available physical memory. On a typical machine (Intel i5 8Gb RAM) Quantum++ can successfully simulate the evolution of 25 qubits in a pure state or of 12 qubits in a mixed state reasonably fast. The library also includes support for classical reversible logic, being able to simulate classical reversible operations on billions of bits. This latter feature may be useful in testing quantum circuits composed solely of Toffoli gates, such as certain arithmetic circuits.
Arithmetic units are the computational cores of any processor, and among them, the full adder-subtractor circuit can be regarded as the most fundamental, as it can support the entire spectrum of computation, ranging from integer arithmetic to filtering and cryptographic functions. In the context of quantum computing, these units must be implemented using reversible logic gates that preserve the information processed, as any loss of information violates the principles of the unitary dynamics of quantum mechanics and the thermodynamic principle of bit erasure. In the context of the full adder-subtractor circuit, the previous implementations had three main drawbacks, namely, the use of multiple ancilla input qubits, the generation of garbage qubits, and the use of non-native gates. In this paper, a novel implementation of the reversible full adder-subtractor circuit using the IBM Quantum Composer tool, with the support of only the native gates of the IBM Quantum device, namely, the Hadamard, the Controlled-NOT, and the Toffoli gates, is proposed. The proposed circuit works with six qubits and thirteen gates, with a quantum cost of 13, zero ancilla inputs, and zero garbage outputs simultaneously. The circuit uses only one mode select qubit (M) for operation. When M is 0, the circuit works for full addition with Sum and Carry-out. When M is 1, the circuit works for full subtraction with Difference and Borrow-out through a two's complement B-inversion method. The circuit is simulated using the IBM Quantum composer Simulator with 1024 shots. The Hadamard-based superposition method is used to test all eight input combinations simultaneously in a single run.
A significant new frontier in computing has been opened up by the emergence of the quantum computing paradigm in recent years. By utilising the special abilities of quantum bits, or qubits, to complete complicated calculations tenfold quicker than with traditional computers, quantum computing has the potential to completely transform the computing industry. As this nascent field advances, the need for accessible and versatile quantum computing tools becomes increasingly evident. This research highlights the evolving landscape of quantum computing tools, emphasizing their critical role in the development and application of quantum algorithms and technologies. These tools encompass a spectrum of software and hardware components that aid researchers, engineers, and developers in utilising quantum computing's potential.
The synthesis of reversible logic circuits is a fundamental step in the design of fault-tolerant quantum arithmetic. Existing literature frequently minimizes Quantum Cost (QC) by utilizing the NCV library, which permits controlled-V and Vdagger gates. However, in the context of Fault-Tolerant Quantum Computing (FTQC), the strict NCT library (NOT, CNOT, Toffoli) is often preferred due to the high cost of distilling non-Clifford states required for arbitrary V-gates. Moreover, in the classical design of reversible circuits, only the NCT library can be used as V-gates are not available. In this paper, a new design method for reversible circuits is proposed, based on Mixed-Integer Non-Linear Programming (MINLP) within the Strict NCT Library. By formulating the problem as an MINLP model in GAMS, we successfully automated the optimization of five prominent reversible primitives (TSG, MKG, MIG, SAYEM, and URG) within the strict NCT library. Comparative analysis with the NCV costs found in the literature shows that the costs within the NCT library are comparable or better.
Quantum computing is the delicate art of using a quantum-mechanical system to perform some kind of computation. Such a system differs in a number of significant ways from ordinary computers:• A quantum computer actually does a lot of computations at the same time, each solution is represented by a particular possible state. This is inherent to the physical properties of such a system.• Unless you are sure that you have reached the final (unique) solution, you can not "look" at the "values" of the variables in the computer program that is being run: since all solutions are possible at the same time, observing the values will influence the system and put it into one particular, but otherwise arbitrary, state.• All computations must be reversible, that is, a statement like "a = 5" can only appear in the initialization phase of a program, because the previous value will be lost. On the other hand, a statement like "a = a + 5" is reversible, since you can retrieve the original value.The properties of such a quantum computer make it possible to devise very efficient algorithms. One such algorithm, described by L. Grover (see the references), is searching in an unsorted array of items. With ordinary computers this can not be done more efficiently than in O (N) steps (an exhaustive search: each item is examined in the worst case), with this quantum algorithm, however, the number of steps needed is O (N 1/2 ).Devising quantum algorithms requires a thorough understanding of quantum mechanics, there is no doubt about that. Another question is: do we need quantum computers and special programming languages to program (or perhaps emulate) these algorithms? This article tries to show that, at least for the quantum search algorithm, a classical programming language like Fortran is quite fit (yes, the pun is fortunate).
The synthesis of reversible logic circuits is a fundamental step in the design of fault-tolerant quantum arithmetic. Existing literature frequently minimizes Quantum Cost (QC) by utilizing the NCV library, which permits controlled-V and Vdagger gates. However, in the context of Fault-Tolerant Quantum Computing (FTQC), the strict NCT library (NOT, CNOT, Toffoli) is often preferred due to the high cost of distilling non-Clifford states required for arbitrary V-gates. Moreover, in the classical design of reversible circuits, only the NCT library can be used as V-gates are not available. In this paper, a new design method for reversible circuits is proposed, based on Mixed-Integer Non-Linear Programming (MINLP) within the Strict NCT Library. By formulating the problem as an MINLP model in GAMS, we successfully automated the optimization of five prominent reversible primitives (TSG, MKG, MIG, SAYEM, and URG) within the strict NCT library. Comparative analysis with the NCV costs found in the literature shows that the costs within the NCT library are comparable or better.