arXiv subjects

Lin Chen

Publications and source records attributed to Lin Chen.

At least 505 records · Page 28Linked to original sources

arXiv2015

Graph states of prime-power dimension from generalized CNOT quantum circuit

We construct multipartite graph states whose dimension is the power of a prime number. This is realized by the finite field, as well as the generalized controlled-NOT quantum circuit acting on two qudits. We propose the standard form of graph states up to local unitary transformations and particle permutations. The form greatly simplifies the classification of graph states as we illustrate up to five qudits. We also show that some graph states are multipartite maximally entangled states in the sense that any bipartite of the system produces a bipartite maximally entangled state. We further prove that 4-partite maximally entangled states exist when the dimension is an odd number at least three or a multiple of four.

quant-ph↗

arXiv2015

An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization

We consider the online machine minimization problem in which jobs with hard deadlines arrive online over time at their release dates. The task is to determine a feasible schedule on a minimum number of machines. Our main result is a general O(m^2 log m)-competitive algorithm for the preemptive online problem, where m is the optimal number of machines used in an offline solution. This is the first improvement on an O(log (p_max/p_min))-competitive algorithm by Phillips et al. (STOC 1997), which was to date the best known algorithm even when m=2. Our algorithm is O(1)-competitive for any m that is bounded by a constant. To develop the algorithm, we investigate two complementary special cases of the problem, namely, laminar instances and agreeable instances, for which we provide an O(log m)-competitive and an O(1)-competitive algorithm, respectively. Our O(1)-competitive algorithm for agreeable instances actually produces a non-preemptive schedule, which is of its own interest as there exists a strong lower bound of n, the number of jobs, for the general non-preemptive online machine minimization problem by Saha (FSTTCS 2013), which even holds for laminar instances.

cs.DS↗

arXiv2015

Dimension formula for induced maximal faces of separable states and genuine entanglement

The normalized separable states of a finite-dimensional multipartite quantum system, represented by its Hilbert space ${\cal H}$, form a closed convex set ${\cal S}_1$. The set ${\cal S}_1$ has two kinds of faces, induced and non-induced. An induced face, $F$, has the form $F=Γ(F_V)$, where $V$ is a subspace of ${\cal H}$, $F_V$ is the set of $ρ\in{\cal S}_1$ whose range is contained in $V$, and $Γ$ is a partial transposition operator. Such $F$ is a maximal face if and only if $V$ is a hyperplane. We give a simple formula for the dimension of any induced maximal face. We also prove that the maximum dimension of induced maximal faces is equal to $d(d-2)$ where $d$ is the dimension of ${\cal H}$. The equality $\dimΓ(F_V)=d(d-2)$ holds if and only if $V^\perp$ is spanned by a genuinely entangled vector.

quant-ph↗

arXiv2015

A quantum approach to homomorphic encryption

Encryption schemes often derive their power from the properties of the underlying algebra on the symbols used. Inspired by group theoretic tools, we use the centralizer of a subgroup of operations to present a private-key quantum homomorphic encryption scheme that enables a broad class of quantum computation on encrypted data. A particular instance of our encoding hides up to a constant fraction of the information encrypted. This fraction can be made arbitrarily close to unity with overhead scaling only polynomially in the message length. This highlights the potential of our protocol to hide a non-trivial amount of information, and is suggestive of a large class of encodings that might yield better security.

quant-ph↗

arXiv2015

Decomposition of bipartite and multipartite unitary gates into the product of controlled unitary gates

We show that any unitary operator on the $d_A\times d_B$ system ($d_A\ge 2$) can be decomposed into the product of at most $4d_A-5$ controlled unitary operators. The number can be reduced to $2d_A-1$ when $d_A$ is a power of two. We also prove that three controlled unitaries can implement a bipartite complex permutation operator, and discuss the connection to an analogous result on classical reversible circuits. We further show that any $n$-partite unitary on the space $\mathbb{C}^{d_1}\otimes...\otimes\mathbb{C}^{d_n}$ is the product of at most $[2\prod^{n-1}_{j=1}(2d_j-2)-1]$ controlled unitary gates, each of which is controlled from $n-1$ systems. The number can be further reduced for $n=4$. We also decompose any bipartite unitary into the product of a simple type of bipartite gates and some local unitaries. We derive dimension-independent upper bounds for the CNOT-gate cost or entanglement cost of bipartite permutation unitaries (with the help of ancillas of fixed size) as functions of the Schmidt rank of the unitary. It is shown that such costs under a simple protocol are related to the log-rank conjecture in communication complexity theory via the link of nonnegative rank.

