2019/11/25 by Federico Olmedo, Olmedo, Federico, Alejandro Díaz-Caro +1 · 1 citation
Computer Science · Physics and Astronomy · #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications
paper · pdf · doi:10.48550/arxiv.1911.11247
openalex publication_date 2019/11/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.