arXiv Analytics

Sign in

arXiv:quant-ph/0607166AbstractReferencesReviewsResources

Techniques for the Synthesis of Reversible Toffoli Networks

D. Maslov, D. M. Miller, G. W. Dueck

Published 2006-07-24Version 1

This paper presents novel techniques for the synthesis of reversible networks of Toffoli gates, as well as improvements to previous methods. Gate count and technology oriented cost metrics are used. Our synthesis techniques are independent of the cost metrics. Two new iterative synthesis procedure employing Reed-Muller spectra are introduced and shown to complement earlier synthesis approaches. The template simplification suggested in earlier work is enhanced through introduction of a faster and more efficient template application algorithm, updated (shorter) classification of the templates, and presentation of the new templates of sizes 7 and 9. A novel ``resynthesis'' approach is introduced wherein a sequence of gates is chosen from a network, and the reversible specification it realizes is resynthesized as an independent problem in hopes of reducing the network cost. Empirical results are presented to show that the methods are effective both in terms of the realization of all 3x3 reversible functions and larger reversible benchmark specifications.

Comments: 20 pages, 5 figures
Journal: ACM Transactions on Design Automation of Electronic Systems 12(4), Article 42, September 2007
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:0906.1032 [quant-ph] (Published 2009-06-05)
Protocols and Techniques for a Scalable Atom--Photon Quantum Network
L. Luo et al.
arXiv:1911.09039 [quant-ph] (Published 2019-11-20)
Techniques to reduce $π/4$-parity phase circuits, motivated by the ZX calculus
arXiv:quant-ph/0005003 (Published 2000-04-29, updated 2001-07-06)
Introduction to Quantum Algorithms