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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Hybrid Algorithm for Reversible Toffoli Circuits Synthesis


    Contributors:


    Publication date :

    2014-01-01


    Size :

    13 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    A Hybrid Algorithm for Reversible Toffoli Circuits Synthesis

    Wang, X. / Jiao, L. / Li, Y. | British Library Conference Proceedings | 2014


    Reclaiming hybrid integrated circuits

    Ebel, G. / Grossbard, H. | NTRS | 1978


    Polymer adhesives for hybrid circuits

    Caruso, S. V. / Honeycutt, J. O. | NTRS | 1976


    An extended difference expansion algorithm for reversible watermarking

    Tseng, H. W. / Chang, C. C. | British Library Online Contents | 2008


    Cooling/grounding mount for hybrid circuits

    Bagstad, B. / Estrada, R. / Mandel, H. | NTRS | 1981