Quantum computation and quantum information
Quantum computation and quantum information
RevLib: An Online Resource for Reversible Functions and Reversible Circuits
ISMVL '08 Proceedings of the 38th International Symposium on Multiple Valued Logic
Equivalence Checking of Reversible Circuits
ISMVL '09 Proceedings of the 2009 39th International Symposium on Multiple-Valued Logic
Elementary Quantum Gate Realizations for Multiple-Control Toffoli Gates
ISMVL '11 Proceedings of the 2011 41st IEEE International Symposium on Multiple-Valued Logic
Hybrid GF(2) --- boolean expressions ..for quantum computing circuits
RC'11 Proceedings of the Third international conference on Reversible Computation
Considering nearest neighbor constraints of quantum circuits at the reversible circuit level
Quantum Information Processing
| Hi-index | 0.00 |
Mapping a circuit of reversible gates to a circuit of elementary quantum gates is a key step in synthesizing quantum realizations of Boolean functions. The library containing NOT, controlled-NOT and controlled square-root-of-NOT gates has been considered extensively. In this paper, we extend the library to include fourth-root-of-NOT gates. Experimental results using REVLIB benchmark circuits show that using this extended library results in smaller quantum circuits.