Quantum computing is computationally more powerful than classical one due to the features of superposition and entanglement of quantum bits (qubits). However, because of the non-cloning property, measuring qubits in superposition forces them to collapse onto classical ones, which makes traditional run-time techniques for debugging and analyzing hardware circuits infeasible. To overcome this issue, previous works proposed the concept of quantum dynamic runtime assertion. Stabilizer is an approach adopted for correcting quantum errors. The quantum state can remain unchanged after several Pauli operations. We call these Pauli operations a stabilizer. In this work, we propose to use the quantum stabilizers for dynamic runtime assertions, which requires less quantum gates and increases the detect accuracy on Noisy intermediate scale quantum(NISQ).
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.