Reversible Pebble Games For Reducing Qubits In Hierarchical Quantum Circuit Synthesis

Hierarchical reversible logic synthesis can find quantum circuits for large combinational functions. The price for a better scalability compared to functional synthesis approaches is the requirement for many additional qubits to store temporary results of the hierarchical input representation. However, implementing a quantum circuit with large number of qubits is a major hurdle. In this paper, we demonstrate and establish how reversible pebble games can be used to reduce the number of stored temporary results, thereby reducing the qubit count. Our proposed algorithm can be constrained with number of qubits, which is aimed to meet. Experimental studies show that the qubit count can be significantly reduced (by up to 63.2%) compared to the slate-of-the-art algorithms, at the cost of additional gate count.


Published in:
2019 Ieee 49Th International Symposium On Multiple-Valued Logic (Ismvl), 102-107
Presented at:
49th IEEE International Symposium on Multiple-Valued Logic (ISMVL), Fredericton, CANADA, May 21-23, 2019
Year:
Jan 01 2019
Publisher:
New York, IEEE
ISSN:
0195-623X
ISBN:
978-1-7281-0092-0
Keywords:
Laboratories:




 Record created 2019-09-26, last modified 2020-04-20


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)