POPL 2020 (series) / PLanQC 2020 (series) / Programming Languages for Quantum Computing /
Runtime Analysis of Quantum Programs: A Formal Approach
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 Times are displayed in time zone: Saskatchewan, Central America change
Sun 19 Jan
Times are displayed in time zone: Saskatchewan, Central America change
14:00 - 14:20 Talk | Runtime Analysis of Quantum Programs: A Formal Approach PLanQC Pre-print File Attached | ||
14:20 - 14:40 Talk | Qbricks: formal verification in quantum computing PLanQC Christopĥe CharetonCEA, LIST, France, Sébastien BardinCEA LIST, François BobotCEA, Valentin PerrelleCEA, LIST, France, Benoit ValironLRI, CentraleSupelec, Univ. Paris Saclay File Attached | ||
14:40 - 15:05 Talk | Merged Talk: A Verified Optimizer for Quantum Circuits & Verified Translation Between Low-Level Quantum Languages PLanQC Kesha HietalaUniversity of Maryland, Kartik SinghalUniversity of Chicago, Robert RandUniversity of Maryland, Shih-Han HungUniversity of Maryland, Xiaodi WuUniversity of Maryland, College Park, Michael HicksUniversity of Maryland Media Attached |