Skip to main content Skip to main navigation

Publikation

Optimizing Run-Time Assertions for Quantum Circuit Debugging: A Depth - Ancilla Tradeoff

Karl Aaron Rudkowski; Abhoy Kole; Rolf Drechsler
In: 39th IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems. IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT-2026), September 30 - October 2, Rom, Italy, IEEE, 2026.

Zusammenfassung

Debugging quantum circuits is inherently challenging due to the probabilistic nature of quantum computation and the inability to directly observe intermediate states without disturbing the computation. Run-time assertion-based debugging is a promising approach to provide partial visibility into quantum programs by validating expected properties during execution. However, existing approaches often incur significant overhead in terms of gate count, circuit depth, and auxiliary qubits, limiting their applicability on resource-constrained quantum hardware. In this work, we propose a framework for optimizing run-time assertions in quantum circuits using dynamic circuit capabilities. Our approach leverages classically conditioned operations and repeated measurement–reset patterns to implement assertions efficiently while preserving the state of data qubits. Furthermore, we explore the tradeoff between circuit depth and the number of auxiliary qubits by dynamically distributing assertion components across a limited set of ancilla, enabling scalable assertion insertion while balancing hardware constraints such as measurement latency and reset overhead. Experimental evaluation on Quantum Phase Estimation (QPE) circuits demonstrates that our approach significantly reduces auxiliary qubit usage and gate overhead compared to existing methods, while maintaining effective fault detection and localization capabilities.

Projekte