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

TL;DR
This paper introduces a bit-vector abstraction method for the formal verification of quantum circuits, enabling scalable and efficient checking of error detection and entanglement generation.
Contribution
It applies a novel abstraction technique to verify complex quantum circuits, including large GHZ states, with significant improvements in speed and memory usage.
Findings
Verified small error detection circuits in less than a second
Successfully verified GHZ circuits with over 8,000 qubits in under three minutes
Demonstrated the approach's scalability and effectiveness for large quantum systems
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
