An automated deductive verification framework for circuit-building quantum programs - Laboratoire Méthodes Formelles Access content directly
Journal Articles Lecture Notes in Computer Science Year : 2021

An automated deductive verification framework for circuit-building quantum programs

Abstract

While recent progress in quantum hardware open the door for significant speedup in certain key areas, quantum algorithms are still hard to implement right, and the validation of such quantum programs is a challenge. In this paper we propose Qbricks , a formal verification environment for circuit-building quantum programs, featuring both parametric specifications and a high degree of proof automation. We propose a logical framework based on first-order logic, and develop the main tool we rely upon for achieving the automation of proofs of quantum specification: PPS, a parametric extension of the recently developed path sum semantics. To back-up our claims, we implement and verify parametric versions of several famous and non-trivial quantum algorithms, including the quantum parts of Shor’s integer factoring , quantum phase estimation (QPE) and Grover’s search.
Fichier principal
Vignette du fichier
final--ESOP-2021.pdf (862.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

cea-04479195 , version 1 (27-02-2024)

Identifiers

Cite

Christophe Chareton, Sébastien Bardin, François Bobot, Valentin Perrelle, Benoît Valiron. An automated deductive verification framework for circuit-building quantum programs. Lecture Notes in Computer Science, 2021, Lecture Notes in Computer Science, 12648, pp.148-177. ⟨10.1007/978-3-030-72019-3_6⟩. ⟨cea-04479195⟩
35 View
11 Download

Altmetric

Share

Gmail Facebook X LinkedIn More