Search

We work out the general theory of one-parameter families of partial entanglement properties and the resulting entanglement depth-like quantities. Special cases of these are the depth of partitionability, the depth of producibility (or simply entanglement depth) and the depth of stretchability, which are based on one-parameter families of partial entanglement properties known earlier. We also construct some further physically meaningful properties, for instance the squareability, the toughness, the degree of freedom, and also several ones of entropic motivation. Metrological multipartite entanglement criteria with the quantum Fisher information fit naturally into this framework. Here we formulate these for the depth of squareability, which therefore turns out to be the natural choice, leading to stronger bounds than the usual entanglement depth. Namely, the quantum Fisher information turns out to provide a lower bound not only on the maximal size of entangled subsystems, but also on the average size of entangled subsystems for a random choice of elementary subsystems. We also formulate convex criteria for both cases, which are much stronger than the original ones. This means that the aforementioned bounds hold also for the average in every decomposition of the quantum state. We also argue for that one-parameter partial entanglement properties bearing entropic meaning are more suitable for the purpose of defining metrological bounds., Comment: v2: minor fixes and clarifications; 48 pages, 22 figures

We study how many comparability subgraphs are needed to partition the edge set of a perfect graph. We show that many classes of perfect graphs can be partitioned into (at most) two comparability subgraphs and this holds for almost all perfect graphs. On the other hand, we prove that for interval graphs an arbitrarily large number of comparability subgraphs might be necessary.

Generalizing the well-known spin-squeezing inequalities, we study the relation between squeezing of collective $N$-particle $su(d)$ operators and many-body entanglement geometry in multi-particle systems. For that aim, we define the set of pseudo-separable states, which are mixtures of products of single-particle states that lie in the $(d^2-1)$-dimensional Bloch sphere but are not necessarily positive semidefinite. We obtain a set of necessary conditions for states of $N$ qudits to be of the above form. Any state that violates these conditions is entangled. We also define a corresponding $su(d)$-squeezing parameter that can be used to detect entanglement in large particle ensembles. Geometrically, this set of conditions defines a convex set of points in the space of first and second moments of the collective $N$-particle $su(d)$ operators. We prove that, in the limit $N\gg 1$, such set is filled by pseudo-separable states, while any state corresponding to a point outside of this set is necessarily entangled. We also study states that are detected by these inequalities: We show that states with a bosonic symmetry are detected if and only if the two-body reduced state violates the positive partial transpose (PPT) criterion. On the other hand, highly mixed states states close to the $su(d)$ singlet are detected which have a separable two-body reduced state and are also PPT with respect to all possible bipartitions. We also provide numerical examples of thermal equilibrium states that are detected by our set of inequalities, comparing the spin-squeezing inequalities with the $su(3)$-squeezing inequalities.

