arXiv subjects

Mingsheng Ying

Publications and source records attributed to Mingsheng Ying.

At least 145 records · Page 8Linked to original sources

arXiv2007

Deterministic distributed dense coding with stabilizer states

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 partitioned into several subsystems and then each subsystem is held by a distinct party. We present a sufficient condition for a stabilizer state to be useful for deterministic distributed dense coding with respect to a given partition plan. The corresponding protocol is also constructed. Furthermore, we propose a method to partially solve a more general problem of finding the set of achievable alphabet sizes for an arbitrary stabilizer state with respect to an arbitrary partition plan. Finally, our work provides a new perspective from the stabilizer formalism to view the standard dense coding protocol and also unifies several previous results in a single framework.

quant-ph↗

arXiv2007

Perfect many-to-one teleportation with stabilizer states

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 considered, the utilized stabilizer state is partitioned into several subsystems and then each subsystem is distributed to a distinct party. We present two sufficient conditions for a stabilizer state to achieve a given nonzero teleportation capacity with respect to a given partition plan. The corresponding teleportation protocols are also explicitly given. Interestingly, we find that even mixed stabilizer states are also useful for perfect many-to-one teleportation. Finally, our work provides a new perspective from stabilizer formalism to view the standard teleportation protocol and also suggests a new technique for analyzing teleportation capability of multipartite entangled states.

quant-ph↗

arXiv2007

Distinguishability of Quantum States by Separable Operations

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 distinguishable by separable operations. An analytical version of this condition is derived for the case of $(D-1)$ pure states, where $D$ is the total dimension of the state space under consideration. A number of interesting consequences of this result are then carefully investigated. Remarkably, we show there exists a large class of $2\otimes 2$ separable operations not being realizable by local operations and classical communication. Before our work only a class of $3\otimes 3$ nonlocal separable operations was known [Bennett et al, Phys. Rev. A \textbf{59}, 1070 (1999)]. We also show that any basis of the orthogonal complement of a multipartite pure state is indistinguishable by separable operations if and only if this state cannot be a superposition of 1 or 2 orthogonal product states, i.e., has an orthogonal Schmidt number not less than 3, thus generalize the recent work about indistinguishable bipartite subspaces [Watrous, Phys. Rev. Lett. \textbf{95}, 080505 (2005)]. Notably, we obtain an explicit construction of indistinguishable subspaces of dimension 7 (or 6) by considering a composite quantum system consisting of two qutrits (resp. three qubits), which is slightly better than the previously known indistinguishable bipartite subspace with dimension 8.

quant-ph↗

arXiv2007

Distinguishing Arbitrary Multipartite Basis Unambiguously Using Local Operations and Classical Communication

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 (d_k-1)+1$ members that are unambiguously distinguishable using local operations and classical communication (LOCC). We further show this lower bound is optimal by analytically constructing a special product basis having only $N$ members unambiguously distinguishable by LOCC. Interestingly, such a special product basis not only gives a stronger form of the weird phenomenon ``nonlocality without entanglement", but also implies the existence of locally distinguishable entangled basis.

quant-ph↗

arXiv2007

Multipartite unlockable bound entanglement in the stabilizer formalism

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$ qudits satisfy certain constraints, then the maximally mixed state over the subspace stabilized by them is an unlockable bound entangled state. Moreover, the properties of this state, such as symmetry under permutations of parties, undistillability and unlockability, can be easily explained from the stabilizer formalism without tedious calculation. In particular, the four-qubit Smolin state and its recent generalization to even number of qubits can be viewed as special examples of our results. Finally, we extend our results to arbitrary multipartite systems in which the dimensions of all parties may be different.

quant-ph↗

arXiv2007

Existence of Universal Entangler

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 universal entangler is a very powerful device for generating entanglements, and thus provides important physical resources for accomplishing many tasks in quantum computing and quantum information. This Letter demonstrates that a universal entangler always exists except for a degenerated case. Nevertheless, the problem how to find a universal entangler remains open.

quant-ph↗

arXiv2007

Local Distinguishability of Multipartite Unitary Operations

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 number of runs is allowed. We then directly extend this result into the case when the number of unitary operations to be discriminated is more than two. Intuitively, our result means that the lost identity of a nonlocal (entangled) unitary operation can be recovered locally, without any use of entanglement or joint quantum operations.

quant-ph↗

arXiv2007

Soft constraint abstraction based on semiring homomorphism

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 propose an abstraction scheme for soft constraints that uses semiring homomorphism. To find optimal solutions of the concrete problem, the idea is, first working in the abstract problem and finding its optimal solutions, then using them to solve the concrete problem. In particular, we show that a mapping preserves optimal solutions if and only if it is an order-reflecting semiring homomorphism. Moreover, for a semiring homomorphism $α$ and a problem $P$ over $S$, if $t$ is optimal in $α(P)$, then there is an optimal solution $\bar{t}$ of $P$ such that $\bar{t}$ has the same value as $t$ in $α(P)$.

cs.AI↗

arXiv2007

Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations

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 the unknown circuit. No entanglement or joint quantum operations is required in our scheme. We further show that our scheme is optimal in the sense that the number of the runs is minimal when discriminating only two unitary operations.

quant-ph↗

arXiv2007

Linearity and Quantum Adiabatic Theorem

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 actual total phase. This invalidates the application of the linearity and the adiabatic approximation simultaneously. Besides, based on this observation we point out the mistake in the traditional proof for the adiabatic theorem. This mistake is the root of the troubles that the adiabatic theorem has met. We also show that a similar mistake remains in some recent modifications of the traditional adiabatic theorem attempting to eliminate the troubles.

