IJMLC 2014 Vol.4(1): 10-13 ISSN: 2010-3700
DOI: 10.7763/IJMLC.2014.V4.378

An Algorithm for Synthesis of Quantum Reversible Logic Circuits Based on Decomposition

Li Dan, Xu Fanjiang, Zhao Junsuo, and Zhang Wenjun

Abstract—Until today, we have not found a general and effective algorithm for synthesis, especially to multi-variables quantum circuit. This is an important question needed to be resolved, because it can not only reduce the cost of manufacture quantum circuit, but also optimize many quantum algorithms. For a quantum circuit which contains N quantum bits, the latitude of the matrix is 2n to realize its function. If we directly design the circuits of the matrix, the workload is huge. Want to reduce the dimensions of the matrix, but also to ensure the unitary of matrix after decomposing, so it is need to use Kronecker product.

Index Terms—Decompose, unitary, kronecker product

The authors are with the Science and Technology on Integrated Information System Laboratory, Institute of Software Chinese Academy of Sciences, Beijing, China (e-mail: lidan@iscas.ac.cn, fanjiang@iscas.ac.cn, junsuo@iscas.ac.cn, wenjun@iscas.ac.cn).


Cite:Li Dan, Xu Fanjiang, Zhao Junsuo, and Zhang Wenjun, "An Algorithm for Synthesis of Quantum Reversible Logic Circuits Based on Decomposition," International Journal of Machine Learning and Computing vol.4, no. 1, pp. 10-13, 2014.

General Information

  • ISSN: 2010-3700 (Online)
  • Abbreviated Title: Int. J. Mach. Learn. Comput.
  • Frequency: Bimonthly
  • DOI: 10.18178/IJMLC
  • Editor-in-Chief: Dr. Lin Huang
  • Executive Editor:  Ms. Cherry L. Chen
  • Abstracing/Indexing: Scopus (since 2017), EI (INSPEC, IET), Google Scholar, Crossref, ProQuest, Electronic Journals Library.
  • E-mail: ijmlc@ejournal.net