Reconciliation of a Quantum-Distributed Gaussian Key

Two parties, Alice and Bob, wish to distill a binary secret key out of a list of correlated variables that they share after running a quantum key distribution protocol based on continuous-spectrum quantum carriers. We present a novel construction that allows the legitimate parties to get equal bit strings out of correlated variables by using a classical channel, with as few leaked information as possible. This opens the way to securely correcting non-binary key elements. In particular, the construction is refined to the case of Gaussian variables as it applies directly to recent continuous-variable protocols for quantum key distribution.Comment: 8 pages, 4 figures. Submitted to the IEEE for possible publication. Revised version to improve its clarit

Finding Multiple New Optimal Locations in a Road Network

We study the problem of optimal location querying for location based services in road networks, which aims to find locations for new servers or facilities. The existing optimal solutions on this problem consider only the cases with one new server. When two or more new servers are to be set up, the problem with minmax cost criteria, MinMax, becomes NP-hard. In this work we identify some useful properties about the potential locations for the new servers, from which we derive a novel algorithm for MinMax, and show that it is efficient when the number of new servers is small. When the number of new servers is large, we propose an efficient 3-approximate algorithm. We verify with experiments on real road networks that our solutions are effective and attains significantly better result quality compared to the existing greedy algorithms

Moving Walkways, Escalators, and Elevators

We study a simple geometric model of transportation facility that consists of two points between which the travel speed is high. This elementary definition can model shuttle services, tunnels, bridges, teleportation devices, escalators or moving walkways. The travel time between a pair of points is defined as a time distance, in such a way that a customer uses the transportation facility only if it is helpful. We give algorithms for finding the optimal location of such a transportation facility, where optimality is defined with respect to the maximum travel time between two points in a given set.Comment: 16 pages. Presented at XII Encuentros de Geometria Computacional, Valladolid, Spai

Colorful Strips

Given a planar point set and an integer $k$, we wish to color the points with $k$ colors so that any axis-aligned strip containing enough points contains all colors. The goal is to bound the necessary size of such a strip, as a function of $k$. We show that if the strip size is at least $2k{-}1$, such a coloring can always be found. We prove that the size of the strip is also bounded in any fixed number of dimensions. In contrast to the planar case, we show that deciding whether a 3D point set can be 2-colored so that any strip containing at least three points contains both colors is NP-complete. We also consider the problem of coloring a given set of axis-aligned strips, so that any sufficiently covered point in the plane is covered by $k$ colors. We show that in $d$ dimensions the required coverage is at most $d(k{-}1)+1$. Lower bounds are given for the two problems. This complements recent impossibility results on decomposition of strip coverings with arbitrary orientations. Finally, we study a variant where strips are replaced by wedges

Large Coercivity in Nanostructured Rare-earth-free MnxGa Films

The magnetic hysteresis of MnxGa films exhibit remarkably large coercive fields as high as 2.5 T when fabricated with nanoscale particles of a suitable size and orientation. This coercivity is an order of magnitude larger than in well-ordered epitaxial film counterparts and bulk materials. The enhanced coercivity is attributed to the combination of large magnetocrystalline anisotropy and ~ 50 nm size nanoparticles. The large coercivity is also replicated in the electrical properties through the anomalous Hall effect. The magnitude of the coercivity approaches that found in rare-earth magnets, making them attractive for rare-earth-free magnet applications

Unsplittable coverings in the plane

A system of sets forms an {\em $m$-fold covering} of a set $X$ if every point of $X$ belongs to at least $m$ of its members. A $1$-fold covering is called a {\em covering}. The problem of splitting multiple coverings into several coverings was motivated by classical density estimates for {\em sphere packings} as well as by the {\em planar sensor cover problem}. It has been the prevailing conjecture for 35 years (settled in many special cases) that for every plane convex body $C$, there exists a constant $m=m(C)$ such that every $m$-fold covering of the plane with translates of $C$ splits into $2$ coverings. In the present paper, it is proved that this conjecture is false for the unit disk. The proof can be generalized to construct, for every $m$, an unsplittable $m$-fold covering of the plane with translates of any open convex body $C$ which has a smooth boundary with everywhere {\em positive curvature}. Somewhat surprisingly, {\em unbounded} open convex sets $C$ do not misbehave, they satisfy the conjecture: every $3$-fold covering of any region of the plane by translates of such a set $C$ splits into two coverings. To establish this result, we prove a general coloring theorem for hypergraphs of a special type: {\em shift-chains}. We also show that there is a constant $c>0$ such that, for any positive integer $m$, every $m$-fold covering of a region with unit disks splits into two coverings, provided that every point is covered by {\em at most} $c2^{m/2}$ sets

