Analysis of quantum programs
Abstract
This chapter presents a series of mathematical tools and algorithmic techniques for analysis of quantum programs with classical control. We start from examining the behavior of quantum while-loops, including termination and average running time. An example is given to compute the average running time of a quantum walk on an n-circle. The studies of quantum while-loops lead us to define quantum Markov chains as a general semantic model of quantum programs. It is shown that termination analysis of quantum programs can be reduced to the reachability problem of quantum Markov chains. The second part of this chapter is then devoted to developing algorithms for reachability analysis of quantum Markov ...
Get Foundations of Quantum Programming now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
