Hybrid GF(2) -- Boolean expressions for quantum computing circuits

DOI10.1007/978-3-642-29517-1_5zbMATH Open1452.81068OpenAlexW365887440MaRDI QIDQ2902500FDOQ2902500

Authors: Claudio Moraga 

Publication date: 20 August 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-29517-1_5

Recommendations

• A quantum algorithm for finding minimal exclusive-or expressions for incompletely specified Boolean functions
• Technology mapping for single target gate based circuits using Boolean functional decomposition
• Transforming MCT circuits to NCVW circuits
• Quantum reversible circuits for \(\mathrm{GF}(2^8)\) multiplication based on composite field arithmetic operations
• Improving the quantum cost of reversible Boolean functions using reorder algorithm

zbMATH Keywords

quantum computingreversible circuitsextensions on Reed-Muller expressions

Mathematics Subject Classification ID

Quantum computation (81P68) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum gates (81P65)

Cited In (5)

• A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer
• OR-Toffoli and OR-Peres Reversible Gates
• Technology mapping for single target gate based circuits using Boolean functional decomposition
• Hybrid Control of Toffoli and Peres Gates
• Optimal 4-bit reversible mixed-polarity Toffoli circuits

This page was built for publication: Hybrid GF(2) -- Boolean expressions for quantum computing circuits

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