Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

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

Published May 24, 2026• 2 citations
Publisher

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.

DOI
10.1109/iscas66217.2026.11562135

Related papers

Rotational abstractions for verification of quantum Fourier transform circuits

Arun Govindankutty, Sudarshan K. Srinivasan, Nimish Mathure

Abstract With the race to build large‐scale quantum computers and efforts to exploit quantum algorithms for efficient problem solving in science and engineering disciplines, the requirement to have efficient and scalable verification methods are of vital importance. A novel formal verification method that is targeted at Quantum Fourier Transform (QFT) circuits is proposed. Quantum Fourier Transform is a fundamental quantum algorithm that forms the basis of many quantum computing applications. The verification method employs abstractions of quantum gates used in QFT that leads to a reduction of the verification problem from Hilbert space to the quantifier free logic of bit‐vectors. Very efficient decision procedures are available to reason about bit‐vectors. Therefore, this method is able to scale up to the verification of QFT circuits with 10,000 qubits and 50 million quantum gates, providing a meteoric advance in the size of QFT circuits thus far verified using formal verification methods.

arXiv:2301.00737•IET Quantum Communication•Mar 13, 2023•15 citations

Bit-Vector Abstractions to Formally Verify Quantum Error Detection & Entanglement

Arun Govindankutty

As the number of qubits increases, quantum circuits become more complex and their state space grows rapidly. This makes functional verification challenging for conventional techniques. Ensuring correctness is especially critical for quantum error correction and entanglement generation. This paper presents a novel application of bit-vector based abstraction methodology for formal verification of quantum circuits where superposition and functional behaviour can be decoupled. The approach is applied to error detection circuits for 2-qubit, 3-qubit, and Shor 9-qubit quantum codes, as well as Bell-state and GHZ-state generation circuits. The error detection circuits and the Bell-state generation circuit are verified in less than a second and 25MB memory. GHZ circuits with up to 8,192 qubits are verified in under three minutes using a maximum of 23.2 GB of memory. The results demonstrate the versatility, scalability, and effectiveness of the proposed approach.

quant-pharXiv:2603.13554•IEEE Dallas Circuits and Systems Conference (DCAS)•Mar 17, 2026•1 citation

Formally Verifying Quantum Phase Estimation Circuits with 1,000+ Qubits

Arun Govindankutty, Sudarshan K. Srinivasan

We present a scalable formal verification methodology for Quantum Phase Estimation (QPE) circuits. Our approach uses a symbolic qubit abstraction based on quantifier-free bit-vector logic, capturing key quantum phenomena, including superposition, rotation, and measurement. The proposed methodology maps quantum circuit functional behaviour from Hilbert space to a bit-vector domain. We develop formal properties aligned with this abstraction to ensure functional correctness of QPE circuits. The method scales efficiently, verifying QPE circuits with up to 6 precision qubits and 1,024 phase qubits using under 7.5~GB of memory.

quant-pharXiv:2603.08762•IEEE Dallas Circuits and Systems Conference (DCAS)•Mar 10, 2026•3 citations

Superposition‐Based Abstractions for Quantum Data Encoding Verification

Arun Govindankutty, Sudarshan K. Srinivasan

ABSTRACT Many quantum algorithms operate on classical data, by first encoding classical data into the quantum domain using quantum data encoding circuits. To be effective for large data sets, encoding circuits that operate on large data sets are required. However, as the size of the data sets increases, the encoding circuits quickly become large, complex and error prone. Errors in the encoding circuit will provide incorrect inputs to quantum algorithms, making them ineffective. To address this problem, a formal method is proposed for verification of encoding circuits. The key idea to address scalability is the use of abstractions that reduce the verification problem to bit‐vector space. The major outcome of this work is that using this approach, the authors have been able to verify encoding circuits with up to 8191 qubits with very low memory (85 MB) and time (0.29s), demonstrating that the proposed approach can easily be employed to verify even much larger encoding circuits. The results are very significant because, traditional verification approaches that rely on modelling quantum circuits in Hilbert space have only demonstrated verification scalability up to 250 qubits. Also, this is the first approach to tackle the verification of quantum encoding circuits.

IET Quantum Communication•Jan 1, 2025•14 citations

An Optimisation Methodology for Functional Verification of Quantum Circuits Employing Symbolic Bit-Vector Abstractions

Arun Govindankutty

Quantum Phase Estimation (QPE) is a core subroutine in many quantum algorithms, making its functional correctness critical. However, verification becomes increasingly complex and time consuming as the number of qubits grows. Symbolic bit-vector abstractions offer a promising alternative by reducing the verification problem from complex-valued Hilbert space to a tractable bit-vector representation. This work presents an optimized methodology for verifying quantum circuits that employs symbolic bit-vector abstractions. The proposed approach leverages capability of symbolic abstractions to decouple system behaviour into independent qubit level components. Verification is then carried out in parallel to improve scalability and efficiency. The effectiveness of the method is demonstrated through the verification of QPE circuits. Experimental results show over a$10,000\times$reduction in verification time,$150\times$improvement in memory utilisation,$16 \times$improvement with respect to phase estimation accuracy, and support for$10 \times$increase in qubit counts, demonstrating significant scalability gains compared to previously reported QPE verification methods.

IEEE International Conference on Electro Information Technology•May 1, 2026•0 citations

Average-Case Verification of the Quantum Fourier Transform Enables Worst-Case Phase Estimation

Noah Linden, Ronald de Wolf

