Method of automatic synthesis of sequential quantum Boolean circuits

A method of automatic synthesis of sequential quantum Boolean circuits, which is used to transfer a self-timed circuit into a sequential quantum Boolean circuit and synthesize the sequential quantum Boolean circuit, the method comprising the steps of:

• (A) transferring the self-timed circuit into a state graph having M state nodes, wherein each node in the state graph of the self-timed circuit represents one state of the self-timed circuit, each state of the self-timed circuit is labeled with a state binary code <s(1), s(2), . . . , s(n)>, the state binary code is formed by an input binary code function and an output binary code function and the value of s(i)ε{0,1}, the self-timed circuit has m-bits input and n-bits output, and the state binary code is ib(i)+ob(i), where + denotes a concatenation, ib(i) and ob(i) are the input and output binary codes function of a node i corresponding to a state of the self-timed circuit respectively, ib(i)ε{0,1}m and ob(i)ε{0,1}n, and M is an integer;
• (B) determining whether the state graph is reversible;
• (C) encoding the M state nodes by using a unique state encoding when step (B) decides that the state graph is reversible, and producing a unique state coding reversible state graph;
• (D) transferring the unique state coding reversible state graph (USCRSG) into a corresponding self-timed transformation graph;
• (E) performing a state decomposition on the self-timed transformation graph and producing a decomposed self-timed transformation graph;
• and
• (F) constructing a quantum Boolean circuit of the decomposed self-timed transformation graph.