Searcharxiv⌕ Search

arXiv subjects

Lin Chen

Publications and source records attributed to Lin Chen.

At least 541 records · Page 30Linked to original sources

Equivalence classes and canonical forms for two-qutrit entangled states of rank four having positive partial transpose

Let E' denote the set of non-normalized two-qutrit entangled states of rank four having positive partial transpose (PPT). We show that the set of SLOCC equivalence classes of states in E', equipped with the quotient topology, is homeomorphic to the quotient R/A_5 of the open rectangular box R in the Euclidean space R^4 by an action of the alternating group A_5. We construct an explicit map omega: Omega -> E', where Omega is the open positive orthant in R^4, whose image meets every SLOCC equivalence class E containeed in E'. Although the intersection of the image of omega and E is not necessarily a singleton set, it is always a finite set of cardinality at most 60. By abuse of language, we say that any state in this intersection is a canonical form of states rho in E. In particular, we show that all checkerboard PPT entangled states can be parametrized up to SLOCC equivalence by only two real parameters. We also summarize the known results on two-qutrit extreme PPT states and edge states, and examine which other interesting properties they may have. Thus we find the first examples of extreme PPT states whose rank is different from the rank of its partial transpose.

quant-ph↗

Non-distillable entanglement guarantees distillable entanglement

The monogamy of entanglement is one of the basic quantum mechanical features, which says that when two partners Alice and Bob are more entangled then either of them has to be less entangled with the third party. Here we qualitatively present the converse monogamy of entanglement: given a tripartite pure system and when Alice and Bob are entangled and non-distillable, then either of them is distillable with the third party. Our result leads to the classification of tripartite pure states based on bipartite reduced density operators, which is a novel and effective way to this long-standing problem compared to the means by stochastic local operations and classical communications. Furthermore we systematically indicate the structure of the classified states and generate them. We also extend our results to multipartite states.

quant-ph↗

Joint Rate Adaptation and Medium Access in Wireless LANs: a Non-cooperative Game Theoretic Perspective

Wireless local area networks (WLANs) based on IEEE 802.11 standards are becoming ubiquitous today and typically support multiple data rates. In such multi-rate WLANs, distributed medium access and rate adaptation are two key elements to achieve efficient radio resource utilization, especially in non-cooperative environments. In this paper, we present an analytical study on the non-cooperative multi-rate WLANs composed of selfish users jointly adjusting their data rate and contention window size at the medium access level to maximize their own throughput, irrespective of the impact of their selfish behaviors on overall system performance. Specifically, we develop an adapted Tit-For-Tat (TFT) strategy to guide the system to an efficient equilibrium in non-cooperative environments. We model the interactions among selfish users under the adapted TFT framework as a non-cooperative joint medium access and rate adaptation game. A systematic analysis is conducted on the structural properties of the game to provide insights on the interaction between rate adaptation and 802.11 medium access control in a competitive setting. We show that the game has multiple equilibria, which, after the equilibrium refinement process that we develop, reduce to a unique efficient equilibrium. We further develop a distributed algorithm to achieve this equilibrium and demonstrate that the equilibrium achieves the performance very close to the system optimum in a social perspective.

cs.GT↗

On Optimality of Myopic Policy for Restless Multi-armed Bandit Problem with Non i.i.d. Arms and Imperfect Detection

We consider the channel access problem in a multi-channel opportunistic communication system with imperfect channel sensing, where the state of each channel evolves as a non independent and identically distributed Markov process. This problem can be cast into a restless multi-armed bandit (RMAB) problem that is intractable for its exponential computation complexity. A natural alternative is to consider the easily implementable myopic policy that maximizes the immediate reward but ignores the impact of the current strategy on the future reward. In particular, we develop three axioms characterizing a family of generic and practically important functions termed as $g$-regular functions which includes a wide spectrum of utility functions in engineering. By pursuing a mathematical analysis based on the axioms, we establish a set of closed-form structural conditions for the optimality of myopic policy.

