A Low Complexity Scheme for Entanglement Distributor Buses

For technological purposes and theoretical curiosity, it is very interesting to have a building block that produces a considerable amount of entanglement between on-demand sites through a simple control of a few sites. Here, we consider permanently-coupled spin networks and study entanglement generation between qubit pairs to find low-complexity structures capable of generating considerable entanglement between various qubit pairs. We find that in axially symmetric networks the generated entanglement between some qubit pairs is rather larger than generic networks. We show that in uniformly-coupled spin rings each pair can be considerably entangled through controlling suitable vertices. To set the location of controlling-vertices, we observe that the symmetry has to be broken for a definite time. To achieve this, a magnetic flux can be applied to break symmetry via Aharonov-Bohm effect. Such a set up can serve as an efficient entanglement distributor bus in which each vertex-pair can be efficiently entangled through exciting only one fixed vertex and controlling the evolution time. The low-complexity of this scheme makes it attractive for use in nanoscale quantum information processors.Comment: 23 pages, 4 figures, Major revision, title changed, published versio

Nonlinear Integer Programming

Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject to integrality requirements for the variables. This chapter is dedicated to this topic. The primary goal is a study of a simple version of general nonlinear integer problems, where all constraints are still linear. Our focus is on the computational complexity of the problem, which varies significantly with the type of nonlinear objective function in combination with the underlying combinatorial structure. Numerous boundary cases of complexity emerge, which sometimes surprisingly lead even to polynomial time algorithms. We also cover recent successful approaches for more general classes of problems. Though no positive theoretical efficiency results are available, nor are they likely to ever be available, these seem to be the currently most successful and interesting approaches for solving practical problems. It is our belief that the study of algorithms motivated by theoretical considerations and those motivated by our desire to solve practical instances should and do inform one another. So it is with this viewpoint that we present the subject, and it is in this direction that we hope to spark further research.Comment: 57 pages. To appear in: M. J\"unger, T. Liebling, D. Naddef, G. Nemhauser, W. Pulleyblank, G. Reinelt, G. Rinaldi, and L. Wolsey (eds.), 50 Years of Integer Programming 1958--2008: The Early Years and State-of-the-Art Surveys, Springer-Verlag, 2009, ISBN 354068274

Phi meson production in Au+Au and p+p collisions at sqrt (s)=200 GeV

We report the STAR measurement of Phi meson production in Au+Au and p+p collisions at sqrt (s)=200 GeV. Using the event mixing technique, the Phi spectra and yields are obtained at mid-rapidity for five centrality bins in Au+Au collisions and for non-singly-diffractive p+p collisions. It is found that the Phi transverse momentum distributions from Au+Au collisions are better fitted with a single-exponential while the p+p spectrum is better described by a double-exponential distribution. The measured nuclear modification factors indicate that Phi production in central Au+Au collisions is suppressed relative to peripheral collisions when scaled by the number of binary collisions. The systematics of versus centrality and the constant Phi/K- ratio versus beam species, centrality, and collision energy rule out kaon coalescence as the dominant mechanism for Phi production.Comment: 6 pages, 3 figures, submitted to Phys. Rev. Let

Energy and system size dependence of \phi meson production in Cu+Cu and Au+Au collisions

We study the beam-energy and system-size dependence of \phi meson production (using the hadronic decay mode \phi -- K+K-) by comparing the new results from Cu+Cu collisions and previously reported Au+Au collisions at \sqrt{s_NN} = 62.4 and 200 GeV measured in the STAR experiment at RHIC. Data presented are from mid-rapidity (|y|<0.5) for 0.4 < pT < 5 GeV/c. At a given beam energy, the transverse momentum distributions for \phi mesons are observed to be similar in yield and shape for Cu+Cu and Au+Au colliding systems with similar average numbers of participating nucleons. The \phi meson yields in nucleus-nucleus collisions, normalised by the average number of participating nucleons, are found to be enhanced relative to those from p+p collisions with a different trend compared to strange baryons. The enhancement for \phi mesons is observed to be higher at \sqrt{s_NN} = 200 GeV compared to 62.4 GeV. These observations for the produced \phi(s\bar{s}) mesons clearly suggest that, at these collision energies, the source of enhancement of strange hadrons is related to the formation of a dense partonic medium in high energy nucleus-nucleus collisions and cannot be alone due to canonical suppression of their production in smaller systems.Comment: 20 pages and 5 figure

An analytical approach to the dynamic topology problem

Currently, it is possible to modify (say, hourly) the topology of a data communications network by adding or deleting network links and/or by increasing or decreasing bandwidth on existing links in response to changing traffic loads and/or projected network conditions. The intent of this paper is to study a Markov decision process (MDP) model of the dynamic topology problem (DTP), the problem of activating and/or deleting links, as a function of the current traffic in the network and of the most recent network topology design. We present a decomposition of this model and structural results for the decomposition. The decomposition and structural results enhance the tractability of procedures for determining optimal link control policies. A numerical example is used to illustrate these results.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/47986/1/11235_2005_Article_BF02110313.pd

Exact Quantum Algorithms for the Leader Election Problem

a