Searcharxiv⌕ Search

arXiv subjects

Johannes Schmidt

Publications and source records attributed to Johannes Schmidt.

At least 55 records · Page 3Linked to original sources
arXiv2017

Logarithmic superdiffusion in two dimensional driven lattice gases

The spreading of density fluctuations in two-dimensional driven diffusive systems is marginally anomalous. Mode coupling theory predicts that the diffusivity in the direction of the drive diverges with time as $(\ln t)^{2/3}$ with a prefactor depending on the macroscopic current-density relation and the diffusion tensor of the fluctuating hydrodynamic field equation. Here we present the first numerical verification of this behavior for a particular version of the two-dimensional asymmetric exclusion process. Particles jump strictly asymmetrically along one of the lattice directions and symmetrically along the other, and an anisotropy parameter $p$ governs the ratio between the two rates. Using a novel massively parallel coupling algorithm that strongly reduces the fluctuations in the numerical estimate of the two-point correlation function, we are able to accurately determine the exponent of the logarithmic correction. In addition, the variation of the prefactor with $p$ provides a stringent test of mode coupling theory.

cond-mat.stat-mech↗
arXiv2017

Height distribution tails in the Kardar-Parisi-Zhang equation with Brownian initial conditions

For stationary interface growth, governed by the Kardar-Parisi-Zhang (KPZ) equation in 1 + 1 dimensions, typical fluctuations of the interface height at long times are described by the Baik-Rains distribution. Recently Chhita et al. [1] used the totally asymmetric simple exclusion process (TASEP) to study the height fluctuations in systems of the KPZ universality class for Brownian interfaces with arbitrary diffusion constant. They showed that there is a one-parameter family of long-time distributions, parametrized by the diffusion constant of the initial random height profile. They also computed these distributions numerically by using Monte Carlo (MC) simulations. Here we address this problem analytically and focus on the distribution tails at short times. We determine the (stretched exponential) tails of the height distribution by applying the Optimal Fluctuation Method (OFM) to the KPZ equation. We argue that, by analogy with other initial conditions, the "slow" tail holds at arbitrary times and therefore provides a proper asymptotic to the family of long-time distributions studied in Ref. [1]. We verify this hypothesis by performing large-scale MC simulations of a TASEP with a parallel-update rule. The "fast" tail, predicted by the OFM, is also expected to hold at arbitrary times, at sufficiently large heights.

cond-mat.stat-mech↗
arXiv2017

Spin-helix states in the $XXZ$ spin chain with strong dissipation

We investigate the nonequilibrium steady state (NESS) in an open quantum XXZ chain with strong $XY$ plane boundary polarization gradient. Using the general theory developed in [1], we show that in the critical $XXZ$ $|Δ|<1$ easy plane case, the steady current in large systems under strong driving shows resonance-like behaviour, by an infinitesimal change of the spin chain anisotropy or other parameters. Alternatively, by fine tuning the system parameters and varying the boundary dissipation strength, we observe a change of the NESS current from diffusive (of order $1/N$, for small dissipation strength) to ballistic regime (of order 1, for large dissipation strength). This drastic change results from an accompanying structural change of the NESS, which becomes a pure spin-helix state characterized by a winding number which is proportional to the system size. We calculate the critical dissipation strength needed to observe this surprising effect.

quant-ph↗
arXiv2017

Canonical Lifts of Cycle Classes of Sections

We present the construction of canonical lifts of $\ell$-adic cycle classes of sections of $p$-adic projective anabelian curves to the cohomology of arbitrary proper, regular, flat models. This answers a question of Esnault and Wittenberg.

math.AG↗
arXiv2017

Targeting pure quantum states by strong noncommutative dissipation

We propose a solution to the problem of realizing a predefined and arbitrary pure quantum state, based on the simultaneous presence of coherent and dissipative dynamics, noncommuting on the target state and in the limit of strong dissipation. More precisely, we obtain a necessary and sufficient criterion whereby the nonequilibrium steady state (NESS) of an open quantum system described by a Lindblad master equation approaches a target pure state in the Zeno regime, i.e., for infinitely large dissipative coupling. We also provide an explicit formula for the characteristic dissipative strength beyond which the purity of the NESS becomes effective, thus paving the way to an experimental implementation of our criterion. For an illustration, we deal with targeting a Bell state, an arbitrary pure state of $N$ qubits, and a spin-helix state of $N$ qubits.