eess.SY↗

Geometric measure of entanglement for pure multipartite states

We provide methods for computing the geometric measure of entanglement for two families of pure states with both experimental and theoretical interests: symmetric multiqubit states with non-negative amplitudes in the Dicke basis and symmetric three-qubit states. In addition, we study the geometric measure of pure three-qubit states systematically in virtue of a canonical form of their two-qubit reduced states, and derive analytical formulae for a three-parameter family of three-qubit states. Based on this result, we further show that the W state is the maximally entangled three-qubit state with respect to the geometric measure.

quant-ph↗

On Optimality of Myopic Sensing Policy with Imperfect Sensing in Multi-channel Opportunistic Access

We consider the channel access problem under imperfect sensing of channel state in a multi-channel opportunistic communication system, where the state of each channel evolves as an independent and identically distributed Markov process. The considered problem can be cast into a restless multi-armed bandit (RMAB) problem that is of fundamental importance in decision theory. It is well-known that solving the RMAB problem is PSPACE-hard, with the optimal policy usually intractable due to the exponential computation complexity. A natural alternative is to consider the easily implementable myopic policy that maximizes the immediate reward but ignores the impact of the current strategy on the future reward. In this paper, we perform an analytical study on the optimality of the myopic policy under imperfect sensing for the considered RMAB problem. Specifically, for a family of generic and practically important utility functions, we establish the closed-form conditions under which the myopic policy is guaranteed to be optimal even under imperfect sensing. Despite our focus on the opportunistic channel access, the obtained results are generic in nature and are widely applicable in a wide range of engineering domains.

cs.NI↗

Band modification in (Ga, Mn)As evidenced by new measurement scheme --- magnetic photoresistance circular dichroism

The expected features of diluted magnetic semiconductors still remain in controversial issue, concerning whether or not s, p-d (f) exchange interactions indeed modify the host semiconductor band structure. To solve this doubt, a new scheme for measuring magneto-optical (MO) effect is developed, called magnetic photoresistance circular dichroism (PR-MCD), which detects the differential photoresistance of materials between two circularly polarized excitations. That allows us to detect the MO effect induced only by interband transitions, and provide unambiguous evidence that the host semiconductor band structure is indeed modified by the strong exchange interactions. Our PR-MCD spectra also disclose intrigue features which may come from strong coupling correlation effect at very high manganese concentration limit.

cond-mat.mtrl-sci↗

Description of rank four PPT entangled states of two qutrits

It is known that some two qutrit entangled states of rank 4 with positive partial transpose [PPT] can be built from the unextendible product bases [UPB]. We show that this fact is indeed universal, namely all such states can be constructed from UPB. We also classify the 5-dimensional subspaces of two qutrits which contain only finitely many product states (up to scalar multiple), and in particular those spanned by a UPB.

quant-ph↗

Distillability and PPT entanglement of low-rank quantum states

It is known that he bipartite quantum states, with rank strictly smaller than the maximum of the ranks of its two reduced states, are distillable by local operations and classical communication. Our first main result is that this is also true for NPT states with rank equal to this maximum. (A state is PPT if the partial transpose of its density matrix is positive semidefinite, and otherwise it is NPT.) This was conjectured first in 1999 in the special case when the two local ranks are equal. Our second main result provides a complete solution of the separability problem for bipartite states of rank 4. Namely, we show that such a state is separable if and only if it is PPT and its range contains at least one product state. We also prove that the so called checkerboard states are distillable if and only if they are NPT.

quant-ph↗

On Optimality of Greedy Policy for a Class of Standard Reward Function of Restless Multi-armed Bandit Problem

