Bloch Vector Assertions for Debugging Quantum Programs
Noah H. Oldfield, Christoph Laaber, Shaukat Ali

TL;DR
This paper introduces Bloq, a scalable, automated debugging approach for quantum programs using Bloch-vector assertions, significantly improving fault localization accuracy and efficiency without requiring mid-circuit measurements.
Contribution
The paper presents Bloq and AutoBloq, novel methods for automated, scalable fault localization in quantum programs using expectation value measurements, overcoming limitations of existing approaches.
Findings
Bloq outperforms Proq in F1 score, especially as circuit depth and noise increase.
Bloq reduces runtime by a factor of 5 and circuit depth overhead by a factor of 23.
Experimental results on QFT and Grover algorithms demonstrate Bloq's effectiveness and scalability.
Abstract
Quantum programs must be reliable to ensure trustworthy results, yet debugging them is notoriously challenging due to quantum-specific faults like gate misimplementations and hardware noise, as well as their inherently probabilistic nature. Assertion-based debugging provides a promising solution by enabling localized correctness checks during execution. However, current approaches face challenges including manual assertion generation, reliance on mid-circuit-measurements, and poor scalability. In this paper, we present Bloq, a scalable, automated fault localization approach introducing Bloch-vector-based assertions utilizing expectation value measurements of Pauli operators, enabling low-overhead fault localization without mid-circuit measurements. In addition, we introduce AutoBloq, a component of Bloq for automatically generating assertion schemes from quantum algorithms. An…
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.
