arXiv subjects
Publications and source records attributed to Geza Toth.
The crossing number of a graph is the minimum number of crossings over all of its drawings on the plane. The Crossing Lemma, proved more than 40 years ago, is a tight lower bound on the crossing number of a graph in terms of the number of vertices and edges. It is definitely the most important inequality on crossing numbers. We review some generalizations and applications of the Crossing Lemma.
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.
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.
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.
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.
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.
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.
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.
The {\em disjointness graph} $G=G({\cal S})$ of a set of segments ${\cal S}$ in $R^d$, $d\ge 2,$ is a graph whose vertex set is ${\cal S}$ and two vertices are connected by an edge if and only if the corresponding segments are disjoint. We prove that the chromatic number of $G$ satisfies $\chi(G)\le(\omega(G))^4+(\omega(G))^3$, where $\omega(G)$ denotes the clique number of $G$. It follows, that $\cal S$ has $\Omega(n^{1/5})$ pairwise intersecting or pairwise disjoint elements. Stronger bounds are established for lines in space, instead of segments. We show that computing $\omega(G)$ and $\chi(G)$ for disjointness graphs of lines in space are NP-hard tasks. However, we can design efficient algorithms to compute proper colorings of $G$ in which the number of colors satisfies the above upper bounds. One cannot expect similar results for sets of continuous arcs, instead of segments, even in the plane. We construct families of arcs whose disjointness graphs are triangle-free ($\omega(G)=2$), but whose chromatic numbers are arbitrarily large.
We study gradient magnetometry with an ensemble of atoms with arbitrary spin. We calculate precision bounds for estimating the gradient of the magnetic field based on the quantum Fisher information. For quantum states that are invariant under homogeneous magnetic fields, we need to measure a single observable to estimate the gradient. On the other hand, for states that are sensitive to homogeneous fields, a simultaneous measurement is needed, as the homogeneous field must also be estimated. We prove that for the cases studied in this paper, such a measurement is feasible. We present a method to calculate precision bounds for gradient estimation with a chain of atoms or with two spatially separated atomic ensembles. We also consider a single atomic ensemble with an arbitrary density profile, where the atoms cannot be addressed individually, and which is a very relevant case for experiments. Our model can take into account even correlations between particle positions. While in most of the discussion we consider an ensemble of localized particles that are classical with respect to their spatial degree of freedom, we also discuss the case of gradient metrology with a single Bose-Einstein condensate.
We study quantum entanglement loss due to environmental interaction in a condensed matter system with a complex geometry relevant to recent proposals for computing with single electrons at the nanoscale. We consider a system consisting of two qubits, each realized by an electron in a double quantum dot, which are initially in an entangled Bell state. The qubits are widely separated and each interacts with its own environment. The environment for each is modeled by surrounding double quantum dots placed at random positions with random orientations. We calculate the unitary evolution of the joint system and environment. The global state remains pure throughout. We examine the time dependence of the expectation value of the bipartite Clauser-Horne-Shimony-Holt (CHSH) and Brukner-Paunkovi\'c-Rudolph-Vedral (BPRV) Bell operators and explore the emergence of correlations consistent with local realism. Though the details of this transition depend on the specific environmental geometry, we show how the results can be mapped on to a universal behavior with appropriate scaling. We determine the relevant disentanglement times based on realistic physical parameters for molecular double-dots.
We examine important properties of the difference between the variance and the quantum Fisher information over four, i.e., $(\Delta A)^2-F_{\rm Q}[\varrho,A]/4.$ We find that it is equal to a generalized variance defined in Petz [J. Phys. A 35, 929 (2002)] and Gibilisco, Hiai, and Petz [IEEE Trans. Inf. Theory 55, 439 (2009)]. We present an upper bound on this quantity that is proportional to the linear entropy. As expected, our relation shows that for states that are close to being pure, the quantum Fisher information over four is close to the variance. We also obtain the variance and the quantum Fisher information averaged over all Hermitian operators, and examine its relation to the von Neumann entropy. Apart from the usual quantum Fisher information, we also consider the Kubo-Mori-Bogoliubov quantum Fisher information.
We investigate phase and frequency estimation with different measurement strategies under the effect of collective phase noise. First, we consider the standard linear estimation scheme and present an experimentally realisable optimization of the initial probe states by collective rotations. We identify the optimal rotation angle for different measurement times. Second, we show that sub-shot noise sensitivity - up to the Heisenberg limit - can be reached in presence of collective phase noise by using differential interferometry, where one part of the system is used to monitor the noise. For this, not only GHZ states but also symmetric Dicke states are suitable. We investigate the optimal splitting for a general symmetric Dicke state at both inputs and discuss possible experimental realisations of differential interferometry.
We present criteria to detect the depth of entanglement in macroscopic ensembles of spin-j particles using the variance and second moments of the collective spin components. The class of states detected goes beyond traditional spin-squeezed states by including Dicke states and other unpolarized states. The criteria derived are easy to evaluate numerically even for systems of very many particles and outperform past approaches, especially in practical situations where noise is present. We also derive analytic lower bounds based on the linearization of our criteria, which make it possible to define spin-squeezing parameters for Dicke states. In addition, we obtain spin squeezing parameters also from the condition derived in [A. S. Sorensen and K. Molmer, Phys. Rev. Lett. 86, 4431 (2001)]. We also extend our results to systems with fluctuating number of particles.
We show how to verify the metrological usefulness of quantum states based on the expectation values of an arbitrarily chosen set of observables. In particular, we estimate the quantum Fisher information as a figure of merit of metrological usefulness. Our approach gives a tight lower bound on the quantum Fisher information for the given incomplete information. We apply our method to the results of various multiparticle quantum states prepared in experiments with photons and trapped ions, as well as to spin-squeezed states and Dicke states realized in cold gases. Our approach can be used for detecting and quantifying metrologically useful entanglement in very large systems, based on a few operator expectation values. We also gain new insights into the difference between metrological useful multipartite entanglement and entanglement in general.
Detection of entanglement in bipartite states is a fundamental task in quantum information. The first method to verify entanglement in mixed states was the partial-transpose criterion. Subsequently, numerous quantifiers for bipartite entanglement were introduced, among them concurrence and negativity. Surprisingly, these quantities are often treated as distinct or independent of each other. The aim of this contribution is to highlight the close relations between these concepts, to show the connections between seemingly independent results, and to present various estimates for the mixed-state concurrence within the same framework.
We show how a test of macroscopic realism based on Leggett-Garg inequalities (LGIs) can be performed in a macroscopic system. Using a continuous-variable approach, we consider quantum non-demolition (QND) measurements applied to atomic ensembles undergoing magnetically-driven coherent oscillation. We identify measurement schemes requiring only Gaussian states as inputs and giving a significant LGI violation with realistic experimental parameters and imperfections. The predicted violation is shown to be due to true quantum effects rather than to a classical invasivity of the measurement. Using QND measurements to tighten the "clumsiness loophole" forces the stubborn macrorealist to re-create quantum back action in his or her account of measurement.