In this paper,we consider the restless bandit problem, which is one of the most well-studied generalizations of the celebrated stochastic multi-armed bandit problem in decision theory. However, it is known be PSPACE-Hard to approximate to any non-trivial factor. Thus the optimality is very difficult to obtain due to its high complexity. A natural method is to obtain the greedy policy considering its stability and simplicity. However, the greedy policy will result in the optimality loss for its intrinsic myopic behavior generally. In this paper, by analyzing one class of so-called standard reward function, we establish the closed-form condition about the discounted factor βsuch that the optimality of the greedy policy is guaranteed under the discounted expected reward criterion, especially, the condition β= 1 indicating the optimality of the greedy policy under the average accumulative reward criterion. Thus, the standard form of reward function can easily be used to judge the optimality of the greedy policy without any complicated calculation. Some examples in cognitive radio networks are presented to verify the effectiveness of the mathematical result in judging the optimality of the greedy policy.

cs.LG↗

On the Optimality of Myopic Sensing in Multi-channel Opportunistic Access: the Case of Sensing Multiple Channels

Recent works have developed a simple and robust myopic sensing policy for multi-channel opportunistic communication systems where a secondary user (SU) can access one of N i.i.d. Markovian channels. The optimality of the myopic sensing policy in maximizing the SU's cumulated reward is established under certain conditions on channel parameters. This paper studies the generic case where the SU can sense more than one channel each time. By characterizing the myopic sensing policy in this context, we establish analytically its optimality for certain system setting when the SU is allowed to sense two channels. In the more generic case, we construct counterexamples to show that the myopic sensing policy, despite its simple structure, is non-optimal.

cs.IT↗

Weaker entanglement guarantees stronger entanglement

The monogamy of entanglement is one of the basic quantum mechanical features, which says that when two partners Alice and Bob are more entangled then either of them has to be less entangled with the third party. Here we qualitatively present the converse monogamy of entanglement: given a tripartite pure system and when Alice and Bob are weakly entangled, then either of them is generally strongly entangled with the third party. Our result leads to the classification of tripartite pure states based on bipartite reduced density operators, which is a novel and effective way to this long-standing problem compared to the means by stochastic local operations and classical communications. We also systematically indicate the structure of the classified states and generate them.

quant-ph↗

Sudden death and robustness of quantum discord and entanglement of two atoms in dissipative cavities in dispersive limit

The quantum dynamics of two entangled two-level atoms initially in extended Werner-like (EWL) states is studied. Each of the two atoms is located within an isolated and dissipative cavity. If the interaction time of atoms and cavities is not very long, the amount of quantum discord and entanglement between two atoms decreases as the system evolves. The sudden death of quantum discord and entanglement of two atoms occurs within a short interaction time. However, after a long interaction time, quantum discord and entanglement of two atoms could be partially preserved due to the long-lived nature of quantum discord and entanglement. Surprisingly, we find the amount of long-lived quantum discord could be smaller than that of long-lived entanglement. Thus, entanglement may be more robust than quantum discord against decoherence.

quant-ph↗

Let Cognitive Radios Imitate: Imitation-based Spectrum Access for Cognitive Radio Networks

In this paper, we tackle the problem of opportunistic spectrum access in large-scale cognitive radio networks, where the unlicensed Secondary Users (SU) access the frequency channels partially occupied by the licensed Primary Users (PU). Each channel is characterized by an availability probability unknown to the SUs. We apply evolutionary game theory to model the spectrum access problem and develop distributed spectrum access policies based on imitation, a behavior rule widely applied in human societies consisting of imitating successful behavior. We first develop two imitation-based spectrum access policies based on the basic Proportional Imitation (PI) rule and the more advanced Double Imitation (DI) rule given that a SU can imitate any other SUs. We then adapt the proposed policies to a more practical scenario where a SU can only imitate the other SUs operating on the same channel. A systematic theoretical analysis is presented for both scenarios on the induced imitation dynamics and the convergence properties of the proposed policies to an imitation-stable equilibrium, which is also the $ε$-optimum of the system. Simple, natural and incentive-compatible, the proposed imitation-based spectrum access policies can be implemented distributedly based on solely local interactions and thus is especially suited in decentralized adaptive learning environments as cognitive radio networks.

