scientific article; zbMATH DE number 7439407
From MaRDI portal
Publication:5015189
zbMath1477.68528arXiv1511.01568MaRDI QIDQ5015189
Rajagopal Nagarajan, Jaap P. Boender, Florian Kammüller
Publication date: 6 December 2021
Full work available at URL: https://arxiv.org/abs/1511.01568
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12) Formalization of mathematics in connection with theorem provers (68V20)
Related Items (7)
A modeling and verification framework for optical quantum circuits ⋮ A formalization of the CHSH inequality and Tsirelson's upper-bound in Isabelle/HOL ⋮ Unnamed Item ⋮ Proof Verification Technology and Elementary Physics ⋮ An automated deductive verification framework for circuit-building quantum programs ⋮ A formal proof of the expressiveness of deep learning ⋮ A formal proof of the expressiveness of deep learning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Model checking quantum Markov chains
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- A calculus of mobile processes. II
- Interactive theorem proving. 4th international conference, ITP 2013, Rennes, France, July 22--26, 2013. Proceedings
- An algebra of quantum processes
- An Update on Quantum Cryptography
- Experimental realization of a quantum relay over a significant distance
- Unconditional security in quantum cryptography
- The Four Colour Theorem: Engineering of a Formal Proof
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Communicating quantum processes
- Mathematical Knowledge Management
- Equivalence Checking of Quantum Protocols
- Bisimulation for quantum processes
- Types and typechecking for Communicating Quantum Processes
- Relations among quantum processes: bisimilarity and congruence
This page was built for publication:
