Related papers: Quantized rational chip-firing

We consider the localized modes (bright solitons) described by one-dimensional quintic nonlinear Schrodinger equation with a periodic potential. In the case of attractive nonlinearity we deduce sufficient conditions for collapse. We show…

We demonstrate that a site-dependent driving of a periodic potential allows for the controlled manipulation of a quantum particle on length scales of the lattice spacing. Specifically we observe for distinct driving frequencies a near…

Let $2\le k\in\mathbb{Z}$. A total coloring of a $k$-regular simple graph via $k+1$ colors is an {\it efficient total coloring} if each color yields an efficient dominating set, where the efficient domination condition applies to the…

A finite graph with an assignment of non-negative integers to vertices gives chip-firing games. Chip-firing games determine languages (sets of words) called the record sets of legal games. Bj\"orner, Lov\'asz and Shor found several…

Conformal field theory, describing systems with scaling symmetry, plays a crucial role throughout physics. We describe a quantum algorithm to simulate the dynamics of conformal field theories, including the action of local conformal…

We extend the definitions of characters and partition functions to the case of conformal field theories which contain operators with logarithmic correlation functions. As an example we consider the theories with central charge c = c(p,1) =…

The rational $Q$-system is an efficient method to solve Bethe ansatz equations for quantum integrable spin chains. We construct the rational $Q$-systems for generic Bethe ansatz equations described by an $A_{\ell-1}$ quiver, which include…

Let G be a group, Fin the family of its finite subgroups, and E(G,Fin) the classifying space. Let L^1 be the algebra of trace-class operators in an infinite dimensional, separable Hilbert space over the complex numbers. Consider the…

We analyze the dynamical response functions of strongly interacting quantum critical states described by conformal field theories (CFTs). We construct a self-consistent holographic model that incorporates the relevant scalar operator…

Let $G$ be a graph and let $C$ be a color set of cardinality $k$. Suppose $c \colon V(G) \to C$ is a (not necessarily proper) vertex coloring whose all color classes are $V_1$, $V_2$, $\dots$, $V_k$, each of which is nonempty. The vertex…

We study the existence of traveling wave solutions for a numerical counterpart of the KPP equation. We obtain the existence of monostable fronts for all super-critical speeds in the regime where the spatial step size is small. The key…

For fixed positive integers $n$ and $k$, the Kneser graph $KG_{n,k}$ has vertices labeled by $k$-element subsets of $\{1,2,\dots,n\}$ and edges between disjoint sets. Keeping $k$ fixed and allowing $n$ to grow, one obtains a family of…

Qubit regularization provides a rich framework to explore quantum field theories. The freedom to choose how the important symmetries of the theory are embedded in the qubit regularization scheme allows us to construct new lattice models…

We consider classical models of the kicked rotor type, with piecewise linear kicking potentials designed so that momentum changes only by multiples of a given constant. Their dynamics display quasi-localization of momentum, or quadratic…

We establish weak well-posedness for critical symmetric stable driven SDEs in R d with additive noise Z, d $\ge$ 1. Namely, we study the case where the stable index of the driving process Z is $\alpha$ = 1 which exactly corresponds to the…

We consider a network model, embedded on the Manhattan lattice, of a quantum localisation problem belonging to symmetry class C. This arises in the context of quasiparticle dynamics in disordered spin-singlet superconductors which are…

Parking functions are a widely studied class of combinatorial objects, with connections to several branches of mathematics. On the algebraic side, parking functions can be identified with the standard monomials of $M_n$, a certain monomial…

A fault-tolerant quantum processor may be configured using stationary qubits interacting only with their nearest neighbours, but at the cost of significant overheads in physical qubits per logical qubit. Such overheads could be reduced by…

Let $c, k$ be two positive integers and let $G=(V,E)$ be a graph. The $(c,k)$-Load Coloring Problem (denoted $(c,k)$-LCP) asks whether there is a $c$-coloring $\varphi: V \rightarrow [c]$ such that for every $i \in [c]$, there are at least…

Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…