Symbolic Quantum Circuit Simpli cation in SymPy

In the eld of quantum information science, one can design a series of quantum logic operations known as a circuit. Circuits are the basis for quantum computations in quantum computing. As circuits will most likely be designed from a logical standpoint, there could exist mathematical redundancies which will lead to a larger circuit than necessary. These redundancies are computationally expensive, and there is a need for them to be found and eliminated to simplify the circuit. We present our research on nding the rules for simplifying circuits and its implementation in SymPy.