quant-ph↗

arXiv2015

Optimizing Average-Maximum TTR Trade-off for Cognitive Radio Rendezvous

In cognitive radio (CR) networks, "TTR", a.k.a. time-to-rendezvous, is one of the most important metrics for evaluating the performance of a channel hopping (CH) rendezvous protocol, and it characterizes the rendezvous delay when two CRs perform channel hopping. There exists a trade-off of optimizing the average or maximum TTR in the CH rendezvous protocol design. On one hand, the random CH protocol leads to the best "average" TTR without ensuring a finite "maximum" TTR (two CRs may never rendezvous in the worst case), or a high rendezvous diversity (multiple rendezvous channels). On the other hand, many sequence-based CH protocols ensure a finite maximum TTR (upper bound of TTR) and a high rendezvous diversity, while they inevitably yield a larger average TTR. In this paper, we strike a balance in the average-maximum TTR trade-off for CR rendezvous by leveraging the advantages of both random and sequence-based CH protocols. Inspired by the neighbor discovery problem, we establish a design framework of creating a wake-up schedule whereby every CR follows the sequence-based (or random) CH protocol in the awake (or asleep) mode. Analytical and simulation results show that the hybrid CH protocols under this framework are able to achieve a greatly improved average TTR as well as a low upper-bound of TTR, without sacrificing the rendezvous diversity.

cs.NI↗

arXiv2014

Defeating jamming with the power of silence: a game-theoretic analysis

The timing channel is a logical communication channel in which information is encoded in the timing between events. Recently, the use of the timing channel has been proposed as a countermeasure to reactive jamming attacks performed by an energy-constrained malicious node. In fact, whilst a jammer is able to disrupt the information contained in the attacked packets, timing information cannot be jammed and, therefore, timing channels can be exploited to deliver information to the receiver even on a jammed channel. Since the nodes under attack and the jammer have conflicting interests, their interactions can be modeled by means of game theory. Accordingly, in this paper a game-theoretic model of the interactions between nodes exploiting the timing channel to achieve resilience to jamming attacks and a jammer is derived and analyzed. More specifically, the Nash equilibrium is studied in the terms of existence, uniqueness, and convergence under best response dynamics. Furthermore, the case in which the communication nodes set their strategy and the jammer reacts accordingly is modeled and analyzed as a Stackelberg game, by considering both perfect and imperfect knowledge of the jammer's utility function. Extensive numerical results are presented, showing the impact of network parameters on the system performance.

cs.GT↗

arXiv2014

On Heterogeneous Neighbor Discovery in Wireless Sensor Networks

Neighbor discovery plays a crucial role in the formation of wireless sensor networks and mobile networks where the power of sensors (or mobile devices) is constrained. Due to the difficulty of clock synchronization, many asynchronous protocols based on wake-up scheduling have been developed over the years in order to enable timely neighbor discovery between neighboring sensors while saving energy. However, existing protocols are not fine-grained enough to support all heterogeneous battery duty cycles, which can lead to a more rapid deterioration of long-term battery health for those without support. Existing research can be broadly divided into two categories according to their neighbor-discovery techniques---the quorum based protocols and the co-primality based protocols.In this paper, we propose two neighbor discovery protocols, called Hedis and Todis, that optimize the duty cycle granularity of quorum and co-primality based protocols respectively, by enabling the finest-grained control of heterogeneous duty cycles. We compare the two optimal protocols via analytical and simulation results, which show that although the optimal co-primality based protocol (Todis) is simpler in its design, the optimal quorum based protocol (Hedis) has a better performance since it has a lower relative error rate and smaller discovery delay, while still allowing the sensor nodes to wake up at a more infrequent rate.

cs.NI↗

arXiv2014

On the Schmidt-rank-three bipartite and multipartite unitary operator

Unitary operations are physically implementable. We further the understanding of such operations by studying the possible forms of nonlocal unitary operators, which are bipartite or multipartite unitary operators that are not tensor product operators. They are of broad relevance in quantum information processing. We prove that any nonlocal unitary operator of Schmidt rank three on a $d_A\times d_B$ bipartite system is locally equivalent to a controlled unitary. This operator can be locally implemented assisted by a maximally entangled state of Schmidt rank $\min\{d_A^2,d_B\}$ when $d_A\le d_B$. We further show that any multipartite unitary operator $U$ of Schmidt rank three can be controlled by one system or collectively controlled by two systems, regardless of the number of systems of $U$. In the scenario of $n$-qubit, we construct non-controlled $U$ for any odd $n\ge5$, and prove that $U$ is a controlled unitary for any even $n\ge4$.