In Euclidean Ramsey Theory usually we are looking for monochromatic configurations in the Euclidean space, whose points are colored with a fixed number of colors. In the canonical version, the number of colors is arbitrary, and we are looking for an `unavoidable' set of colorings of a finite configuration, that is a set of colorings with the property that one of them always appears in any coloring of the space. This set definitely includes the monochromatic and the rainbow colorings. In the present paper, we prove the following two results of this type. First, for any acute triangle $T$, and any coloring of $\mathbb{R}^3$, there is either a monochromatic or a rainbow copy of $T$. Second, for every $m$, there exists a sufficiently large $n$ such that in any coloring of $\mathbb{R}^n$, there exists either a monochromatic or a rainbow $m$-dimensional unit hypercube. In the maximum norm, $\ell_{\infty}$, we have a much stronger statement. For every finite $M$, there exits an $n$ such that in any coloring of $\mathbb{R}_\infty^n$, there is either a monochromatic or a rainbow isometric copy of $M$., Comment: 9 pages, 3 figures

Conlon and Wu showed that there is a red/blue-coloring of $\mathbb{E}^n$ that does not contain $3$ red collinear points separated by unit distance and $m=10^{50}$ blue collinear points separated by unit distance. We prove that the statement holds with $m=1177$. We show similar results with different distances between the points.

We consider partitions of a point set into two parts, and the lengths of the minimum spanning trees of the original set and of the two parts. If $w(P)$ denotes the length of a minimum spanning tree of $P$, we show that every set $P$ of $n \geq 12$ points admits a bipartition $P= R \cup B$ for which the ratio $\frac{w(R)+w(B)}{w(P)}$ is strictly larger than $1$; and that $1$ is the largest number with this property. Furthermore, we provide a very fast algorithm that computes such a bipartition in $O(1)$ time and one that computes the corresponding ratio in $O(n \log{n})$ time. In certain settings, a ratio larger than $1$ can be expected and sometimes guaranteed. For example, if $P$ is a set of $n$ random points uniformly distributed in $[0,1]^2$ ($n \to \infty$), then for any $\eps>0$, the above ratio in a maximizing partition is at least $\sqrt2 -\eps$ with probability tending to $1$. As another example, if $P$ is a set of $n$ points with spread at most $\alpha \sqrt{n}$, for some constant $\alpha>0$, then the aforementioned ratio in a maximizing partition is $1 + \Omega(\alpha^{-2})$. All our results and techniques are extendable to higher dimensions., Comment: 2 figures, 11 pages

A matchstick graph is a plane graph with edges drawn as unit distance line segments. This class of graphs was introduced by Harborth who conjectured that a matchstick graph on $n$ vertices can have at most $\lfloor 3n - \sqrt{12n - 3}\rfloor$ edges. Recently his conjecture was settled by Lavoll\'ee and Swanepoel. In this paper we consider $1$-planar unit distance graphs. We say that a graph is a $1$-planar unit distance graph if it can be drawn in the plane such that all edges are drawn as unit distance line segments while each of them are involved in at most one crossing. We show that such graphs on $n$ vertices can have at most $3n-\sqrt[4]{n}/10$ edges., Comment: 10 pages, 4 figures

The concept of randomized measurements on individual particles has proven to be useful for analyzing quantum systems and is central for methods like shadow tomography of quantum states. We introduce $\textit{collective}$ randomized measurements as a tool in quantum information processing. Our idea is to perform measurements of collective angular momentum on a quantum system and actively rotate the directions using simultaneous multilateral unitaries. Based on the moments of the resulting probability distribution, we propose systematic approaches to characterize quantum entanglement in a collective-reference-frame-independent manner. First, we show that existing spin-squeezing inequalities can be accessible in this scenario. Next, we present an entanglement criterion based on three-body correlations, going beyond spin-squeezing inequalities with two-body correlations. Finally, we apply our method to characterize entanglement between spatially-separated two ensembles., Comment: 20 pages, 6 figures

We prove that for any $\ell_p$-norm in the plane with $1

This is a perspective on "k-stretchability of entanglement, and the duality of k-separability and k-producibility" by Szil\'ard Szalay, published in Quantum 3, 204 (2019)., Comment: 5 pages

Given a set of $n$ labeled points in general position in the plane, we remove all of its points one by one. At each step, one point from the convex hull of the remaining set is erased. In how many ways can the process be carried out? The answer obviously depends on the point set. If the points are in convex position, there are exactly $n!$ ways, which is the maximum number of ways for $n$ points. But what is the minimum number? It is shown that this number is (roughly) at least $3^n$ and at most $12.29^n$., Comment: new co-author; improved upper bound; 10 pages, 2 figures

Two independent edges in ordered graphs can be nested, crossing or separated. These relations define six types of subgraphs, depending on which relations are forbidden. We refine a remark by Erd\H{o}s and Rado that every 2-coloring of the edges of a complete graph contains a monochromatic spanning tree. We show that forbidding one relation we always have a monochromatic (non-nested, non-crossing, non-separated) spanning tree in a 2-edge-colored ordered complete graph. On the other hand, if two relations are forbidden, then it is possible that we have monochromatic (nested, separated, crossing) subtrees of size only half the number of vertices. The existence of a monochromatic non-nested spanning tree in 2-colorings of ordered complete graphs verifies a more general conjecture for twisted drawings. Our second subject is to refine the Ramsey number of matchings for ordered complete graphs. Cockayne and Lorimer proved that for given positive integers t, n, m=(t-1)(n-1)+2n is the smallest integer with the following property: every t-coloring of the edges of a complete graph Km contains a monochromatic matching with n edges. We conjecture a strengthening: t-colored ordered complete graphs on m vertices contain monochromatic non-nested and also non-separated matchings with n edges. We prove this conjecture for some special cases. (i) Every t-colored ordered complete graph on t+3 vertices contains a monochromatic non-nested matching of size two. (ii) Every 2-colored ordered complete graph on 3n-1 vertices contains a monochromatic non-separated matching of size n. For nested, separated, and crossing matchings the situation is different. The smallest m ensuring a monochromatic matching of size n in every t-coloring is 2(t(n-1))+1) in the first two cases and one less in the third case.

Let $H$ be a complete $r$-uniform hypergraph such that two vertices are marked in each edge as its `boundary' vertices. A linear ordering of the vertex set of $H$ is called an {\em agreeing linear order}, provided all vertices of each edge of $H$ lie between its two boundary vertices. We prove the following Helly-type theorem: if there is an {agreeing linear order} on the vertex set of every subhypergraph of $H$ with at most $2r-2$ vertices, then there is an agreeing linear order on the vertex set of $H$. We also show that the constant $2r-2$ cannot be reduced in the theorem. The case $r=3$ of the theorem has particular interest in the axiomatic theory of betweenness. Similar results are obtained for further $r$-uniform hypergraphs ($r\geq 3$), where one or two vertices are marked in each edge, and the linear orders need to satisfy various rules of agreement. In one of the cases we prove that no such Helly-type statement holds.

