Article-Journal

Characterizations of quantum automata
We define q quantum finite automata (qQFAs) and q quantum regular grammars (qQRGs), and verify that they are exactly equivalent to …
Daowen Qiu, Mingsheng Ying
引用 DOI URL
Comparability of multipartite entanglement
We prove, in a multipartite setting, that it is always feasible to exactly transform a genuinely m-partite entangled pure state with …
引用 DOI URL
Generalized Region Connection Calculus
The Region Connection Calculus (RCC) is one of the most widely referenced system of high-level (qualitative) spatial reasoning. RCC …
Sanjiang Li, Mingsheng Ying
引用 DOI URL
Local discrimination of maximally entangled states in canonical form
It is shown that two copies are enough to distinguish a complete basis of maximally entangled states in canonical form by constructing …
Hongen Cao, Mingsheng Ying
引用 DOI URL
Quantum operation, quantum Fourier transform and semi-definite programming
We analyze a class of quantum operations based on a geometrical representation of d-level quantum system (or qudit for short). A …
引用 DOI URL
Reasoning about probabilistic sequential programs in a probabilistic logic
We introduce a notion of strong monotonicity of probabilistic predicate transformers. This notion enables us to establish a normal form …
引用 DOI URL
Extensionality of the RCC8 Composition Table
This paper is mainly concerned with the RCC8 composition table entailed by the Region Connection Calculus (RCC), a well-known formalism …
Sanjiang Li, Mingsheng Ying
引用 DOI URL
Region Connection Calculus: Its models and composition table
Originating in Allen’s analysis of temporal relations, the notion of composition table has become a key technique in providing an …
Sanjiang Li, Mingsheng Ying
引用 DOI URL
Lower bound on inconclusive probability of unambiguous discrimination
Yuan Feng, Shengyu Zhang, Runyao Duan, Mingsheng Ying
引用 DOI URL
Set discrimination of quantum states
Shengyu Zhang, Mingsheng Ying
引用 DOI URL