This repository contains a collection of quantum circuits. We are providing these algorithms to increase the reproducibility and transparency of our work.
This work is the result of a collaboration between the Institute for Integrated Circuits (at the Johannes Kepler University Linz) and the Quantum & Post Quantum (qpq) Lab (at the University of Applied Sciences Upper Austria).
For more information, please visit iic.jku.at/eda/research/quantum_simulation.
If you have any questions, feel free to contact us via [email protected].
These circuits construct a maximally entangled state (also known as Bell state) between all qubits.
Circuits realising the quantum Fourier transform (QFT). For more information about the algorithm, see Arxiv or Wikipedia.
Random circuits designed by Google in their quest for quantum supremacy. The circuits are provided in the repository GRCS. For more information about them, see Arxiv.
Grover's algorithm for database search. For more information about the algorithm, see Arxiv or Wikipedia.
Circuits realising Shor’s factorization algorithm. For more information about the algorithm, see Arxiv or Wikipedia.
@article{grurl2020caseStudy,
title = {Arrays vs. Decision Diagrams: A Case Study on Quantum Circuit Simulators},
author = {Grurl, Thomas and Fuß, Jürgen and Hillmich, Stefan and Burgholzer, Lukas and Wille, Robert},
journal = {International Symposium on Multiple-Valued Logic},
volume = {50},
pages = {176--181},
year = {2020},
doi = {10.1109/ISMVL49045.2020.000-9}
}