We define the quantum Wasserstein distance such that the optimization of the coupling is carried out over bipartite separable states rather than bipartite quantum states in general, and examine its properties. Surprisingly, we find that the self-distance is related to the quantum Fisher information. We present a transport map corresponding to an optimal bipartite separable state. We discuss how the quantum Wasserstein distance introduced is connected to criteria detecting quantum entanglement. We define variance-like quantities that can be obtained from the quantum Wasserstein distance by replacing the minimization over quantum states by a maximization. We extend our results to a family of generalized quantum Fisher information quantities., Comment: 25 pages including 2 figures, quantumarticle; v3: typos corrected, presentation improved, further calculations added

A graph is $1$-planar, if it can be drawn in the plane such that there is at most one crossing on every edge. It is known, that $1$-planar graphs have at most $4n-8$ edges. We prove the following odd-even generalization. If a graph can be drawn in the plane such that every edge is crossed by at most one other edge {\em an odd number of times}, then it is called 1-odd-planar and it has at most $5n-9$ edges. As a consequence, we improve the constant in the Crossing Lemma for the odd-crossing number, if adjacent edges cross an even number of times. We also give upper bound for the number of edges of $k$-odd-planar graphs., Comment: 8 pages, 2 figures

We use entanglement witnesses to detect entanglement in the XY chain in thermal equilibrium and determine the temperature bound below which the state is detected as entangled. We consider the entanglement witness based on the Hamiltonian. Such a witness detects a state as entangled if its energy is smaller than the energy of separable states. We also consider a family of entanglement witnesses related to the entanglement negativity of the state. We test the witnesses in infinite and finite systems. We study how the temperature bounds obtained are influenced by a quantum phase-transition or a disorder line in the ground state. Very strong finite-size corrections are observed in the ordered phase due to the presence of a quasi-degenerate excitation. We also study the postquench states in the thermodynamic limit after a quench when the parameters of the Hamiltonian are changed suddenly. In the case of the Ising model, we find that the mixed postquench state is detected as entangled by the two methods if the parameters of the Hamiltonian before and after the quench are close to each other. We find that the two witnesses give qualitatively similar results, showing that energy-based entanglement witnesses are efficient in detecting the nearest-neighbor entanglement in spin chains in various circumstances. For other XY models, we find that the negativity based witnesses also detect states in some parameter regions where the energy-based witness does not, in particular, if the quench is performed from the paramagnetic phase to the ferromagnetic phase and vice versa. The domains in parameter space corresponding to postquench states detected as entangled by the energy-based witness have been determined analytically, which stresses further the utility of our method., Comment: Somewhat extended version, references added

We discuss efficient methods to optimize the metrological performance over local Hamiltonians in a bipartite quantum system. For a given quantum state, our methods find the best local Hamiltonian for which the state outperforms separable states the most from the point of view of quantum metrology. We show that this problem can be reduced to maximize the quantum Fisher information over a certain set of Hamiltonians. We present the quantum Fisher information in a bilinear form and maximize it by iterating a see-saw, in which each step is based on semidefinite programming. We also solve the problem with the method of moments that works very well for smaller systems. We consider a number of other problems in quantum information theory that can be solved in a similar manner. For instance, we determine the bound entangled quantum states that maximally violate the Computable Cross Norm-Realignment (CNNR) criterion., Comment: 13 pages including 1 figure, revtev4.2

