Hybrid GF(2) – Boolean Expressions ..for Quantum Computing Circuits

DOI10.1007/978-3-642-29517-1_5zbMath1452.81068OpenAlexW365887440MaRDI QIDQ2902500

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

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)

Related Items (3)

Optimal 4-bit Reversible Mixed-Polarity Toffoli Circuits ⋮ Hybrid Control of Toffoli and Peres Gates ⋮ OR-Toffoli and OR-Peres Reversible Gates

This page was built for publication: Hybrid GF(2) – Boolean Expressions ..for Quantum Computing Circuits