Bit-Vector Abstractions to Formally Verify Quantum Error Detection & Entanglement
Summarize this article with:
Quantum Physics arXiv:2603.13554 (quant-ph) [Submitted on 13 Mar 2026] Title:Bit-Vector Abstractions to Formally Verify Quantum Error Detection & Entanglement Authors:Arun Govindankutty View a PDF of the paper titled Bit-Vector Abstractions to Formally Verify Quantum Error Detection & Entanglement, by Arun Govindankutty View PDF HTML (experimental) 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. Comments: Subjects: Quantum Physics (quant-ph); Emerging Technologies (cs.ET); Logic in Computer Science (cs.LO) Cite as: arXiv:2603.13554 [quant-ph] (or arXiv:2603.13554v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2603.13554 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Arun Govindankutty [view email] [v1] Fri, 13 Mar 2026 19:45:57 UTC (211 KB) Full-text links: Access Paper: View a PDF of the paper titled Bit-Vector Abstractions to Formally Verify Quantum Error Detection & Entanglement, by Arun GovindankuttyView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-03 Change to browse by: cs cs.ET cs.LO References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)