I am designing reversible logic gates and multiplier circuit using those gates. I have to calculate quantum cost for multiplier. Can anyone suggest some solution?
you have to look at quantum diagram of Toffoli gate/Feynman gate/Peres gate. you will get to see primary gates like v,v+,CNOT gates. count the number of primary gates which will give u the cost, since cost of primary gates is equal to 1, count itself is quantum cost of that gate.
Possible in both Revkit and RCviewer+ tool. In Revkit truth table to quantum circuit possible and in case of RCviewer optimization of quantum circuit is possible. That additional feature is possible in RCviewer but code written in ..tfc format.
That is why i said, i assumed the last twist is a swap gate. Since in the paper it is only two Feynman gates (CNOT), just remove (f2 b,c) in the tfc file and the quantum cost would be 2 as Jayashree hv mentioned.
So, if a propose a new gate in which there is cris cross of outputs at the end in order to achieve reversibility, i need not to consider that amount of cost.
Can you please attach the reference of authors where the above statement can be cited.....(According to authors, there is no swap gate, they are hardwired in such a way to Cris Cross outputs)...
How to relate the quantum cost of a reversible circuit ( say 8x8 multiplier) to that of the power dissipated by the equivalent CMOS circuit? How do we quantify the energy saved in respect of the circuit built using RGs?
Sir, I can’t understand the quantum representation of these attached gates. Can you please help me how the quantum representation (how to draw) and minimum quantum cost of these two gates?
Quantum cost is basically number of primitive reversible gates such as C-NOT, V-gate, V+ , and NOT gate ( both 2x2 as well as 1x1 ) utilized in constructing a quantum circuit.
Quantum cost is counting the number of primitives gate in the quantum circuit. But certain condition must be met to evaluate the quantum cost like design must be reversible, equal input and output, no feedback path, and loops.