Paper-Conference

An Iterative Decision-Making Scheme for Markov Decision Processes and Its Application to Self-adaptive Systems
Software is often governed by and thus adapts to phenomena that occur at runtime. Unlike traditional decision problems, where a …
Guoxin Su, Taolue Chen, Yuan Feng, David S. Rosenblum, P. S. Thiagarajan
引用
Classical verification of quantum proofs
We present a classical interactive protocol that verifies the validity of a quantum witness state for the local Hamiltonian problem. It …
引用 DOI URL
Quantum capacities for entanglement networks
Shawn X Cui, Zhengfeng Ji, Nengkun Yu, Bei Zeng
引用 DOI
Sample-optimal tomography of quantum states
It is a fundamental problem to decide how many copies of an unknown mixed quantum state are necessary and sufficient to determine the …
Jeongwan Haah, Aram W. Harrow, Zhengfeng Ji, Xiaodi Wu, Nengkun Yu
引用 DOI URL
Verify LTL with Fairness Assumptions Efficiently
Yong Li, Lei Song, Yuan Feng, Lijun Zhang
引用 DOI
Zero-Knowledge Proof Systems for QMA
Anne Broadbent, Zhengfeng Ji, Fang Song, John Watrous
引用 DOI
QPMC: A Model Checker for Quantum Programs and Protocols
We present QPMC(Quantum Program/Protocol Model Checker), an extension of the probabilistic model checker IscasMC to automatically …
Yuan Feng, Ernst Moritz Hahn, Andrea Turrini, Lijun Zhang
引用
(Un)decidable Problems about Reachability of Quantum Systems
We study the reachability problem of a quantum system modeled by a quantum automaton, namely, a set of processes each of which is …
Yangjia Li, Mingsheng Ying
引用
Perturbation Analysis in Verification of Discrete-Time Markov Chains
Perturbation analysis in probabilistic verification addresses the robustness and sensitivity problem for verification of stochastic …
Taolue Chen, Yuan Feng, David S. Rosenblum, Guoxin Su
引用
When Equivalence and Bisimulation Join Forces in Probabilistic Automata
Probabilistic automata were introduced by Rabin in 1963 as language acceptors. Two automata are equivalent if and only if they accept …
Yuan Feng, Lijun Zhang
引用