126 citations · 1.4k across the 81 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.LO2013★ 1 cited
When Equivalence and Bisimulation Join Forces in Probabilistic Automata
Yuan Feng, Lijun Zhang
Probabilistic automata were introduced by Rabin in 1963 as language acceptors. Two automata are equivalent if and only if they accept each word with the same probability. On the ot…
quant-ph2013★ 11 cited
Reachability Probabilities of Quantum Markov Chains
Shenggang Ying, Yuan Feng, Nengkun Yu +1
This paper studies three kinds of long-term behaviours, namely reachability, repeated reachability and persistence, of quantum Markov chains (qMCs). As a stepping-stone, we introdu…
cs.CR2013
Quantum Information-Flow Security: Noninterference and Access Control
Mingsheng Ying, Yuang Feng, Nengkun Yu
Quantum cryptography has been extensively studied in the last twenty years, but information-flow security of quantum computing and communication systems has been almost untouched i…