quant-ph↗
arXiv2017

Stable $\mathbb{A}^1$-connectivity over Dedekind schemes

We show that $\mathbb{A}^1$-localization decreases the Nisnevich-stalkwise connectivity by at most one over a Dedekind scheme with infinite residue fields. For the proof, we establish a Nisnevich-local version of Gabber's geometric presentation lemma over a henselian discrete valuation ring with infinite residue field.

math.AG↗
arXiv2016

The Weight in Enumeration

In our setting enumeration amounts to generate all solutions of a problem instance without duplicates. We address the problem of enumerating the models of B-formulae. A B-formula is a propositional formula whose connectives are taken from a fixed set B of Boolean connectives. Without imposing any specific order to output the solutions, this task is solved. We completely classify the complexity of this enumeration task for all possible sets of connectives B imposing the orders of (1) non-decreasing weight, (2) non-increasing weight; the weight of a model being the number of variables assigned to 1. We consider also the weighted variants where a non-negative integer weight is assigned to each variable and show that this add-on leads to more sophisticated enumeration algorithms and even renders previously tractable cases intractable, contrarily to the constraint setting. As a by-product we obtain complete complexity classifications for the optimization problems known as Min-Ones and Max-Ones which are in the B-formula setting two different tasks.

cs.CC↗
arXiv2016

Sections, Homotopy Rational Points and Reductions of Curves

We study unramified sections of the fundamental group sequence of smooth projective curves of genus $\geq 2$ over $p$-adic fields together with an integral model. We are particularly interested in the induced specialized sections of the special fibre and how they relate to homotopy rational points over the residue field. Under mild assumptions, such a specialized section induces a unique homotopy rational point of the special fibre that is compatible with the original section of the generic fibre in cohomological settings. We give two applications of such specialized homotopy rational points around the $\ell$-adic cycle class of a section.

math.AG↗
arXiv2016

Exact scaling solution of the mode coupling equations for non-linear fluctuating hydrodynamics in one dimension

We obtain the exact solution of the one-loop mode-coupling equations for the dynamical structure function in the framework of non-linear fluctuating hydrodynamics in one space dimension for the strictly hyperbolic case where all characteristic velocities are different. All solutions are characterized by dynamical exponents which are Kepler ratios of consecutive Fibonacci numbers, which includes the golden mean as a limiting case. The scaling form of all higher Fibonacci modes are asymmetric Lévy-distributions. Thus a hierarchy of new dynamical universality classes is established. We also compute the precise numerical value of the Prähofer-Spohn scaling constant to which scaling functions obtained from mode coupling theory are sensitive.

cond-mat.stat-mech↗
arXiv2015

When is a bottleneck a bottleneck?

Bottlenecks, i.e. local reductions of capacity, are one of the most relevant scenarios of traffic systems. The asymmetric simple exclusion process (ASEP) with a defect is a minimal model for such a bottleneck scenario. One crucial question is "What is the critical strength of the defect that is required to create global effects, i.e. traffic jams localized at the defect position". Intuitively one would expect that already an arbitrarily small bottleneck strength leads to global effects in the system, e.g. a reduction of the maximal current. Therefore it came as a surprise when, based on computer simulations, it was claimed that the reaction of the system depends in non-continuous way on the defect strength and weak defects do not have a global influence on the system. Here we reconcile intuition and simulations by showing that indeed the critical defect strength is zero. We discuss the implications for the analysis of empirical and numerical data.

nlin.CG↗
arXiv2015

Fibonacci family of dynamical universality classes

Universality is a well-established central concept of equilibrium physics. However, in systems far away from equilibrium a deeper understanding of its underlying principles is still lacking. Up to now, a few classes have been identified. Besides the diffusive universality class with dynamical exponent $z=2$ another prominent example is the superdiffusive Kardar-Parisi-Zhang (KPZ) class with $z=3/2$. It appears e.g. in low-dimensional dynamical phenomena far from thermal equilibrium which exhibit some conservation law. Here we show that both classes are only part of an infinite discrete family of non-equilibrium universality classes. Remarkably their dynamical exponents $z_α$ are given by ratios of neighbouring Fibonacci numbers, starting with either $z_1=3/2$ (if a KPZ mode exist) or $z_1=2$ (if a diffusive mode is present). If neither a diffusive nor a KPZ mode are present, all dynamical modes have the Golden Mean $z=(1+\sqrt{5})/2$ as dynamical exponent. The universal scaling functions of these Fibonacci modes are asymmetric Lévy distributions which are completely fixed by the macroscopic current-density relation and compressibility matrix of the system and hence accessible to experimental measurement.

