Write a Blog >>
Sun 19 Jan 2020 14:00 - 14:20 at Maurepas - Formal Methods Chair(s): Dominique Unruh

In this abstract we study the resource consumption of quantum programs. Specifically, we focus on the expected runtime of programs and, inspired by recent methods for probabilistic programs, we develop a calculus à la weakest precondition to formally and systematically derive the (exact) expected runtime of quantum programs. Notably, the calculus admits a notion of loop runtime invariant that can be readily used to derive upper bounds of their runtime. Finally, we show the applicability of our calculus analyzing the runtime of (a simplified version of) the BB84 quantum key distribution protocol.

Slides (PLanQC'20 - Slides.pdf)6.8MiB

Sun 19 Jan

Displayed time zone: Saskatchewan, Central America change

14:00 - 15:05
Formal MethodsPLanQC at Maurepas
Chair(s): Dominique Unruh University of Tartu
Runtime Analysis of Quantum Programs: A Formal Approach
Federico Olmedo University of Chile & IMFD Chile, Alejandro Díaz-Caro ICC (UBA-CONICET) & UNQ
Pre-print File Attached
Qbricks: formal verification in quantum computing
Christopĥe Chareton CEA, LIST, France, Sébastien Bardin CEA LIST, François Bobot CEA, Valentin Perrelle CEA, LIST, France, Benoit Valiron LRI, CentraleSupelec, Univ. Paris Saclay
File Attached
Merged Talk: A Verified Optimizer for Quantum Circuits & Verified Translation Between Low-Level Quantum Languages
Kesha Hietala University of Maryland, Kartik Singhal University of Chicago, Robert Rand University of Maryland, Shih-Han Hung University of Maryland, Xiaodi Wu University of Maryland, College Park, Michael Hicks University of Maryland
Media Attached