One Hot Encoding Synthesis of Quantum Automata from Flowcharts  

作　　者：Yuchen Huang Marek Perkowski Yuchen Huang;Marek Perkowski(Department of Electrical and Computer Engineering, Portland State University, Portland, OR, USA)

机构地区：[1]Department of Electrical and Computer Engineering, Portland State University, Portland, OR, USA

出　　处：《Journal of Quantum Information Science》2023年第3期156-176,共21页量子信息科学期刊（英文）

摘　　要：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.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.

关 键 词：Flowchart AUTOMATA SYNTHESIS STATE Quantum Circuit Reversible Logic 

分 类 号：O41[理学—理论物理]