Practical learning method for multi-scale entangled states

We describe a method for reconstructing multi-scale entangled states from a small number of efficiently-implementable measurements and fast post-processing. The method only requires single particle measurements and the total number of measurements is polynomial in the number of particles. Data post-processing for state reconstruction uses standard tools, namely matrix diagonalisation and conjugate gradient method, and scales polynomially with the number of particles. Our method prevents the build-up of errors from both numerical and experimental imperfections

The Complexity of Drawing Graphs on Few Lines and Few Planes

It is well known that any graph admits a crossing-free straight-line drawing in $\mathbb{R}^3$ and that any planar graph admits the same even in $\mathbb{R}^2$. For a graph $G$ and $d \in \{2,3\}$, let $\rho^1_d(G)$ denote the minimum number of lines in $\mathbb{R}^d$ that together can cover all edges of a drawing of $G$. For $d=2$, $G$ must be planar. We investigate the complexity of computing these parameters and obtain the following hardness and algorithmic results. - For $d\in\{2,3\}$, we prove that deciding whether $\rho^1_d(G)\le k$ for a given graph $G$ and integer $k$ is ${\exists\mathbb{R}}$-complete. - Since $\mathrm{NP}\subseteq{\exists\mathbb{R}}$, deciding $\rho^1_d(G)\le k$ is NP-hard for $d\in\{2,3\}$. On the positive side, we show that the problem is fixed-parameter tractable with respect to $k$. - Since ${\exists\mathbb{R}}\subseteq\mathrm{PSPACE}$, both $\rho^1_2(G)$ and $\rho^1_3(G)$ are computable in polynomial space. On the negative side, we show that drawings that are optimal with respect to $\rho^1_2$ or $\rho^1_3$ sometimes require irrational coordinates. - Let $\rho^2_3(G)$ be the minimum number of planes in $\mathbb{R}^3$ needed to cover a straight-line drawing of a graph $G$. We prove that deciding whether $\rho^2_3(G)\le k$ is NP-hard for any fixed $k \ge 2$. Hence, the problem is not fixed-parameter tractable with respect to $k$ unless $\mathrm{P}=\mathrm{NP}$

Decoherence suppression via environment preparation

To protect a quantum system from decoherence due to interaction with its environment, we investigate the existence of initial states of the environment allowing for decoherence-free evolution of the system. For models in which a two-state system interacts with a dynamical environment, we prove that such states exist if and only if the interaction and self-evolution Hamiltonians share an eigenstate. If decoherence by state preparation is not possible, we show that initial states minimizing decoherence result from a delicate compromise between the environment and interaction dynamics.Comment: 4 pages, 2 figure

Development of learning objectives for neurology in a veterinary curriculum: Part II: Postgraduates

Background: Specialization in veterinary medicine in Europe is organized through the Colleges of the European Board of Veterinary Specialization. To inform updating of the curriculum for residents of the European College of Veterinary Neurology (ECVN) job analysis was used. Defining job competencies of diploma holders in veterinary neurology can be used as references for curriculum design of resident training. With the support of the diplomates of the ECVN and the members of the European Society of Veterinary Neurology (ESVN) a mixed-method research, including a qualitative search of objectives and quantitative ranking with 149 Likert scale questions and 48 free text questions in 9 categories in a survey was conducted. In addition, opinions of different groups were subjected to statistical analysis and the result compared. Results: A return rate of 62% (n = 213/341) was achieved. Of the competencies identified by the Delphi process, 75% objectives were expected to attain expert level; 24% attain advanced level; 1% entry level. In addition, the exercise described the 11 highly ranked competencies, the 3 most frequently seen diseases of the central and peripheral nervous systems and the most frequently used immunosuppressive, antiepileptic and chemotherapeutic drugs. Conclusion: The outcomes of this “Delphi job analysis” provide a powerful tool to align the curriculum for ECVN resident training and can be adapted to the required job competencies, based on expectations. The expectation is that for majority of these competencies diplomates should attain an expert level. Besides knowledge and clinical skills, residents and diplomates are expected to demonstrate high standards in teaching and communication. The results of this study will help to create a European curriculum for postgraduate education in veterinary neurology