Formal Methods for Quantum Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2023

Formal Methods for Quantum Algorithms

Abstract

This chapter introduces both the requirements and challenges for an efficient use of formal methods in quantum computing and the current most promising research directions. While the recent progress in quantum hardware opens the door for significant speedup in cryptography as well as additional key areas (biology, chemistry, optimization, machine learning, etc), quantum algorithms are still hard to implement right, and the validation of quantum programs is a challenge. As an alternative strategy, formal methods are prone to play a decisive role in the emerging field of quantum software. The chapter also introduces several existing solutions for the formal verification of quantum compilation and the equivalence of quantum program runs. The vast majority of quantum algorithms are described within the context of the quantum co-processor model, i.e. an hybrid model where a classical computer controls a quantum co-processor holding a quantum memory.

Dates and versions

hal-04311441 , version 1 (28-11-2023)

Identifiers

Cite

Christophe Chareton, Sébastien Bardin, Dongho Lee, Benoît Valiron, Renaud Vilmart, et al.. Formal Methods for Quantum Algorithms. Handbook of Formal Analysis and Verification in Cryptography, 1, CRC Press, pp.319-422, 2023, ⟨10.1201/9781003090052-7⟩. ⟨hal-04311441⟩
27 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More