QuanTree and QuanLin, Two Special Purpose Quantum Compilers

TL;DR

This paper presents QuanTree and QuanLin, two specialized quantum compilers that generate approximate quantum circuits for specific graph-structured Hamiltonians, with source code and error metrics included.

Contribution

Introduction of two new quantum compilers, QuanTree and QuanLin, tailored for binary tree and line graph Hamiltonians, with implementation details and error evaluation.

Findings

Both applications produce quantum circuits closely approximating input operators.

Source code is publicly available for use and further development.

Error metrics demonstrate the accuracy of the compiled circuits.

Abstract

This paper introduces QuanTree v1.1 and QuanLin v1.1, two Java applications available for free. (Source code included in the distribution.) Each application compiles a different type of input quantum evolution operator. The applications output a quantum circuit that is approximately equal to the input evolution operator. QuanTree compiles an input evolution operator whose Hamiltonian is proportional to the incidence matrix of a balanced, binary tree graph. QuanLin compiles an input evolution operator whose Hamiltonian is proportional to the incidence matrix of a line (open string) graph. Both applications also output an error, defined as the distance in the Frobenius norm between the input evolution operator and the output quantum circuit.