Quantum Circuits for Dynamic Runtime Assertions in Quantum Computation
Citations Over TimeTop 10% of 2020 papers
Abstract
In this paper, we propose quantum circuits for runtime assertions, which can be used for both software debugging and error detection. Runtime assertion is challenging in quantum computing for two key reasons. First, a quantum bit (qubit) cannot be copied, which is known as the non-cloning theorem. Second, when a qubit is measured, its superposition state collapses into a classical state, losing the inherent parallel information. In this paper, we overcome these challenges with runtime computation through ancilla qubits, which are used to indirectly collect the information of the qubits of interest. We design quantum circuits to assert classical states, entanglement, and superposition states. Our experimental results show that they are effective in debugging as well as improving the success rate for various quantum algorithms on IBM Q quantum computers.
Related Papers
- → Progress towards practical quantum variational algorithms(2015)722 cited
- → Algebraic and information-theoretic conditions for operator quantum error correction(2007)46 cited
- → Some Quantum States Prepared with Polynomial Quantum Circuit(2012)2 cited
- → Grover algorithm circuit optimization and noise analysis on integer factorization(2022)2 cited
- Design and optimization of quantum error-correction circuit with module(2010)