IEEE International Symposium on Circuits and Systems proceedings
Verification of Quantum Fourier Transform and Its Inverse via Rotational and Superposition Abstraction
Arun Govindankutty, Sudarshan K. Srinivasan, Yusuf Moshood
Abstract
In this work, we present a scalable formal verification method for the Quantum Fourier Transform (QFT) and its inverse (iQFT). A novel bit-vector-based abstraction that models both superposition and rotational behaviours of quantum gates is employed to achieve efficiency and scalability. Abstraction-aligned formal properties are introduced that capture functional correctness for QFT and iQFT. The approach is able to verify both QFT and iQFT circuits with 50,000 qubits in under 25 minutes.