Abstract
AbstractThis tutorial introduces quantum computing with a focus on the applicability of formal methods in this relatively new domain. We describe quantum circuits and convey an understanding of their inherent combinatorial nature and the exponential blow-up that makes them hard to analyze. Then, we show how weighted model counting (#SAT) can be used to solve hard analysis tasks for quantum circuits.This tutorial is aimed at everyone in the formal methods community with an interest in quantum computing. Familiarity with quantum computing is not required, but basic linear algebra knowledge (particularly matrix multiplication and basis vectors) is a prerequisite. The goal of the tutorial is to inspire the community to advance the development of quantum computing with formal methods.
Publisher
Springer Nature Switzerland
Reference41 articles.
1. Aharonov, D.: A simple proof that Toffoli and Hadamard are quantum universal. arXiv preprint quant-ph/0301040 (2003)
2. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009). https://doi.org/10.1017/cbo9780511804090
3. Arute, F., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574, 505–510 (2019). https://www.nature.com/articles/s41586-019-1666-5
4. Bichsel, B., Paradis, A., Baader, M., Vechev, M.: Abstraqt: analysis of quantum circuits via abstract stabilizer simulation. Quantum 7, 1185 (2023). https://doi.org/10.22331/q-2023-11-20-1185, http://dx.doi.org/10.22331/q-2023-11-20-1185
5. Bookatz, A.D.: QMA-complete problems. arXiv:1212.6312 (2012)