quant-ph↗

arXiv2007

Partial Recovery of Quantum Entanglement

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 contained in the initial state will decrease in the process of transformation. However, an interesting phenomenon called partial entanglement recovery shows that it is possible to recover some amount of entanglement by adding another entangled state and transforming the two entangled states collectively. In this paper we are mainly concerned with the feasibility of partial entanglement recovery. The basic problem we address is whether a given state is useful in recovering entanglement lost in a specified transformation. In the case where the source and target states of the original transformation satisfy the strict majorization relation, a necessary and sufficient condition for partial entanglement recovery is obtained. For the general case we give two sufficient conditions. We also give an efficient algorithm for the feasibility of partial entanglement recovery in polynomial time. As applications, we establish some interesting connections between partial entanglement recovery and the generation of maximally entangled states, quantum catalysis, mutual catalysis, and multiple-copy entanglement transformation.

quant-ph↗

arXiv2007

Discrimination between pure states and mixed states

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 and the maximum confidence discrimination. We also proved that the optimal versions of both strategies are equivalent. The efficiency of the discrimination is also analyzed. This scheme also provides a method to estimate purity of quantum states, and Schmidt numbers of composed systems.

quant-ph↗

arXiv2007

Quantum loop programs

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 understanding of the mechanism of quantum loop programs. In this paper, we introduce a general scheme of quantum loops and describe its computational process. The notions of termination and almost termination are proposed for quantum loops, and the function computed by a quantum loop is defined. To show their expressive power, quantum loops are applied in describing quantum walks. Necessary and sufficient conditions for termination and almost termination of a general quantum loop on any mixed input state are presented. A quantum loop is said to be (almost) terminating if it (almost) terminates on any input state. We show that a quantum loop is almost terminating if and only if it is uniformly almost terminating. It is observed that a small disturbance either on the unitary transformation in the loop body or on the measurement in the loop guard can make any quantum loop (almost) terminating. Moreover, a representation of the function computed by a quantum loop is given in terms of finite summations of matrices. To illustrate the notions and results obtained in this paper, two simplest classes of quantum loop programs, one qubit quantum loops, and two qubit quantum loops defined by controlled gates, are carefully examined.

quant-ph↗

arXiv2006

Retraction and Generalized Extension of Computing with Words

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 proposed a kind of fuzzy automata, whose input alphabet consists of all fuzzy subsets of a set of symbols, as a formal model of computing with all words. In this paper, we introduce a somewhat general formal model of computing with (some special) words. The new features of the model are that the input alphabet only comprises some (not necessarily all) fuzzy subsets of a set of symbols and the fuzzy transition function can be specified arbitrarily. By employing the methodology of fuzzy control, we establish a retraction principle from computing with words to computing with values for handling crisp inputs and a generalized extension principle from computing with words to computing with all words for handling fuzzy inputs. These principles show that computing with values and computing with all words can be respectively implemented by computing with words. Some algebraic properties of retractions and generalized extensions are addressed as well.

cs.AI↗

arXiv2006

State-Based Control of Fuzzy Discrete Event Systems

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 recently. Supervisory control theory based on event feedback has been well established for such systems. Noting that the system state description, from the viewpoint of specification, seems more convenient, we investigate the state-based control of fuzzy discrete event systems in this paper. We first present an approach to finding all fuzzy states that are reachable by controlling the system. After introducing the notion of controllability for fuzzy states, we then provide a necessary and sufficient condition for a set of fuzzy states to be controllable. We also find that event-based control and state-based control are not equivalent and further discuss the relationship between them. Finally, we examine the possibility of driving a fuzzy discrete event system under control from a given initial state to a prescribed set of fuzzy states and then keeping it there indefinitely.

cs.DM↗

arXiv2006

Relation Between Catalyst-assisted Entanglement Transformation and Multiple-copy Transformation

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. Y. Duan, Y. Feng, X. Li, and M. S. Ying, Phys. Rev. A 71, 042319 (2005)] that the latter can be completely implemented by the former, indicates that catalyst-assisted transformation is strictly more powerful than multiple-copy transformation. For purely probabilistic setting we find, however, these two kinds of transformations are geometrically equivalent in the sense that the sets of pure states which can be converted into a given pure state with maximal probabilities not less than a given value have the same closure, no matter catalyst-assisted transformation or multiple-copy transformation is used.

quant-ph↗

arXiv2006

Optimal universal programmable detectors for unambiguous discrimination

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 kinds of input registers: the program registers and the data register. The quantum state in the data register is what users want to identify, which is confirmed to be among the n states in program registers. The task of the discriminator is to tell the users which state stored in the program registers is equivalent to that in the data register. First, we give a necessary and sufficient condition for judging an unambiguous programmable discriminator. Then, if $m=n$, we present an optimal unambiguous programmable discriminator for them, in the sense of maximizing the worst-case probability of success. Finally, we propose a universal unambiguous programmable discriminator for arbitrary n quantum states.

quant-ph↗

arXiv2006

Realization of positive-operator-valued measures by projective measurements without introducing ancillary dimensions

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 arbitrary input state the probability distribution of the measurement outcomes is faithfully reproduced. A necessary and sufficient condition for a POVM to be realizable in this way is also derived. In contrast to the canonical approach provided by Neumark's theorem, our method has the advantage of requiring no auxiliary system. Moreover, an arbitrary POVM can be realized by utilizing our protocol on an extended space which is formed by adding only a single extra dimension.

quant-ph↗