We consider quantum metrology with several copies of bipartite and multipartite quantum states. We characterize the metrological usefulness by determining how much the state outperforms separable states. We identify a large class of entangled states that become maximally useful for metrology in the limit of large number of copies, even if the state is weakly entangled and not even more useful than separable states. This way we activate metrologically useful genuine multipartite entanglement. Remarkably, not only that the maximally achievable metrological usefulness is attained exponentially fast in the number of copies, but it can be achieved by the measurement of few simple correlation observables. We also make general statements about the usefulness of a single copy of pure entangled states. We surprisingly find that the multiqubit states presented in Hyllus et al. [Phys. Rev. A 82, 012337 (2010)], which are not useful, become useful if we embed the qubits locally in qutrits. We discuss the relation of our scheme to error correction, and its possible use for quantum metrology in a noisy environment., Comment: 24 pages including 4 figures + 9-page supplement including 1 figure, iopart; published version

The {\em disjointness graph} of a set system is a graph whose vertices are the sets, two being connected by an edge if and only if they are disjoint. It is known that the disjointness graph $G$ of any system of segments in the plane is {\em $\chi$-bounded}, that is, its chromatic number $\chi(G)$ is upper bounded by a function of its clique number $\omega(G)$. Here we show that this statement does not remain true for systems of polygonal chains of length $2$. We also construct systems of polygonal chains of length $3$ such that their disjointness graphs have arbitrarily large girth and chromatic number. In the opposite direction, we show that the class of disjointness graphs of (possibly self-intersecting) \emph{$2$-way infinite} polygonal chains of length $3$ is $\chi$-bounded: for every such graph $G$, we have $\chi(G)\le(\omega(G))^3+\omega(G).$, Comment: 14 pages, 4 figures

A drawing of a graph is $k$-plane if every edge contains at most $k$ crossings. A $k$-plane drawing is saturated if we cannot add any edge so that the drawing remains $k$-plane. It is well-known that saturated $0$-plane drawings, that is, maximal plane graphs, of $n$ vertices have exactly $3n-6$ edges. For $k>0$, the number of edges of saturated $n$-vertex $k$-plane graphs can take many different values. In this note, we establish some bounds on the minimum number of edges of saturated $2$-plane graphs under different conditions. If two edges can cross at most once, then such a graph has at least $n-1$ edges. If two edges can cross many times, then we show the tight bound of $\lfloor2n/3\rfloor$ for the number of edges.

We present several inequalities related to the Robertson-Schr\"odinger uncertainty relation. In all these inequalities, we consider a decomposition of the density matrix into a mixture of states, and use the fact that the Robertson-Schr\"odinger uncertainty relation is valid for all these components. By considering a convex roof of the bound, we obtain an alternative derivation of the relation in Fr\"owis et al. [Phys. Rev. A 92, 012102 (2015)], and we can also list a number of conditions that are needed to saturate the relation. We present a formulation of the Cram\'er-Rao bound involving the convex roof of the variance. By considering a concave roof of the bound in the Robertson-Schr\"odinger uncertainty relation over decompositions to mixed states, we obtain an improvement of the Robertson-Schr\"odinger uncertainty relation. We consider similar techniques for uncertainty relations with three variances. Finally, we present further uncertainty relations that provide lower bounds on the metrological usefulness of bipartite quantum states based on the variances of the canonical position and momentum operators for two-mode continuous variable systems. We show that the violation of well-known entanglement conditions in these systems discussed in Duan et al., [Phys. Rev. Lett. 84, 2722 (2000)] and Simon [Phys. Rev. Lett. 84, 2726 (2000)] implies that the state is more useful metrologically than certain relevant subsets of separable states. We present similar results concerning entanglement conditions with angular momentum operators for spin systems., Comment: 17 pages including 3 figures, revtex4.2. See also the related work S. H. Chiew and M. Gessner, Phys. Rev. Research 4, 013076 (2022); typos in Eq. (127) and below corrected

