Odd properly colored cycles in edge-colored graphs

It is well-known that an undirected graph has no odd cycle if and only if it is bipartite. A less obvious, but similar result holds for directed graphs: a strongly connected digraph has no odd cycle if and only if it is bipartite. Can this result be further generalized to more general graphs such as edge-colored graphs? In this paper, we study this problem and show how to decide if there exists an odd properly colored cycle in a given edge-colored graph. As a by-product, we show how to detect if there is a perfect matching in a graph with even (or odd) number of edges in a given edge set

On the communication cost of entanglement transformations

We study the amount of communication needed for two parties to transform some given joint pure state into another one, either exactly or with some fidelity. Specifically, we present a method to lower bound this communication cost even when the amount of entanglement does not increase. Moreover, the bound applies even if the initial state is supplemented with unlimited entanglement in the form of EPR pairs, and the communication is allowed to be quantum mechanical. We then apply the method to the determination of the communication cost of asymptotic entanglement concentration and dilution. While concentration is known to require no communication whatsoever, the best known protocol for dilution, discovered by Lo and Popescu [Phys. Rev. Lett. 83(7):1459--1462, 1999], requires a number of bits to be exchanged which is of the order of the square root of the number of EPR pairs. Here we prove a matching lower bound of the same asymptotic order, demonstrating the optimality of the Lo-Popescu protocol up to a constant factor and establishing the existence of a fundamental asymmetry between the concentration and dilution tasks. We also discuss states for which the minimal communication cost is proportional to their entanglement, such as the states recently introduced in the context of ``embezzling entanglement'' [W. van Dam and P. Hayden, quant-ph/0201041].Comment: 9 pages, 1 figure. Added a reference and some further explanations. In v3 some arguments are given in more detai

Protocols for entanglement transformations of bipartite pure states

We present a general theoretical framework for both deterministic and probabilistic entanglement transformations of bipartite pure states achieved via local operations and classical communication. This framework unifies and greatly simplifies previous works. A necessary condition for ``pure contraction'' transformations is given. Finally, constructive protocols to achieve both probabilistic and deterministic entanglement transformations are presented.Comment: 7 pages, no figures. Version slightly modified on Physical Review A reques

Faithful remote state preparation using finite classical bits and a non-maximally entangled state

We present many ensembles of states that can be remotely prepared by using minimum classical bits from Alice to Bob and their previously shared entangled state and prove that we have found all the ensembles in two-dimensional case. Furthermore we show that any pure quantum state can be remotely and faithfully prepared by using finite classical bits from Alice to Bob and their previously shared nonmaximally entangled state though no faithful quantum teleportation protocols can be achieved by using a nonmaximally entangled state.Comment: 6 page

Acyclicity in edge-colored graphs

A walk $W$ in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in $W$ is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type $i$ is a proper superset of graphs of acyclicity of type $i+1$, $i=1,2,3,4.$ The first three types are equivalent to the absence of PC cycles, PC trails, and PC walks, respectively. While graphs of types 1, 2 and 3 can be recognized in polynomial time, the problem of recognizing graphs of type 4 is, somewhat surprisingly, NP-hard even for 2-edge-colored graphs (i.e., when only two colors are used). The same problem with respect to type 5 is polynomial-time solvable for all edge-colored graphs. Using the five types, we investigate the border between intractability and tractability for the problems of finding the maximum number of internally vertex disjoint PC paths between two vertices and the minimum number of vertices to meet all PC paths between two vertices

Higher-order squeezing for the codirectional Kerr nonlinear coupler

In this Letter we study the evolution of the higher-order squeezing, namely, $n$th-order single-mode squeezing, sum- and difference-squeezing for the codirectional Kerr nonlinear coupler. We show that the amount of squeezing decreases when $n$, i.e. the squeezing order, increases. For specific values of the interaction parameters squeezing factors exhibit a series of revival-collapse phenomena, which become more pronounced when the value of $n$ increases. Sum-squeezing can provide amounts of squeezing greater than those produced by the $n$th higher-order ($n\geq 2$) squeezing for the same values of interaction parameters and can map onto amplitude-squared squeezing. Further, we prove that the difference-squeezing is not relevant measure for obtaining information about squeezing from this device.Comment: 13 pages, 3 figure

First passage time statistics of Brownian motion with purely time dependent drift and diffusion

Systems where resource availability approaches a critical threshold are common to many engineering and scientific applications and often necessitate the estimation of first passage time statistics of a Brownian motion (Bm) driven by time-dependent drift and diffusion coefficients. Modeling such systems requires solving the associated Fokker-Planck equation subject to an absorbing barrier. Transitional probabilities are derived via the method of images, whose applicability to time dependent problems is shown to be limited to state-independent drift and diffusion coefficients that only depend on time and are proportional to each other. First passage time statistics, such as the survival probabilities and first passage time densities are obtained analytically. The analysis includes the study of different functional forms of the time dependent drift and diffusion, including power-law time dependence and different periodic drivers. As a case study of these theoretical results, a stochastic model for water availability from surface runoff in snowmelt dominated regions is presented, where both temperature effects and snow-precipitation input are incorporated

Structural and dynamics studies of a truncated variant of CI repressor from bacteriophage TP901-1

International audienceThe CI repressor from the temperate bacteriophage TP901-1 consists of two folded domains, an N-terminal helix-turn-helix DNA-binding domain (NTD) and a C-terminal oligomerization domain (CTD), which we here suggest to be further divided into CTD1 and CTD2. Full-length CI is a hexameric protein, whereas a truncated version, CI∆58, forms dimers. We identify the dimerization region of CI∆58 as CTD1 and determine its secondary structure to be helical both within the context of CI∆58 and in isolation. To our knowledge this is the first time that a helical dimerization domain has been found in a phage repressor. We also precisely determine the length of the flexible linker connecting the NTD to the CTD. Using electrophoretic mobility shift assays and native mass spectrometry, we show that CI∆58 interacts with the OL operator site as one dimer bound to both half-sites, and with much higher affinity than the isolated NTD domain thus demonstrating cooperativity between the two DNA binding domains. Finally, using small angle X-ray scattering data and state-of-the-art ensemble selection techniques, we delineate the conformational space sampled by CI∆58 in solution, and we discuss the possible role that the dynamics play in CI-repressor function