Hawash, M., Perkowski, M., Bleiler, S., Caughman, J. and Hawash, A. (2011) Reversible Function Synthesis of Large Reversible Functions with No Ancillary Bits Using Covering Set Partitions. 2011 Eighth International Conference on Information Technology: New Generations, Las Vegas, 11-13 April 2011, 1008-1013.
https://doi.org/10.1109/ITNG.2011.174

has been cited by the following article:

• TITLE: One Hot Encoding Synthesis of Quantum Automata from Flowcharts

  AUTHORS: Yuchen Huang, Marek Perkowski

  KEYWORDS: Flowchart, Automata, Synthesis, State, Quantum Circuit, Reversible Logic

  JOURNAL NAME: Journal of Quantum Information Science, Vol.13 No.3, September 20, 2023

  ABSTRACT: We present a new approach to the synthesis of quantum automata. In previous research, reversible quantum automata were designed from tabular specifications or state graphs, and minimum length codes, which lead to circuits with Toffoli gates with high numbers of inputs and thus to high quantum costs. This paper is the first to present a method to synthesize Sequential Quantum Circuits directly from flowcharts. In this paper, we directly map flowcharts to reversible/quantum circuits, using only inverters, 2*2 Feynman gates and 3*3 Toffoli gates, and thus reducing quantum costs. Our method has been confirmed by experiments on several benchmarks of practical flowcharts.