Exact Synthesis of Elementary Quantum Gate Circuits for Reversible Functions with Don't Cares

Compact realizations of reversible logic functions are of interest in the design of quantum computers. In this paper we present an exact synthesis algorithm, based on Boolean satisfiability (SAT), that finds the minimal elementary quantum gate realization for a given reversible function. Since these gates work in terms of qubits, a multi-valued encoding is proposed. Don't care conditions appear naturally in many reversible functions. Constant inputs are often required when a function is embedded into a reversible one. The proposed algorithm takes full advantage of don't care conditions and automatically sets the constant inputs to their optimal values. The effectiveness of the algorithm is shown on a set of benchmark functions.

[1]  Robert Wille,et al.  Quantified Synthesis of Reversible Logic , 2008, 2008 Design, Automation and Test in Europe.

[2]  Kenneth L. McMillan,et al.  Applying SAT Methods in Unbounded Symbolic Model Checking , 2002, CAV.

[3]  Guowu Yang,et al.  Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[5]  Robert Wille,et al.  RevLib: An Online Resource for Reversible Functions and Reversible Circuits , 2008, 38th International Symposium on Multiple Valued Logic (ismvl 2008).

[6]  DiVincenzo,et al.  Five two-bit quantum gates are sufficient to implement the quantum Fredkin gate. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[7]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[8]  Gerhard W. Dueck,et al.  Reversible cascades with minimal garbage , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[10]  Niraj K. Jha,et al.  An Algorithm for Synthesis of Reversible Logic Circuits , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[11]  Robert Wille,et al.  Fast exact Toffoli network synthesis of reversible logic , 2007, ICCAD 2007.

[12]  D. M. Miller,et al.  Comparison of the Cost Metrics for Reversible and Quantum Logic Synthesis , 2005, quant-ph/0511008.

[13]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[14]  John P. Hayes,et al.  Synthesis of reversible logic circuits , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[16]  Massoud Pedram,et al.  Analysis and Synthesis of Quantum Circuits by Using Quantum Decision Diagrams , 2006, Proceedings of the Design Automation & Test in Europe Conference.

[17]  Armin Biere,et al.  Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.

[18]  J. P. Marques,et al.  GRASP : A Search Algorithm for Propositional Satisfiability , 1999 .

[19]  Tommaso Toffoli,et al.  Reversible Computing , 1980, ICALP.

[20]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[21]  Gerhard W. Dueck,et al.  Quantum circuit simplification using templates , 2005, Design, Automation and Test in Europe.

[22]  Rolf Drechsler,et al.  Exact sat-based toffoli network synthesis , 2007, GLSVLSI '07.

[23]  Gerhard W. Dueck,et al.  Toffoli network synthesis with templates , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.