6 citations · 8 across the 10 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
cs.LO2011
Simple characterizations for commutativity of quantum weakest preconditions
Tianrong Lin
In a recent letter [Information Processing Letters~104 (2007) 152-158], it has shown some sufficient conditions for commutativity of quantum weakest preconditions. This paper provi…
cs.CC2011
Some results on equivalence of multi-letter quantum finite automata
Tianrong Lin
Two quantum finite automata are equivalent if for all input string over the input alphabet the two automata accept with equal probability. In [Theoret. Comput. Sci. 410 (20…
cs.CC2011★ 6 cited
Another approach to the equivalence of measure-many one-way quantum finite automata and its application
Tianrong Lin
In this paper, we present a much simpler, more direct, and more elegant approach to the equivalence problem for {\it measure-many one-way quantum finite automata} (MM-1QFAs). The a…