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

arXiv:2603.13554 · IEEE Dallas Circuits and Systems Conference (DCAS)

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

Arun Govindankutty

quant-phcs.ETcs.LOSubmitted Mar 13, 2026• Announced Mar 17, 2026• 1 citation
v1 · Mar 13, 2026v2 · Mar 29, 2026
arXivHTMLPDF

Abstract

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 3.5 GB of memory.

Journal reference
2026 IEEE 19th Dallas Circuits and Systems Conference (DCAS)
DOI
10.1109/DCAS69364.2026.11544428
Comments
The paper is accepted as a full research paper at IEEE-DCAS 2026 and final version will be available via IEEE-Xplore after the conference

Related papers

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

Generalised Bit-Vector Abstractions for Formal Verification of Quantum Error-Detection and Entanglement Circuits over {H,X,C-NOT}: CSS Constructions, Soundness, and Mutation-Based Validation

Arun Govindankutty

Formal verification of quantum circuits becomes difficult as circuit size grows because exhaustive reasoning over the Hilbert space is computationally expensive. In previous work [1], we introduced a bit-vector abstraction that separates superposition tracking from basis-state behavior, enabling SMT-based verification of fixed-size error-detection and entanglement circuits built from H, X, and C-NOT gates. This paper extends the framework in five directions. First, we generalise correctness properties to parametrised repetition and concatenated phase-flip codes with up to 101 logical elements. Second, we verify syndrome extraction for CSS codes specified by arbitrary parity-check matrices, including the Steane, [[15,7,3]] Hamming, [[15,1,3]] Reed-Muller, and rotated surface codes with distances up to 101. We consider arbitrary error patterns, detection up to a specified weight, and recovery using a classical decoder, with counterexamples beyond each code's correction or detection capability. Third, we characterize the {H,X,C-NOT} fragment for which the abstraction faithfully represents Hilbert-space semantics. We prove soundness, demonstrate necessity with counterexamples, validate the characterisation against state-vector simulation, and prove the six lemmas from the original work. Fourth, a mutation study using 13 operators identifies equivalent mutants and detects all 622 non-equivalent mutants within the evaluated fault model. Fifth, a direct Z3 implementation verifies GHZ circuits with up to 262,144 qubits across three topologies on a 16GB laptop. Random H+C-NOT networks show verification cost rises sharply with depth when outputs depend on many inputs. The approach does not target general stabilizer circuits, Y-type stabilizers, fault-tolerant protocols, or physical noise; we identify extensions needed to address these cases.

quant-pharXiv:2610.03794•SN Computer Science•Oct 2, 2026•0 citations

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

Verification of Quantum Fourier Transform and Its Inverse via Rotational and Superposition Abstraction

Arun Govindankutty, Sudarshan K. Srinivasan, Yusuf Moshood

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.

IEEE International Symposium on Circuits and Systems proceedings•May 24, 2026•2 citations

Formal Verification of Quantum Circuit Compilation

Jincheng Zhang

Quantum circuit compilation is a crucial step in the realization of quantum computation, transforming high-level quantum algorithms into gate-level operations executable on specific quantum hardware. However, this process is inherently complex and susceptible to errors, including gate decomposition errors, qubit mapping errors, and resource allocation errors. These errors can significantly degrade the fidelity of the final computation. This paper proposes and investigates the application of formal verification techniques to guarantee the correctness of quantum circuit compilation. We demonstrate how model checking and formal methods can be applied to rigorously verify that the compilation algorithm adheres to predefined constraints, such as preserving quantum properties like unitary evolution and qubit orthogonality. The core claim is that formal verification offers a robust solution to the challenges of detecting and preventing errors in quantum compilation. The proposed approach significantly advances the reliability and trustworthiness of quantum computing by providing a rigorous method for ensuring compilation accuracy. We outline a framework for applying these techniques, focusing on key constraints and illustrating their application through a simplified compilation scenario.

•Aug 29, 2026•0 citations
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 3.5 GB of memory.
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.
Formal verification of quantum circuits becomes difficult as circuit size grows because exhaustive reasoning over the Hilbert space is computationally expensive. In previous work [1], we introduced a bit-vector abstraction that separates superposition tracking from basis-state behavior, enabling SMT-based verification of fixed-size error-detection and entanglement circuits built from H, X, and C-NOT gates. This paper extends the framework in five directions. First, we generalise correctness properties to parametrised repetition and concatenated phase-flip codes with up to 101 logical elements. Second, we verify syndrome extraction for CSS codes specified by arbitrary parity-check matrices, including the Steane, [[15,7,3]] Hamming, [[15,1,3]] Reed-Muller, and rotated surface codes with distances up to 101. We consider arbitrary error patterns, detection up to a specified weight, and recovery using a classical decoder, with counterexamples beyond each code's correction or detection capability. Third, we characterize the {H,X,C-NOT} fragment for which the abstraction faithfully represents Hilbert-space semantics. We prove soundness, demonstrate necessity with counterexamples, validate the characterisation against state-vector simulation, and prove the six lemmas from the original work. Fourth, a mutation study using 13 operators identifies equivalent mutants and detects all 622 non-equivalent mutants within the evaluated fault model. Fifth, a direct Z3 implementation verifies GHZ circuits with up to 262,144 qubits across three topologies on a 16GB laptop. Random H+C-NOT networks show verification cost rises sharply with depth when outputs depend on many inputs. The approach does not target general stabilizer circuits, Y-type stabilizers, fault-tolerant protocols, or physical noise; we identify extensions needed to address these cases.
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 circuit compilation is a crucial step in the realization of quantum computation, transforming high-level quantum algorithms into gate-level operations executable on specific quantum hardware. However, this process is inherently complex and susceptible to errors, including gate decomposition errors, qubit mapping errors, and resource allocation errors. These errors can significantly degrade the fidelity of the final computation. This paper proposes and investigates the application of formal verification techniques to guarantee the correctness of quantum circuit compilation. We demonstrate how model checking and formal methods can be applied to rigorously verify that the compilation algorithm adheres to predefined constraints, such as preserving quantum properties like unitary evolution and qubit orthogonality. The core claim is that formal verification offers a robust solution to the challenges of detecting and preventing errors in quantum compilation. The proposed approach significantly advances the reliability and trustworthiness of quantum computing by providing a rigorous method for ensuring compilation accuracy. We outline a framework for applying these techniques, focusing on key constraints and illustrating their application through a simplified compilation scenario.