Anticoli, L;
Piazza, C;
Leonardo, T;
Paolo, Z;
(2017)
Verifying Quantum Programs: From Quipper to QPMC.
ArXiv
Preview |
Text
1708.06312.pdf - Published Version Download (790kB) | Preview |
Abstract
In this paper we present a translation from the quantum programming language Quipper to the QPMC model checker, with the main aim of verifying Quipper programs. Quipper is an embedded functional programming language for quantum computation. It is above all a circuit description language, for this reason it uses the vector state formalism and its main purpose is to make circuit implementation easy providing high level operations for circuit manipulation. Quipper provides both an high-level circuit building interface and a simulator. QPMC is a model checker for quantum protocols based on the density matrix formalism. QPMC extends the probabilistic model checker IscasMC allowing to formally verify properties specified in the temporal logic QCTL on Quantum Markov Chains. We implemented and tested our translat
| Type: | Working / discussion paper |
|---|---|
| Title: | Verifying Quantum Programs: From Quipper to QPMC |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | arXiv:1708.06312 |
| Publisher version: | https://arxiv.org/abs/1708.06312 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| Keywords: | Quantum Languages, Quantum Circuits, Model Checking |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices UCL > Provost and Vice Provost Offices > UCL SLASH UCL > Provost and Vice Provost Offices > UCL SLASH > Faculty of Arts and Humanities UCL > Provost and Vice Provost Offices > UCL SLASH > Faculty of Arts and Humanities > Arts and Sciences (BASc) |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10101602 |
Archive Staff Only
 |
View Item |
