QuBEC: Boosting Equivalence Checking for Quantum Circuits With QEC Embedding

Abstract

Quantum computing has proven to be capable of accelerating many algorithms by performing tasks that classical computers cannot. As quantum algorithms and implementations grow more complex, the need for rigorous circuit verification becomes critical, ensuring correct compilation and enhancing circuit fidelity through error correction and assertions. In this article, we propose QuBEC, a decision diagram-based quantum equivalence checking approach, that requires less latency compared to existing techniques, while accounting for circuits with quantum error correction redundancy. QuBEC reduces verification time on benchmark circuits by up to <inline-formula> <tex-math notation="LaTeX">$443 \times $ </tex-math></inline-formula>, while the number of decision diagram nodes required is reduced by up to <inline-formula> <tex-math notation="LaTeX">$798.31 \times $ </tex-math></inline-formula>, compared to state-of-the-art strategies. The proposed QuBEC framework can contribute to the advancement of quantum computing by enabling faster and more efficient verification of quantum circuits, paving the way for the development of larger and more complex quantum algorithms.