The quantum Fourier transform (QFT) is a key primitive for quantum computing that is typically used as a subroutine within a larger computation, for instance for phase estimation. As such, we may have little control over the state that is input to the QFT. Thus, in implementing a good QFT, we may imagine that it needs to perform well on arbitrary input states. Verifying this worst-case correct behaviour of a QFT-implementation would be exponentially hard (in the number of qubits) in general, raising the concern that this verification would be impossible in practice on any useful-sized system. In this paper we show that, in fact, we only need to have good average-case performance of the QFT to achieve good worst-case performance for key tasks – phase estimation, period finding and amplitude estimation. Further we give a very efficient procedure to verify this required average-case behaviour of the QFT.

arXiv:2109.10215•Quantum•Dec 7, 2022•13 citations
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.
Abstract With the race to build large‐scale quantum computers and efforts to exploit quantum algorithms for efficient problem solving in science and engineering disciplines, the requirement to have efficient and scalable verification methods are of vital importance. A novel formal verification method that is targeted at Quantum Fourier Transform (QFT) circuits is proposed. Quantum Fourier Transform is a fundamental quantum algorithm that forms the basis of many quantum computing applications. The verification method employs abstractions of quantum gates used in QFT that leads to a reduction of the verification problem from Hilbert space to the quantifier free logic of bit‐vectors. Very efficient decision procedures are available to reason about bit‐vectors. Therefore, this method is able to scale up to the verification of QFT circuits with 10,000 qubits and 50 million quantum gates, providing a meteoric advance in the size of QFT circuits thus far verified using formal verification methods.
As the number of qubits increases, quantum circuits become more complex and their state space grows rapidly. This makes functional verification challenging for conventional techniques. Ensuring correctness is especially critical for quantum error correction and entanglement generation. This paper presents a novel application of bit-vector based abstraction methodology for formal verification of quantum circuits where superposition and functional behaviour can be decoupled. The approach is applied to error detection circuits for 2-qubit, 3-qubit, and Shor 9-qubit quantum codes, as well as Bell-state and GHZ-state generation circuits. The error detection circuits and the Bell-state generation circuit are verified in less than a second and 25MB memory. GHZ circuits with up to 8,192 qubits are verified in under three minutes using a maximum of 23.2 GB of memory. The results demonstrate the versatility, scalability, and effectiveness of the proposed approach.
We present a scalable formal verification methodology for Quantum Phase Estimation (QPE) circuits. Our approach uses a symbolic qubit abstraction based on quantifier-free bit-vector logic, capturing key quantum phenomena, including superposition, rotation, and measurement. The proposed methodology maps quantum circuit functional behaviour from Hilbert space to a bit-vector domain. We develop formal properties aligned with this abstraction to ensure functional correctness of QPE circuits. The method scales efficiently, verifying QPE circuits with up to 6 precision qubits and 1,024 phase qubits using under 7.5~GB of memory.
ABSTRACT Many quantum algorithms operate on classical data, by first encoding classical data into the quantum domain using quantum data encoding circuits. To be effective for large data sets, encoding circuits that operate on large data sets are required. However, as the size of the data sets increases, the encoding circuits quickly become large, complex and error prone. Errors in the encoding circuit will provide incorrect inputs to quantum algorithms, making them ineffective. To address this problem, a formal method is proposed for verification of encoding circuits. The key idea to address scalability is the use of abstractions that reduce the verification problem to bit‐vector space. The major outcome of this work is that using this approach, the authors have been able to verify encoding circuits with up to 8191 qubits with very low memory (85 MB) and time (0.29s), demonstrating that the proposed approach can easily be employed to verify even much larger encoding circuits. The results are very significant because, traditional verification approaches that rely on modelling quantum circuits in Hilbert space have only demonstrated verification scalability up to 250 qubits. Also, this is the first approach to tackle the verification of quantum encoding circuits.
Quantum Phase Estimation (QPE) is a core subroutine in many quantum algorithms, making its functional correctness critical. However, verification becomes increasingly complex and time consuming as the number of qubits grows. Symbolic bit-vector abstractions offer a promising alternative by reducing the verification problem from complex-valued Hilbert space to a tractable bit-vector representation. This work presents an optimized methodology for verifying quantum circuits that employs symbolic bit-vector abstractions. The proposed approach leverages capability of symbolic abstractions to decouple system behaviour into independent qubit level components. Verification is then carried out in parallel to improve scalability and efficiency. The effectiveness of the method is demonstrated through the verification of QPE circuits. Experimental results show over a10,000×10,000\times10,000×reduction in verification time,150×150\times150×improvement in memory utilisation,16×16 \times16×improvement with respect to phase estimation accuracy, and support for10×10 \times10×increase in qubit counts, demonstrating significant scalability gains compared to previously reported QPE verification methods.
The quantum Fourier transform (QFT) is a key primitive for quantum computing that is typically used as a subroutine within a larger computation, for instance for phase estimation. As such, we may have little control over the state that is input to the QFT. Thus, in implementing a good QFT, we may imagine that it needs to perform well on arbitrary input states. Verifying this worst-case correct behaviour of a QFT-implementation would be exponentially hard (in the number of qubits) in general, raising the concern that this verification would be impossible in practice on any useful-sized system. In this paper we show that, in fact, we only need to have good average-case performance of the QFT to achieve good worst-case performance for key tasks – phase estimation, period finding and amplitude estimation. Further we give a very efficient procedure to verify this required average-case behaviour of the QFT.