arXiv Analytics

Sign in

arXiv:2011.07288 [quant-ph]AbstractReferencesReviewsResources

Random Stimuli Generation for the Verification of Quantum Circuits

Lukas Burgholzer, Richard Kueng, Robert Wille

Published 2020-11-14Version 1

Verification of quantum circuits is essential for guaranteeing correctness of quantum algorithms and/or quantum descriptions across various levels of abstraction. In this work, we show that there are promising ways to check the correctness of quantum circuits using simulative verification and random stimuli. To this end, we investigate how to properly generate stimuli for efficiently checking the correctness of a quantum circuit. More precisely, we introduce, illustrate, and analyze three schemes for quantum stimuli generation---offering a trade-off between the error detection rate (as well as the required number of stimuli) and efficiency. In contrast to the verification in the classical realm, we show (both, theoretically and empirically) that even if only a few randomly-chosen stimuli (generated from the proposed schemes) are considered, high error detection rates can be achieved for quantum circuits. The results of these conceptual and theoretical considerations have also been empirically confirmed---with a grand total of approximately $10^6$ simulations conducted across 50 000 benchmark instances.

Comments: 6 pages, in Asia and South Pacific Design Automation Conference (ASP-DAC) 2021
Categories: quant-ph, cs.ET
Related articles: Most relevant | Search more
arXiv:1706.05114 [quant-ph] (Published 2017-06-15)
Design of Quantum Circuits for Galois Field Squaring and Exponentiation
arXiv:2012.09663 [quant-ph] (Published 2020-12-17)
Architecture aware compilation of quantum circuits via lazy synthesis
arXiv:1610.05296 [quant-ph] (Published 2016-10-17)
Efficiently characterizing the total error in quantum circuits