Verified compilation of space-efficient reversible circuits

DOI10.1007/978-3-319-63390-9_1zbMath1494.68045arXiv1603.01635OpenAlexW2302430074MaRDI QIDQ2164204

Martin Roetteler, Krysta M. Svore, Matthew Amy

Publication date: 12 August 2022

Full work available at URL: https://arxiv.org/abs/1603.01635

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Specification and verification (program logics, model checking, etc.) (68Q60) Quantum algorithms and complexity in the theory of computing (68Q12) Other nonclassical models of computation (68Q09) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (7)

Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An automated deductive verification framework for circuit-building quantum programs ⋮ A framework for quantum-classical cryptographic translation ⋮ Sized Types for Low-Level Quantum Metaprogramming

This page was built for publication: Verified compilation of space-efficient reversible circuits