Advancing Quantum Computing with Formal Methods

The work

AuthorsArend-Jan Quist; Jingyi Mei; Tim Coopmans; Alfons Laarman
Editors
Typepreprint
Year2024
Citekeyquist2024advancing

Identifiers

arXiv2407.11675 from its doi
DOI10.48550/arxiv.2407.11675

Settled

ContainerA preprint has no container. This is an arXiv deposit, 2407.11675v1, and the corpus's practice is that a repository is not a venue -- the same distinction recorded on sewell2026escaping, where 'arXiv' was removed from the container field because 21 of the corpus's 22 preprints carry none. The arXiv identifier holds the deposit information.

Abstract

This 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.

A copy is held

pdf, 573.7 kB. Not published — it may be under copyright. The facts and links here are.

How it got here

How it got hereagent via arxiv
Added2026-09-01 20:35 UTC
Approved bya person 2026-09-06 09:21 UTC

Cite it as

@unpublished{quist2024advancing,
  title        = {Advancing Quantum Computing with Formal Methods},
  author       = {Arend-Jan Quist and Jingyi Mei and Tim Coopmans and Alfons Laarman},
  year         = {2024},
  doi          = {10.48550/arxiv.2407.11675},
}

This record lives at https://refs.drheap.org/quist2024advancing/ and will keep doing so.