quant-ph↗

arXiv2014

Role of correlations in the two-body-marginal problem

Quantum properties of correlations have a key role in disparate fields of physics, from quantum information processing, to quantum foundations, to strongly correlated systems. We tackle a specific aspect of the fundamental quantum marginal problem: we address the issue of deducing the global properties of correlations of tripartite quantum states based on the knowledge of their bipartite reductions, focusing on relating specific properties of bipartite correlations to global correlation properties. We prove that strictly classical bipartite correlations may still require global entanglement and that unentangled---albeit not strictly classical---reductions may require global genuine multipartite entanglement, rather than simple entanglement. On the other hand, for three qubits, the strict classicality of the bipartite reductions rules out the need for genuine multipartite entanglement. Our work sheds new light on the relation between local and global properties of quantum states, and on the interplay between classical and quantum properties of correlations.

quant-ph↗

arXiv2014

Ultra-broadband Terahertz Perfect Absorber Based on Multi-frequency Destructive Interference and Grating Diffraction

High absorption in a wide frequency band has attracted considerable interest since their potential applications in frequency spectrum imaging systems and anti-radar cloaking. In this paper, a polarization-independent, ultra-broadband and omnidirectional terahertz absorber is proposed, fabricated and evaluated. It is experimentally demonstrated that an over 95% absorption can be obtained in the frequency range of 0.75~2.41 THz. Attributing to the multi-frequency destructive interference between the layers and the impedance-matching condition of the grating, five successive absorption peaks at 0.88 THz, 1.20 THz, 1.53 THz, 1.96 THz and 2.23 THz merged into a ultra-broadband absorption spectrum.

physics.optics↗

arXiv2014

Stability Analysis of Frame Slotted Aloha Protocol

Frame Slotted Aloha (FSA) protocol has been widely applied in Radio Frequency Identification (RFID) systems as the de facto standard in tag identification. However, very limited work has been done on the stability of FSA despite its fundamental importance both on the theoretical characterisation of FSA performance and its effective operation in practical systems. In order to bridge this gap, we devote this paper to investigating the stability properties of FSA by focusing on two physical layer models of practical importance, the models with single packet reception and multipacket reception capabilities. Technically, we model the FSA system backlog as a Markov chain with its states being backlog size at the beginning of each frame. The objective is to analyze the ergodicity of the Markov chain and demonstrate its properties in different regions, particularly the instability region. By employing drift analysis, we obtain the closed-form conditions for the stability of FSA and show that the stability region is maximised when the frame length equals the backlog size in the single packet reception model and when the ratio of the backlog size to frame length equals in order of magnitude the maximum multipacket reception capacity in the multipacket reception model. Furthermore, to characterise system behavior in the instability region, we mathematically demonstrate the existence of transience of the backlog Markov chain.

cs.IT↗

arXiv2014

Pricing Mobile Data Offloading: A Distributed Market Framework

Mobile data offloading is an emerging technology to avoid congestion in cellular networks and improve the level of user satisfaction. In this paper, we develop a distributed market framework to price the offloading service, and conduct a detailed analysis of the incentives for offloading service providers and conflicts arising from the interactions of different participators. Specifically, we formulate a multi-leader multi-follower Stackelberg game (MLMF-SG) to model the interactions between the offloading service providers and the offloading service consumers in the considered market framework, and investigate the cases where the offloading capacity of APs is unlimited and limited, respectively. For the case without capacity limit, we decompose the followers' game of the MLMF-SG (FG-MLMF-SG) into a number of simple follower games (FGs), and prove the existence and uniqueness of the equilibrium of the FGs from which the existence and uniqueness of the FG-MLMF-SG also follows. For the leaders' game of the MLMF-SG, we also prove the existence and uniqueness of the equilibrium. For the case with capacity limit, by considering a symmetric strategy profile, we establish the existence and uniqueness of the equilibrium of the corresponding MLMF-SG, and present a distributed algorithm that allows the leaders to achieve the equilibrium. Finally, extensive numerical experiments demonstrate that the Stackelberg equilibrium is very close to the corresponding social optimum for both considered cases.

cs.NI↗

