This bookpresents a new optimization flow for quantum circuits realization. At thereversible level, optimization algorithms are presented to reduce the quantumcost. Then, new mapping approaches to decompose reversible circuits to quantumcircuits using different quantum libraries are described. Finally, optimizationtechniques to reduce the quantum cost or the delay are applied to the resultingquantum circuits. Furthermore, this book studies the complexity of reversiblecircuits and quantum circuits from a theoretical perspective.
1 Introduction . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . .. . . 1
1.1 Book Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.1.1 Optimization of Quantum Circuits . . . . . . . . . . . . . . . . . . . . . . 4
1.1.2 Complexity Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.2 Outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .7
2 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.1 Boolean Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.2 Boolean Function Decomposition . . . . . . . . . . . . . . . . . . . . . . . . 10
2.2.1 Ashenhurst Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . 10
2.2.2 Curtis Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
2.2.3 Bi-decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
2.2.4 Multiplexer Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
2.3 Exclusive-OR Sum Of Products . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13&lc¬
![Reversible and Quantum Circuits Optimization and Complexity Analysis [Paperback]](/itemImage/2/0/2/0/2_1394627.jpg)