Towards Quantum Programs Verification: From Quipper Circuits to QPMC

DOI10.1007/978-3-319-40578-0_16zbMath1480.81028OpenAlexW2476844526MaRDI QIDQ3186602

L. Taglialegne, Linda Anticoli, Paolo Zuliani, Carla Piazza

Publication date: 10 August 2016

Published in: Reversible Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40578-0_16

zbMATH Keywords

model checkingquantum circuitsquantum languages

Mathematics Subject Classification ID

Quantum computation (81P68) Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60) Quantum algorithms and complexity in the theory of computing (68Q12) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (3)

Quantum encoding of dynamic directed graphs ⋮ Mirrors and memory in quantum automata ⋮ Unnamed Item

Uses Software

• PRISM
• Quipper
• QPMC
• qGCL

Cites Work

• Model checking quantum Markov chains
• An Introduction to Quantum Programming in Quipper
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards Quantum Programs Verification: From Quipper Circuits to QPMC