Reasoning about Cardinal Directions between Extended Objects (2009)
Zhang, Xiaotong, Liu, Weiming, Li, Sanjiang, Ying, Mingsheng
Direction relations between extended spatial objects are important commonsense knowledge. Recently, Goyal and Egenhofer proposed a formal model, known as Cardinal Direction Calculus (CDC), for...
The Perfect Distinguishability of Quantum Operations (2009)
Duan, Runyao, Feng, Yuan, Ying, Mingsheng
We provide a feasible necessary and sufficient condition for when an unknown quantum operation (quantum device) secretely selected from a set of known quantum operations can be identified perfectly...
Optimal Simulation of a Perfect Entangler (2009)
Yu, Nengkun, Duan, Runyao, Ying, Mingsheng
A $2\otimes 2$ unitary operation is called a perfect entangler if it can generate a maximally entangled state from some unentangled input. We study the following question: How many runs of a given...
Hoare Logic for Quantum Programs (2009)
Hoare logic is a foundation of axiomatic semantics of classical programs and it provides effective proof techniques for reasoning about correctness of classical programs. To offer similar techniques...
decomposable voting rules (2008)
Lirong Xia, Jérôme Lang, Mingsheng Ying
Settling the neutrality and efficiency of
Sequential voting rules and multiple elections paradoxes. TARK (2008)
Lirong Xia, Jérôme Lang, Paul Sabatier, Mingsheng Ying
Multiple election paradoxes arise when voting separately on each issue from a set of related issues results in an obviously undesirable outcome. Several authors have argued that a sufficient...
Ancilla-Assisted Discrimination of Quantum Gates (2008)
Chen, Jianxin, Ying, Mingsheng
The intrinsic idea of superdense coding is to find as many gates as possible such that they can be perfectly discriminated. In this paper, we consider a new scheme of discrimination of quantum gates,...
Feng, Yuan, Duan, Runyao, Ying, Mingsheng
Multipartite quantum states that cannot be uniquely determined by their reduced states of all proper subsets of the parties exhibit some inherit `high-order' correlation. This paper elaborates this...
Perfect many-to-one teleportation with stabilizer states (2007)
Wang, Guoming, Ying, Mingsheng
We study the possibility of performing perfect teleportation of unknown quantum states from multiple senders to a single receiver with a previously shared stabilizer state. In the model we...
Deterministic distributed dense coding with stabilizer states (2007)
Wang, Guoming, Ying, Mingsheng
We consider the possibility of using stabilizer states to perform deterministic dense coding among multiple senders and a single receiver. In the model we studied, the utilized stabilizer state is...
The LU-LC conjecture is false (2007)
Ji, Zhengfeng, Chen, Jianxin, Wei, Zhaohui, Ying, Mingsheng
The LU-LC conjecture is an important open problem concerning the structure of entanglement of states described in the stabilizer formalism. It states that two local unitary equivalent stabilizer...
Locally Indistinguishable Subspaces Spanned by Three-Qubit Unextendible Product Bases (2007)
Duan, Runyao, Xin, Yu, Ying, Mingsheng
We study the local distinguishability of general multi-qubit states and show that local projective measurements and classical communication are as powerful as the most general local measurements and...
An Algebra of Quantum Processes (2007)
Ying, Mingsheng, Feng, Yuan, Duan, Runyao
We introduce an algebra qCCS of pure quantum processes in which no classical data is involved, communications by moving quantum states physically are allowed, and computations is modeled by...
Local Distinguishability of Multipartite Unitary Operations (2007)
Duan, Runyao, Feng, Yuan, Ying, Mingsheng
We show that any two different unitary operations acting on an arbitrary multipartite quantum system can be perfectly distinguishable by local operations and classical communication when a finite...
Distinguishability of Quantum States by Separable Operations (2007)
Duan, Runyao, Feng, Yuan, Xin, Yu, Ying, Mingsheng
We study the distinguishability of multipartite quantum states by separable operations. We first present a necessary and sufficient condition for a finite set of orthogonal quantum states to be...
Soft constraint abstraction based on semiring homomorphism (2007)
The semiring-based constraint satisfaction problems (semiring CSPs), proposed by Bistarelli, Montanari and Rossi \cite{BMR97}, is a very general framework of soft constraints. In this paper we...
Existence of Universal Entangler (2007)
Chen, Jianxin, Duan, Runyao, Ji, Zhengfeng, Ying, Mingsheng, Yu, Jun
A gate is called entangler if it transforms some (pure) product states to entangled states. A universal entangler is a gate which transforms all product states to entangled states. In practice, a...
Multipartite unlockable bound entanglement in the stabilizer formalism (2007)
Wang, Guoming, Ying, Mingsheng
We find an interesting relationship between multipartite bound entangled states and the stabilizer formalism. We prove that if a set of commuting operators from the generalized Pauli group on $n$...
Linearity and Quantum Adiabatic Theorem (2007)
We show that in a quantum adiabatic evolution, even though the adiabatic approximation is valid, the total phase of the final state indicated by the adiabatic theorem may evidently differ from the...
Duan, Runyao, Feng, Yuan, Ji, Zhengfeng, Ying, Mingsheng
We show that an arbitrary basis of a multipartite quantum state space consisting of $K$ distant parties such that the $k$th party has local dimension $d_k$ always contains at least $N=\sum_{k=1}^K...
Discrimination between pure states and mixed states (2006)
Zhang, Chi, Wang, Guoming, Ying, Mingsheng
In this paper, we discuss the problem of determining whether a quantum system is in a pure state, or in a mixed state. We apply two strategies to settle this problem: the unambiguous discrimination...
Parameter estimation of quantum channels (2006)
Ji, Zhengfeng, Wang, Guoming, Duan, Runyao, Feng, Yuan, Ying, Mingsheng
The efficiency of parameter estimation of quantum channels is studied in this paper. We introduce the concept of programmable parameters to the theory of estimation. It is found that programmable...
Wang, Guoming, Ying, Mingsheng
We propose a scheme that can realize a class of positive-operator-valued measures (POVMs) by performing a sequence of projective measurements on the original system, in the sense that for an...
Universal programmable devices for unambiguous discrimination (2006)
We discuss the problem of designing unambiguous programmable discriminators for any $n$ unknown quantum states in an $m$-dimensional Hilbert space. The discriminator is a fixed measurement which has...
Majorization in Quantum Adiabatic Algorithms (2006)
We study the Majorization arrow in a big class of quantum adiabatic algorithms. In a quantum adiabatic algorithm, the ground state of the Hamiltonian is a guide state around which the actual state...
Loop is a powerful program construct in classical computation, but its power is still not exploited fully in quantum computation. The exploitation of such power definitely requires a deep...
Probabilistic Automata for Computing with Words (2006)
Cao, Yongzhi, Xia, Lirong, Ying, Mingsheng
Usually, probabilistic automata and probabilistic grammars have crisp symbols as inputs, which can be viewed as the formal models of computing with values. In this paper, we first introduce...
Retraction and Generalized Extension of Computing with Words (2006)
Cao, Yongzhi, Ying, Mingsheng, Chen, Guoqing
Fuzzy automata, whose input alphabet is a set of numbers or symbols, are a formal model of computing with values. Motivated by Zadeh's paradigm of computing with words rather than numbers, Ying...
Quantum adiabatic evolutions that can't be used to design efficient algorithms (2006)
Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial...
Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations (2006)
Duan, Runyao, Feng, Yuan, Ying, Mingsheng
We show that a unitary operation (quantum circuit) secretely chosen from a finite set of unitary operations can be determined with certainty by sequentially applying only a finite amount of runs of...
Boundary effect of deterministic dense coding (2006)
Ji, Zhengfeng, Feng, Yuan, Duan, Runyao, Ying, Mingsheng
We present a rigorous proof of an interesting boundary effect of deterministic dense coding first observed by Mozes et al. [Phys. Rev. A 71, 012311 (2005)]. Namely, it is shown that $d^2-1$ cannot be...
Identification and Distance Measures of Measurement Apparatus (2006)
Ji, Zhengfeng, Feng, Yuan, Duan, Runyao, Ying, Mingsheng
We propose simple schemes that can perfectly identify projective measurement apparatus secretly chosen from a finite set. Entanglements are used in these schemes both to make possible the perfect...
Probabilistic bisimilarities between quantum processes (2006)
Feng, Yuan, Duan, Runyao, Ji, Zhengfeng, Ying, Mingsheng
Modeling and reasoning about concurrent quantum systems is very important both for distributed quantum computing and for quantum protocol verification. As a consequence, a general framework...
Unambiguous discrimination among quantum operations (2005)
Wang, Guoming, Ying, Mingsheng
We address the problem of unambiguous discrimination among a given set of quantum operations. The necessary and sufficient condition for them to be unambiguously distinguishable is derived in the...
Optimal universal programmable detectors for unambiguous discrimination (2005)
Zhang, Chi, Ying, Mingsheng, Qiao, Bo
We discuss the problem of designing unambiguous programmable discriminators for any n unknown quantum states in an m-dimensional Hilbert space. The discriminator is a fixed measurement that has two...
A modified quantum adiabatic evolution for the Deutsch-Jozsa problem (2005)
Deutsch-Jozsa algorithm has been implemented via a quantum adiabatic evolution by S. Das et al. [Phys. Rev. A 65, 062310 (2002)]. This adiabatic algorithm gives rise to a quadratic speed up over...
State-Based Control of Fuzzy Discrete Event Systems (2005)
Cao, Yongzhi, Ying, Mingsheng, Chen, Guoqing
To effectively represent possibility arising from states and dynamics of a system, fuzzy discrete event systems as a generalization of conventional discrete event systems have been introduced...
Proof rules for purely quantum programs (2005)
Feng, Yuan, Duan, Runyao, Ji, Zhengfeng, Ying, Mingsheng
We apply the notion of quantum predicate proposed by D'Hondt and Panangaden to analyze a purely quantum language fragment which describes the quantum part of a future quantum computer in Knill's...
Relational reasoning in the region connection calculus (2005)
Li, Yongming, Li, Sanjiang, Ying, Mingsheng
This paper is mainly concerned with the relation-algebraical aspects of the well-known Region Connection Calculus (RCC). We show that the contact relation algebra (CRA) of certain RCC model is not...
A relation between fidelity and quantum adiabatic evolution (2005)
Recently, some quantum algorithms have been implemented by quantum adiabatic evolutions. In this paper, we discuss the accurate relation between the running time and the distance of the initial state...
Local cloning of two product states (2005)
Ji, Zhengfeng, Feng, Yuan, Ying, Mingsheng
Local quantum operations and classical communication (LOCC) put considerable constraints on many quantum information processing tasks such as cloning and discrimination. Surprisingly however,...
Quantum search algorithm by adiabatic evolution under a priori probability (2004)
Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been...
Duan, Runyao, Feng, Yuan, Ying, Mingsheng
We show that two ways of manipulation of quantum entanglement, namely, entanglement-assisted local transformation [D. Jonathan and M. B. Plenio, Phys. Rev. Lett. {\bf 83}, 3566 (1999)] and...
Similarity-Based Supervisory Control of Discrete Event Systems (2004)
Due to the appearance of uncontrollable events in discrete event systems, one may wish to replace the behavior leading to the uncontrollability of pre-specified language by some quite similar one. To...
Efficiency of Deterministic Entanglement Transformation (2004)
Duan, Runyao, Feng, Yuan, Ji, Zhengfeng, Ying, Mingsheng
We prove that sufficiently many copies of a bipartite entangled pure state can always be transformed into some copies of another one with certainty by local quantum operations and classical...
Optimal conclusive discrimination of two states can be achieved locally (2004)
Ji, Zhengfeng, Cao, Hongen, Ying, Mingsheng
This paper constructs a LOCC protocol that achieves the global optimality in conclusive discrimination of any two states with arbitrary a priori probability. This can be interpreted that there is no...
Comparability of multipartite entanglement (2004)
Ji, Zhengfeng, Duan, Runyao, Ying, Mingsheng
We prove, in a multipartite setting, that it's always feasible to exactly transform a genuinely $m$-partite entangled state with sufficient many copies to any other $m$-partite state via local...
Observability and Decentralized Control of Fuzzy Discrete Event Systems (2004)
Fuzzy discrete event systems as a generalization of (crisp) discrete event systems have been introduced in order that it is possible to effectively represent uncertainty, imprecision, and vagueness...
Supervisory Control of Fuzzy Discrete Event Systems (2004)
In order to cope with situations in which a plant's dynamics are not precisely known, we consider the problem of supervisory control for a class of discrete event systems modelled by fuzzy automata....
Catalyst-assisted Probabilistic Entanglement Transformation (2004)
Feng, Yuan, Duan, Runyao, Ying, Mingsheng
We are concerned with catalyst-assisted probabilistic entanglement transformations. A necessary and sufficient condition is presented under which there exist partial catalysts that can increase the...
Multiple-copy entanglement transformation and entanglement catalysis (2004)
Duan, Runyao, Feng, Yuan, Li, Xin, Ying, Mingsheng
We prove that any multiple-copy entanglement transformation [S. Bandyopadhyay, V. Roychowdhury, and U. Sen, Phys. Rev. A \textbf{65}, 052315 (2002)] can be implemented by a suitable...
Duan, Runyao, Feng, Yuan, Ying, Mingsheng
We examine the powers of entanglement-assisted transformation and multiple-copy entanglement transformation. First, we find a sufficient condition of when a given catalyst is useful in producing...
Partial Recovery of Quantum Entanglement (2004)
Duan, Runyao, Feng, Yuan, Ying, Mingsheng
Suppose Alice and Bob try to transform an entangled state shared between them into another one by local operations and classical communications. Then in general a certain amount of entanglement...
A Theory of Computation Based on Quantum Logic (I) (2004)
The (meta)logic underlying classical theory of computation is Boolean (two-valued) logic. Quantum logic was proposed by Birkhoff and von Neumann as a logic of quantum mechanics more than sixty years...
When Catalysis is Useful for Probabilistic Entanglement Transformation (2004)
Feng, Yuan, Duan, Runyao, Ying, Mingsheng
We determine all $2\times 2$ quantum states that can serve as useful catalysts for a given probabilistic entanglement transformation, in the sense that they can increase the maximal transformation...
Unambiguous discrimination between quantum mixed states (2004)
Feng, Yuan, Duan, Runyao, Ying, Mingsheng
We prove that the states secretly chosen from a mixed state set can be perfectly discriminated if and only if these states are orthogonal. The sufficient and necessary condition when nonorthogonal...
Feng, Yuan, Duan, Runyao, Ying, Mingsheng
We show that in some cases, catalyst-assisted entanglement transformation cannot be implemented by multiple-copy transformation for pure states. This fact, together with the result we obtained in [R....
Trade-off between multiple-copy transformation and entanglement catalysis (2003)
Duan, Runyao, Feng, Yuan, Li, Xin, Ying, Mingsheng
We demonstrate that multiple copies of a bipartite entangled pure state may serve as a catalyst for certain entanglement transformations while a single copy cannot. Such a state is termed a...
The Existence of Quantum Entanglement Catalysts (2003)
Sun, Xiaoming, Duan, Runyao, Ying, Mingsheng
Without additional resources, it is often impossible to transform one entangled quantum state into another with local quantum operations and classical communication. Jonathan and Plenio [Phys. Rev....
Quantum operation, quantum Fourier transform and semi-definite programming (2003)
Duan, Runyao, Ji, Zhengfeng, Feng, Yuan, Ying, Mingsheng
We analyze a class of quantum operations based on a geometrical representation of $d-$level quantum system (or qudit for short). A sufficient and necessary condition of complete positivity, expressed...
On probalistic normed spaces under ÄT,L (1990)
We introduce the operation ⊛L copulative with ÄT,L to define PN space under ÄT,L and establish some basic properties of probabilistic seminorms and norms under...
On probalistic normed spaces under τT,L (1990)
We introduce the operation ⊛L copulative with τT,L to define PN space under τT,L and establish some basic properties of probabilistic seminorms and norms under τT,L. Finally, we discuss...