-This section is responsible for specifying a set of transitions. One transition per line. Notice that the extension name `*.lsta` stands for Level-Synchronized (Nondeterministic Finite) Tree Automata which means that each transition is associated with a nonnegative integer denoting a set of choices in AutoQ. A (bottom-up) transition $f(q_1, q_2, ..., q_n) \to q$ associated with a set of choices $C$ is written as `[f,C](q1, q2, ..., qn) -> q`. Each pair of transitions `[f1,C1](...) -> q` and `[f2,C2](...) -> q` with the same `q` must satisfy $C_1 \& C_2 = 0$. In each layer of all used transitions for an accepted quantum state, the bitwise $\&$ of all used $C$'s must be positive. In this tool, a symbol can only be a positive integer $i$ with arity $2$ for specifying the $i$-th qubit or any expression describing a complex number with arity $0$ for specifying the amplitude of some computational basis states.
0 commit comments