cond-mat.stat-mech↗
arXiv2015

Defect-induced phase transition in the asymmetric simple exclusion process

We reconsider the long-standing question of the critical defect hopping rate $r_c$ in the one-dimensional totally asymmetric exclusion process (TASEP) with a slow bond (defect). For $r< r_c$ a phase separated state is observed due to queuing at the defect site whereas for $r\geq r_c$ the defect site has only local effects on the stationary state of the homogeneous system. Mean-field theory predicts $r_c=1$ (when hopping rates outside the defect bond are equal to 1) but numerical investigations seem to indicate $r_c \approx 0.80(2)$. Here we improve the numerics to show that $r_c > 0.99$ and give strong evidence that indeed $r_c=1$ as predicted by mean-field theory, and anticipated by recent theoretical findings.

cond-mat.stat-mech↗
arXiv2015

Homotopy Rational Points of Brauer-Severi Varieties

We study homotopy rational points of Brauer-Severi varieties over fields of characteristic zero. We are particularly interested if a Brauer-Severi variety admitting a homotopy rational point splits. The analogue statement turns out to be true for open subvarieties of twisted hyperplane arrangements. In the complete case, the obstruction turns out to be the pullback of the Chern class of a generator of the Picard group along the homotopy rational point. Moreover, we will show that every Brauer-Severi variety over a $p$-adic field with $p$-primary period admits a homotopy rational point.

math.AG↗
arXiv2014

Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis

Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al. (SODA 2013) show that the time complexity of the parameterized SAT($\cdot$) problem correlates to the lattice of strong partial clones. With this ordering they isolated a relation $R$ such that SAT($R$) can be solved at least as fast as any other NP-hard SAT($\cdot$) problem. In this paper we extend this method and show that such languages also exist for the max ones problem (MaxOnes($Γ$)) and the Boolean valued constraint satisfaction problem over finite-valued constraint languages (VCSP($Δ$)). With the help of these languages we relate MaxOnes and VCSP to the exponential time hypothesis in several different ways.

cs.CC↗
arXiv2014

Single Photon Transistor Mediated by Inter-State Rydberg Interaction

We report on the realization of an all-optical transistor by mapping gate and source photons into strongly interacting Rydberg excitations with different principal quantum numbers in an ultracold atomic ensemble. We obtain a record switch contrast of 40 % for a coherent gate input with mean photon number one and demonstrate attenuation of source transmission by over 10 photons with a single gate photon. We use our optical transistor to demonstrate the nondestructive detection of a single Rydberg atom with a fidelity of 0.72(4).

quant-ph↗
arXiv2014

Complexity Classifications for logic-based Argumentation

We consider logic-based argumentation in which an argument is a pair (Fi,al), where the support Fi is a minimal consistent set of formulae taken from a given knowledge base (usually denoted by De) that entails the claim al (a formula). We study the complexity of three central problems in argumentation: the existence of a support Fi ss De, the validity of a support and the relevance problem (given psi is there a support Fi such that psi ss Fi?). When arguments are given in the full language of propositional logic these problems are computationally costly tasks, the validity problem is DP-complete, the others are SigP2-complete. We study these problems in Schaefer's famous framework where the considered propositional formulae are in generalized conjunctive normal form. This means that formulae are conjunctions of constraints build upon a fixed finite set of Boolean relations Ga (the constraint language). We show that according to the properties of this language Ga, deciding whether there exists a support for a claim in a given knowledge base is either polynomial, NP-complete, coNP-complete or SigP2-complete. We present a dichotomous classification, P or DP-complete, for the verification problem and a trichotomous classification for the relevance problem into either polynomial, NP-complete, or SigP2-complete. These last two classifications are obtained by means of algebraic tools.

cs.CC↗