Poster + Presentation + Paper
31 May 2022 Dynamic assertion for quantum circuits based on stabilizers
Author Affiliations +
Conference Poster
Abstract
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).
Conference Presentation
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Chen-yuan Lin, Shang-Wei Lin, and Yean-Ru Chen "Dynamic assertion for quantum circuits based on stabilizers", Proc. SPIE 12133, Quantum Technologies 2022, 121330I (31 May 2022); https://doi.org/10.1117/12.2632655
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Superposition

Quantum circuits

Quantum computing

Device simulation

Matrices

Optimization (mathematics)

RELATED CONTENT

Probabilistic nonunitary quantum computing
Proceedings of SPIE (August 24 2004)
Fast quantum Fourier-Weyl-Heisenberg transforms
Proceedings of SPIE (July 26 2001)
Constructing Steane code fault-tolerant gates
Proceedings of SPIE (February 23 2005)
Finsler metrics in quantum circuit optimization
Proceedings of SPIE (May 08 2012)

Back to Top