Verifying Results of Quantum Circuit Compilation Flows
Lukas Burgholzer∗ Robert Wille∗†∗
Institute for Integrated Circuits, Johannes Kepler University Linz, Austria
†Software Competence Center Hagenberg GmbH (SCCH), Hagenberg, Austria
lukas.burgholzer@jku.at robert.wille@jku.at
https://iic.jku.at/eda/research/quantum/
Quantum computers aim to change the way we tackle certain problems in the future. Numerous quantum computing applications with a near-term perspective (e.g., for finance, chemistry, machine learning, optimization) and with a long-term perspective (i.e., cryptography, database search) are currently investigated. However, in order to realize those, a multitude of (computationally complex) design tasks have to be conducted—eventually forming a process called quantum circuit compilation. However, in order to realize those, a multitude of (computationally complex) design tasks have to be conducted—eventually forming a process called quantum circuit compilation. However, in order to realize those, a multitude of (computationally complex) design tasks have to be conducted—eventually forming a process called quantum circuit compilation. This results in descriptions of quantum algorithms at various abstraction levels which may significantly differ in their basis operations and structure.