cs.NI↗

Connections of geometric measure of entanglement of pure symmetric states to quantum state estimation

We study the geometric measure of entanglement (GM) of pure symmetric states related to rank-one positive-operator-valued measures (POVMs) and establish a general connection with quantum state estimation theory, especially the maximum likelihood principle. Based on this connection, we provide a method for computing the GM of these states and demonstrate its additivity property under certain conditions. In particular, we prove the additivity of the GM of pure symmetric multiqubit states whose Majorana points under Majorana representation are distributed within a half sphere, including all pure symmetric three-qubit states. We then introduce a family of symmetric states that are generated from mutually unbiased bases (MUBs), and derive an analytical formula for their GM. These states include Dicke states as special cases, which have already been realized in experiments. We also derive the GM of symmetric states generated from symmetric informationally complete POVMs (SIC~POVMs) and use it to characterize all inequivalent SIC~POVMs in three-dimensional Hilbert space that are covariant with respect to the Heisenberg--Weyl group. Finally, we describe an experimental scheme for creating the symmetric multiqubit states studied in this article and a possible scheme for measuring the permanent of the related Gram matrix.

quant-ph↗

Multi-copy and stochastic transformation of multipartite pure states

Characterizing the transformation and classification of multipartite entangled states is a basic problem in quantum information. We study the problem under two most common environments, local operations and classical communications (LOCC), stochastic LOCC and two more general environments, multi-copy LOCC (MCLOCC) and multi-copy SLOCC (MCSLOCC). We show that two transformable multipartite states under LOCC or SLOCC are also transformable under MCLOCC and MCSLOCC. What's more, these two environments are equivalent in the sense that two transformable states under MCLOCC are also transformable under MCSLOCC, and vice versa. Based on these environments we classify the multipartite pure states into a few inequivalent sets and orbits, between which we build the partial order to decide their transformation. In particular, we investigate the structure of SLOCC-equivalent states in terms of tensor rank, which is known as the generalized Schmidt rank. Given the tensor rank, we show that GHZ states can be used to generate all states with a smaller or equivalent tensor rank under SLOCC, and all reduced separable states with a cardinality smaller or equivalent than the tensor rank under LOCC. Using these concepts, we extended the concept of "maximally entangled state" in the multi-partite system.

quant-ph↗

Tensor Rank and Stochastic Entanglement Catalysis for Multipartite Pure States

The tensor rank (also known as generalized Schmidt rank) of multipartite pure states plays an important role in the study of entanglement classifications and transformations. We employ powerful tools from the theory of homogeneous polynomials to investigate the tensor rank of symmetric states such as the tripartite state $\ket{W_3}=\tfrac{1}{\sqrt{3}}(\ket{100}+\ket{010}+\ket{001})$ and its $N$-partite generalization $\ket{W_N}$. Previous tensor rank estimates are dramatically improved and we show that (i) three copies of $\ket{W_3}$ has rank either 15 or 16, (ii) two copies of $\ket{W_N}$ has rank $3N-2$, and (iii) $n$ copies of $\ket{W_N}$ has rank O(N). A remarkable consequence of these results is that certain multipartite transformations, impossible even probabilistically, can become possible when performed in multiple copy bunches or when assisted by some catalyzing state. This effect is impossible for bipartite pure states.

quant-ph↗

Detecting Multipartite Classical States and their Resemblances

We study various types of multipartite states lying near the quantum-classical boundary. The class of so-called classical states are precisely those in which each party can perform a projective measurement to identify a locally held state without disturbing the global state, a task known as non-disruptive local state identification (NDLID). We introduce a new class of states called generalized-classical states which allow for NDLID when the most general quantum measurements are permitted. A simple analytic method as well as a physical criterion are presented for detecting whether a multipartite state is classical. To decide whether a state is generalized-classical, we provide a semi-definite programming algorithm which can be adapted for use in other unrelated contexts such as signal processing.

quant-ph↗