# Evolving reversible circuits for the even-parity problem

arXiv: https://arxiv.org/abs/2109.13355 · HTML: https://mlsanity.com/paper/2109.13355/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 0 of its 21 references that are in the map.
- First posted on arXiv 21 Aug 2021.

## Built on by (most cited first, 1 of 1)

- [Multi Expression Programming -- an in-depth description](https://mlsanity.com/paper/2110.00367/) (2021)

## Abstract (arXiv)

Reversible computing basically means computation with less or not at all electrical power. Since the standard binary gates are not usually reversible we use the Fredkin gate in order to achieve reversibility. An algorithm for designing reversible digital circuits is described in this paper. The algorithm is based on Multi Expression Programming (MEP), a Genetic Programming variant with a linear representation of individuals. The case of digital circuits for the even-parity problem is investigated. Numerical experiments show that the MEP-based algorithm is able to easily design reversible digital circuits for up to the even-8-parity problem.