Abstract In this paper, we propose a hybrid algorithm aimed at optimally synthesizing reversible Toffoli circuits in terms of the quantum cost for 4-bit and 5-bit reversible benchmarks. The hybrid algorithm alternates a variable-length evolutionary process with a heuristic factor subtraction algorithm based on Positive Polarity Reed Muller (PPRM) expansion. Further more, the variable length evolutionary algorithm employs a new constraint solving method, which introduces a trade-off factor to control a pair of contradictions: the decreasing of constraint violation and the increasing of quantum cost. The experimental results show that the hybrid algorithm outperforms existing combinations of a definite synthesis approach and a post-optimization method on some commonly used 4-bit and 5-bit benchmarks in point of quantum cost, and obtain some better results than the best known ones.
A Hybrid Algorithm for Reversible Toffoli Circuits Synthesis
2014-01-01
13 pages
Article/Chapter (Book)
Electronic Resource
English
A Hybrid Algorithm for Reversible Toffoli Circuits Synthesis
British Library Conference Proceedings | 2014
|Reclaiming hybrid integrated circuits
NTRS | 1978
|Polymer adhesives for hybrid circuits
NTRS | 1976
|An extended difference expansion algorithm for reversible watermarking
British Library Online Contents | 2008
|Cooling/grounding mount for hybrid circuits
NTRS | 1981
|