\textit{Re}Q\textsc{wire}: reasoning about reversible quantum circuits

zbMATH Open1486.81064arXiv1901.10118MaRDI QIDQ3385643FDOQ3385643

Authors:

Publication date: 20 December 2021

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

Recommendations

• Verified compilation of space-efficient reversible circuits
• Fast equivalence-checking for quantum circuits
• Towards quantum programs verification: from Quipper circuits to QPMC
• Tools for quantum and reversible circuit compilation
• Quantum circuit oracles for abstract machine computations

Mathematics Subject Classification ID

Quantum computation (81P68) Analytic circuit theory (94C05)

Cites Work

• REVS: a tool for space-optimized reversible circuit synthesis
• Logical Reversibility of Computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Title not available (Why is that?)
• An introduction to quantum programming in Quipper
• Reversible Computing
• QWIRE: a core language for quantum circuits
• Verified compilation of space-efficient reversible circuits
• Classical concepts in quantum programming
• Dependent types and multi-monadic effects in \(\mathrm{F}^*\)
• Algebraic effects, linearity, and quantum programming languages
• Reversible simulations of elastic collisions
• Title not available (Why is that?)

Cited In (4)

• An automated deductive verification framework for circuit-building quantum programs
• A Birkhoff Connection Between Quantum Circuits and Linear Classical Reversible Circuits
• Gottesman types for quantum programs
• Type-safe quantum programming in Idris

This page was built for publication: \textit{Re}\(\mathcal{Q}\)\textsc{wire}: reasoning about reversible quantum circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3385643)