Verifying the Results of Quantum Circuit Compilation Flows
Sprache des Vortragstitels:
International Workshop on Quantum Compilation (IWQC)
Sprache des Tagungstitel:
Several sophisticated design tools for the compilation of quantum circuits emerged in the recent past. Such tools are necessary for realizing a conceptual quantum algorithm on an actual physical device. In order to adhere to all constraints imposed by the hardware, individual high-level circuit components are typically first synthesized to the supported low-level gate-set of the quantum computer, before being mapped to the target?s architecture?utilizing several optimizations in order to improve the compilation result. However, to date, the circuits resulting from these tools are hardly verified, which is mainly due to the immense complexity of checking if two quantum circuits indeed realize the same functionality.
We present an equivalence checking methodology for quantum circuits which can be used to efficiently verify the results of compilation flows. To this end, we combine characteristics unique to quantum computing, e.g., its inherent reversibility, and certain knowledge about the considered compilation flow into a dedicated equivalence checking strategy. Evaluations show that the resulting method is capable of verifying circuits composed of tens of thousands of gates within seconds or even less. The applicability of the proposed methods has been shown using the compilation flow of IBM's Qiskit as a representative. The tool is publicly available at https://github.com/iic-jku/qcec and can easily be adapted for other compilation flows as well.