arXiv2014

The Maximal Matching Energy of Tricyclic Graphs

Gutman and Wagner proposed the concept of the matching energy (ME) and pointed out that the chemical applications of ME go back to the 1970s. Let $G$ be a simple graph of order $n$ and $μ_1,μ_2,\ldots,μ_n$ be the roots of its matching polynomial. The matching energy of $G$ is defined to be the sum of the absolute values of $μ_{i}\ (i=1,2,\ldots,n)$. Gutman and Cvetkoić determined the tricyclic graphs on $n$ vertices with maximal number of matchings by a computer search for small values of $n$ and by an induction argument for the rest. Based on this result, in this paper, we characterize the graphs with the maximal value of matching energy among all tricyclic graphs, and completely determine the tricyclic graphs with the maximal matching energy. We prove our result by using Coulson-type integral formula of matching energy, which is similar as the method to comparing the energies of two quasi-order incomparable graphs.

math.CO↗

arXiv2014

Matching Energy of Unicyclic and Bicyclic Graphs with a Given Diameter

Gutman and Wagner proposed the concept of matching energy (ME) and pointed out that the chemical applications of ME go back to the 1970s. Let $G$ be a simple graph of order $n$ and $μ_1,μ_2,\ldots,μ_n$ be the roots of its matching polynomial. The matching energy of $G$ is defined to be the sum of the absolute values of $μ_{i}\ (i=1,2,\ldots,n)$. In this paper, we characterize the graphs with minimal matching energy among all unicyclic and bicyclic graphs with a given diameter $d$.

math.CO↗

arXiv2014

Canonical form of three-fermion pure-states with six single particle states

We construct a canonical form for pure states in $\bwe^3(\bC^6)$, the three-fermion system with six single particle states, under local unitary (LU) transformations, i.e., the unitary group $\Un(6)$. We also construct a minimal set of generators of the algebra of polynomial $\Un(6)$-invariants on $\bwe^3(\bC^6)$. It turns out that this algebra is isomorphic to the algebra of polynomial LU-invariants of three-qubits which are additionally invariant under qubit permutations. As a consequence of this surprising fact, we deduce that there is a one-to-one correspondence between the $\Un(6)$-orbits of pure three-fermion states in $\bwe^3(\bC^6)$ and the LU orbits of pure three-qubit states when qubit permutations are allowed. As an important byproduct, we obtain a new canonical form for pure three-qubit states under LU transformations $\Un(2)\times\Un(2)\times\Un(2)$ (no qubit permutations allowed).

quant-ph↗

arXiv2014

Nonlocal and controlled unitary operators of Schmidt rank three

Implementing nonlocal unitary operators is an important and hard question in quantum computing and cryptography. We show that any bipartite nonlocal unitary operator of Schmidt rank three on the $(d_A \times d_B)$-dimensional system is locally equivalent to a controlled unitary when $d_A$ is at most three. This operator can be locally implemented assisted by a maximally entangled state of Schmidt rank $r=\min\{d_A^2,d_B\}$. We further show that stochastic-equivalent nonlocal unitary operators are indeed locally equivalent, and propose a sufficient condition on which nonlocal and controlled unitary operators are locally equivalent. We also provide the solution to a special case of a conjecture on the ranks of multipartite quantum states.

quant-ph↗

arXiv2014

A Distributed Demand-Side Management Framework for the Smart Grid

This paper proposes a fully distributed Demand-Side Management system for Smart Grid infrastructures, especially tailored to reduce the peak demand of residential users. In particular, we use a dynamic pricing strategy, where energy tariffs are function of the overall power demand of customers. We consider two practical cases: (1) a fully distributed approach, where each appliance decides autonomously its own scheduling, and (2) a hybrid approach, where each user must schedule all his appliances. We analyze numerically these two approaches, showing that they are characterized practically by the same performance level in all the considered grid scenarios. We model the proposed system using a non-cooperative game theoretical approach, and demonstrate that our game is a generalized ordinal potential one under general conditions. Furthermore, we propose a simple yet effective best response strategy that is proved to converge in a few steps to a pure Nash Equilibrium, thus demonstrating the robustness of the power scheduling plan obtained without any central coordination of the operator or the customers. Numerical results, obtained using real load profiles and appliance models, show that the system-wide peak absorption achieved in a completely distributed fashion can be reduced up to 55%, thus decreasing the capital expenditure (CAPEX) necessary to meet the growing energy demand.

cs.GT↗