Related papers: Quantized rational chip-firing
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a…
Given a multiplicatively closed subset $S$ of the integers, there exist Structure Theorems for $LC$ modules over the localization $\mathbb{Z}S^{-1}$ that are "similar" to those of $LCA$ groups. The most notable one is the 1st Theorem: Given…
We introduce, for any set $S$, the concept of $\mathfrak{K}$-family between two Hilbert $C^*$-modules over two $C^*$-algebras, for a given completely positive definite (CPD-) kernel $\mathfrak{K}$ over $S$ between those $C^*$-algebras and…
We generalize a recent result of Clausen: For a number field with integers O, we compute the K-theory of locally compact O-modules. For the rational integers this recovers Clausen's result as a special case. Our method of proof is quite…
We introduce a logical framework for the specification and verification of component-based systems, in which finitely many component instances are active, but the bound on their number is not known. Besides specifying and verifying…
We suggest a new mean field method for studying the thermodynamic competition between magnetic and superconducting phases in a two-dimensional square lattice. A partition function is constructed by writing microscopic interactions that…
We study quantum mechanics in the stochastic formulation, using the functional integral approach. The noise term enters the classical action as a local contribution of anticommuting fields. The partition function is not invariant under…
In this paper we discuss a family of models of particle and energy diffusion on a one-dimensional lattice, related to those studied previously in [Sasamoto-Wadati], [Barraquand-Corwin] and [Povolotsky] in the context of KPZ universality…
Quantum computing platforms are evolving to a point where placing high numbers of qubits into a single core comes with certain difficulties such as fidelity, crosstalk, and high power consumption of dense classical electronics. Utilizing…
Let $\cB$ be the ring of bounded operators in a complex, separable Hilbert space. For $p>0$ consider the Schatten ideal $\cL^p$ consisting of those operators whose sequence of singular values is $p$-summable; put $\cS=\bigcup_p\cL^p$. Let…
Given a graph $G$ with source and destination vertices $s,t\in V(G)$ respectively, \textsc{Tracking Paths} asks for a minimum set of vertices $T\subseteq V(G)$, such that the sequence of vertices encountered in each simple path from $s$ to…
Regular model checking is a technique for the verification of infinite-state systems whose configurations can be represented as finite words over a suitable alphabet. The form we are studying applies to systems whose set of initial…
In this paper we study the kinetics of diffusion-limited, pseudo-first-order A + B -> B reactions in situations in which the particles' intrinsic reactivities vary randomly in time. That is, we suppose that the particles are bearing "gates"…
Random quantum circuits are proficient information scramblers and efficient generators of randomness, rapidly approximating moments of the unitary group. We study the convergence of local random quantum circuits to unitary $k$-designs.…
It has recently been shown that some integrable spin chains possess a set of quasilocal conserved charges, with the classic example being the spin-$\frac{1}{2}$ XXZ Heisenberg chain. These charges have been proven to be essential for…
A permutation of length $n$ is called a flattened partition if the leading terms of maximal chains of ascents (called runs) are in increasing order. We analogously define flattened parking functions: a subset of parking functions for which…
We investigate how quantum localization encodes the hierarchical stickiness that governs transport in mixed classical phase spaces. Using the periodically driven kicked top, we show that the participation ratio (PR) of coherent states in…
Emerging network scenarios require the development of solid large-scale situated systems. Unfortunately, the diffusion/aggregation computational processes therein often introduce a source of complexity that hampers predictability of the…
To each graph without loops and multiple edges we assign a family of rings. Categories of projective modules over these rings categorify $U^-_q(\mathfrak{g})$, where $\mathfrak{g}$ is the Kac-Moody Lie algebra associated with the graph.