The crossing number of a graph $G$, ${\mbox{cr}}(G)$, is the minimum number of crossings, the pair-crossing number, ${\mbox{pcr}}(G)$, is the minimum number of pairs of crossing edges over all drawings of $G$. In this note we show that ${\mbox{cr}}(G)=O({\mbox{pcr}}(G)^{3/2}\log{\mbox{pcr}}(G))$, which is an improvement of the result of Matou\v{s}ek, by a log factor., Comment: 4 pages

For $n\leq d$, a family ${\cal F}=\{C_0,C_1,\ldots, C_n\}$ of compact convex sets in $R^d$ is called an $n$-critical family provided any $n$ members of ${\cal F}$ have a non-empty intersection, but $\bigcap_{i=0}^n C_i=\varnothing$. If $n=d$ then a lemma on the intersection of convex sets due to Klee implies that the $d+1$ members of the $d$-critical family enclose a `hollow' in $R^d$, a bounded connected component of $R^d\setminus\bigcup_{i=0}^n C_i.$ Here we prove that the closure of the convex hull of a hollow in $R^d$ is a $d$-simplex., Comment: 7 pages. Identical to original version, just some new acknowledgements

We present a method to detect bipartite entanglement based on number-phase-like uncertainty relations in split spin ensembles. First, we derive an uncertainty relation that plays the role of a number-phase uncertainty for spin systems. It is important that the relation is given with well-defined and easily measurable quantities, and that it does not need assuming infinite dimensional systems. Based on this uncertainty relation, we show how to detect bipartite entanglement in an unpolarized Dicke state of many spin-1/2 particles. The particles are split into two subensembles, then collective angular momentum measurements are carried out locally on the two parts. First, we present a bipartite Einstein-Podolsky-Rosen (EPR) steering criterion. Then, we present an entanglement condition that can detect bipartite entanglement in such systems. We demonstrate the utility of the criteria by applying them to a recent experiment given in K. Lange et al. [Science 360, 416 (2018)] realizing a Dicke state in a Bose-Einstein condensate of cold atoms, in which the two subensembles were spatially separated from each other. Our methods also work well if split spin-squeezed states are considered. We show in a comprehensive way how to handle experimental imperfections, such as the nonzero particle number variance including the partition noise, and the fact that, while ideally BECs occupy a single spatial mode, in practice the population of other spatial modes cannot be fully suppressed., Comment: 34 pages including 5 figures, quantumarticle

A mean-field like stochastic evolution equation with growth and reset terms (LGGR model) is used to model wealth distribution in modern societies. The stationary solution of the model leads to an analytical form for the density function that is successful in describing the observed data for all wealth categories. In the limit of high wealth values the proposed density function has the accepted Tsallis-Pareto shape. Our results are in agreement with the predictions of an earlier approach based on a mean-field like wealth exchange process., Comment: Latex, 10 pages, 8 figures

We call a multigraph {\em non-homotopic} if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can be shrunk to its end-vertex in the same way. It is easy to see that a non-homotopic multigraph on $n>1$ vertices can have arbitrarily many edges. We prove that the number of crossings between the edges of a non-homotopic multigraph with $n$ vertices and $m>4n$ edges is larger than $c\frac{m^2}{n}$ for some constant $c>0$, and that this bound is tight up to a polylogarithmic factor. We also show that the lower bound is not asymptotically sharp as $n$ is fixed and $m$ tends to infinity., Comment: Appears in the Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020)

The crossing number of a graph $G$ is the minimum number of edge crossings over all drawings of $G$ in the plane. A graph $G$ is $k$-crossing-critical if its crossing number is at least $k$, but if we remove any edge of $G$, its crossing number drops below $k$. There are examples of $k$-crossing-critical graphs that do not have drawings with exactly $k$ crossings. Richter and Thomassen proved in 1993 that if $G$ is $k$-crossing-critical, then its crossing number is at most $2.5k+16$. We improve this bound to $2k+6\sqrt{k}+44$., Comment: Appears in the Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020)

Bipartite entangled quantum states with a positive partial transpose (PPT), i.e., PPT entangled states, are usually considered very weakly entangled. Since no pure entanglement can be distilled from them, they are also called bound entangled. In this paper we present two classes of ($2d\times 2d$)-dimensional PPT entangled states for any $d\ge 2$ which outperform all separable states in metrology significantly. We present strong evidence that our states provide the maximal metrological gain achievable by PPT states for a given system size. When the dimension $d$ goes to infinity, the metrological gain of these states becomes maximal and equals the metrological gain of a pair of maximally entangled qubits. Thus, we argue that our states could be called "PPT singlets.", Comment: 17 pages including 3 figures, revtex4.2; v2: presentation improved, some further results added, links to MATLAB programs generating the bound entangled states added; v3: published version; v4: published version, typo fixed in the first author's name in Ref. [8] and elsewhere

Given $2k-1$ convex sets in $R^2$ such that no point of the plane is covered by more than $k$ of the sets, is it true that there are two among the convex sets whose union contains all $k$-covered points of the plane? This question due to Gy. Petruska has an obvious affirmative answer for $k=1,2,3$; we show here that the claim is also true for $k=4$, and we present a counterexample for $k=5$. We explain how Petruska's geometry question fits into the classical hypergraph extremal problems, called arrow problems, proposed by P. Erd\H{o}s., Comment: 13 pages

We consider bipartite entangled states that cannot outperform separable states in any linear interferometer. Then, we show that these states can still be more useful metrologically than separable states if several copies of the state are provided or an ancilla is added to the quantum system. We present a general method to find the local Hamiltonian for which a given quantum state performs the best compared to separable states. We obtain analytically the optimal Hamiltonian for some quantum states with a high symmetry. We show that all bipartite entangled pure states outperform separable states in metrology. Some potential applications of the results are also suggested., Comment: 7 pages including 1 figure + 12-page supplement including 3 figures, revtex4.2; v2:published version

We provide an analytically treatable model that describes in a unified manner income distribution for all income categories. The approach is based on a master equation with growth and reset terms. The model assumptions on the growth and reset rates are tested on an exhaustive database with incomes on individual level spanning a nine year period in the Cluj county (Romania). In agreement with our theoretical predictions we find that income distributions computed for several years collapse on a master-curve when a properly normalised income is considered. The Beta Prime distribution is appropriate to fit the collapsed data and it is shown that distributions derived for other countries are following similar trends with different fit parameters. The non-universal feature of the fit parameters suggests that for a more realistic modelling the model parameters have to be linked with specific socio-economic regulations., Comment: 10 pages, 6 Figures

Let $G$ be a multigraph with $n$ vertices and $e>4n$ edges, drawn in the plane such that any two parallel edges form a simple closed curve with at least one vertex in its interior and at least one vertex in its exterior. Pach and T\'oth (A Crossing Lemma for Multigraphs, SoCG 2018) extended the Crossing Lemma of Ajtai et al. (Crossing-free subgraphs, North-Holland Mathematics Studies, 1982) and Leighton (Complexity issues in VLSI, Foundations of computing series, 1983) by showing that if no two adjacent edges cross and every pair of nonadjacent edges cross at most once, then the number of edge crossings in $G$ is at least $\alpha e^3/n^2$, for a suitable constant $\alpha>0$. The situation turns out to be quite different if nonparallel edges are allowed to cross any number of times. It is proved that in this case the number of crossings in $G$ is at least $\alpha e^{2.5}/n^{1.5}$. The order of magnitude of this bound cannot be improved., Comment: Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018)

Let $G$ be a drawing of a graph with $n$ vertices and $e>4n$ edges, in which no two adjacent edges cross and any pair of independent edges cross at most once. According to the celebrated Crossing Lemma of Ajtai, Chv\'atal, Newborn, Szemer\'edi and Leighton, the number of crossings in $G$ is at least $c{e^3\over n^2}$, for a suitable constant $c>0$. In a seminal paper, Sz\'ekely generalized this result to multigraphs, establishing the lower bound $c{e^3\over mn^2}$, where $m$ denotes the maximum multiplicity of an edge in $G$. We get rid of the dependence on $m$ by showing that, as in the original Crossing Lemma, the number of crossings is at least $c'{e^3\over n^2}$ for some $c'>0$, provided that the "lens" enclosed by every pair of parallel edges in $G$ contains at least one vertex. This settles a conjecture of Kaufmann., Comment: 16 pages

We show that multipartite quantum states that have a positive partial transpose with respect to all bipartitions of the particles can outperform separable states in linear interferometers. We introduce a powerful iterative method to find such states. We present some examples for multipartite states and examine the scaling of the precision with the particle number. Some bipartite examples are also shown that possess an entanglement very robust to noise. We also discuss the relation of metrological usefulness to Bell inequality violation. We find that quantum states that do not violate any Bell inequality can outperform separable states metrologically. We present such states with a positive partial transpose, as well as with a non-positive positive partial transpose., Comment: 6 pages including two figures + three-page supplement including two figures using revtex 4.1, with numerically obtained density matrices as text files; v2: published version; v3: published version, typo in the 4x4 bound entangled state is corrected (noticed by Peng Yin)

We introduce a general scheme to detect various multiparticle entanglement structures from global non-permutationally invariant observables. In particular, we derive bounds on the variance of non-permutationally invariant and collective operators for the verification of $k$-party entanglement. For a family of observables related to the spin structure factor, we give quantitative bounds on entanglement that are independent of the total number of particles. We introduce highly non-symmetric states with genuine multipartite entanglement that is verifiable with the presented technique and discuss how they can be prepared with trapped ions exploiting the high degree of control in these systems. As a special case, our framework provides an alternative approach to obtain a tight relaxation of the entanglement criterion by S{\o} rensen and M{\o} lmer [Phys. Rev. Lett. 86, 4431 (2001)] that is free from technical assumptions and allows to calculate the bounds with an improved scaling in the detectable depth., Comment: 18 pages, 4 figures

Modern quantum technologies in the fields of quantum computing, quantum simulation and quantum metrology require the creation and control of large ensembles of entangled particles. In ultracold ensembles of neutral atoms, highly entangled states containing thousands of particles have been generated, outnumbering any other physical system by orders of magnitude. The entanglement generation relies on the fundamental particle-exchange symmetry in ensembles of identical particles, which lacks the standard notion of entanglement between clearly definable subsystems. Here we present the generation of entanglement between two spatially separated clouds by splitting an ensemble of ultracold identical particles. Since the clouds can be addressed individually, our experiments open a path to exploit the available entangled states of indistinguishable particles for quantum information applications.

Global cities are defined, on the one hand, as the major command and control centres of the world economy and, on the other hand, as the most significant sites of the production of innovation. As command and control centres, they are home to the headquarters of the most powerful MNCs of the global economy, while as sites for the production of innovation they are supposed to be the most important sites of corporate research and development (R&D) activities. In this paper, we conduct a bibliometric analysis of the data located in the Scopus and Forbes 2000 databases to reveal the correlation between the characteristics of the above global city definitions. We explore which cities are the major control points of the global corporate R&D (home city approach), and which cities are the most important sites of corporate R&D activities (host city approach). According to the home city approach we assign articles produced by companies to cities where the decision-making headquarters are located (i.e. to cities that control the companies' R&D activities), while according to the host city approach we assign articles to cities where the R&D activities are actually conducted. Given Sassen's global city concept, we expect global cities to be both the leading home cities and host cities.

A convex polygon Q is circumscribed about a convex polygon P if every vertex of P lies on at least one side of Q. We present an algorithm for finding a maximum area convex polygon circumscribed about any given convex n-gon in O(n^3) time. As an application, we disprove a conjecture of Farris. Moreover, for the special case of regular n-gons we find an explicit solution., Comment: In this version we correct an error in Theorem 4 of the published version

Given $n$ continuous open curves in the plane, we say that a pair is touching if they have only one interior point in common and at this point the first curve does not get from one side of the second curve to its other side. Otherwise, if the two curves intersect, they are said to form a crossing pair. Let $t$ and $c$ denote the number of touching pairs and crossing pairs, respectively. We prove that $c \ge {1\over 10^5}{t^2\over n^2}$, provided that $t\ge 10n$. Apart from the values of the constants, this result is best possible., Comment: 7 pages; Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017)

We introduce an entanglement-depth criterion optimized for planar quantum squeezed (PQS) states. It is connected with the sensitivity of such states for estimating an arbitrary, not necessarily small phase. We compare numerically our criterion with the well-known extreme spin squeezing condition of S{\o}rensen and M{\o}lmer [Phys. Rev. Lett. 86, 4431 (2001)] and show that our condition detects a higher depth of entanglement when both planar spin variances are squeezed below the standard quantum limit. We employ our theory to monitor the entanglement dynamics in a PQS state produced via quantum non-demolition (QND) measurements using data from a recent experiment [Phys. Rev. Lett. 118, 233603 (2017)].