Related papers: Quantized rational chip-firing
We consider two types of strongly disordered one-dimensional Hamiltonian systems coupled to baths (energy or particle reservoirs) at the boundaries: strongly disordered quantum spin chains and disordered classical harmonic oscillators.…
A simple model of cyclically competing species on a directed graph with quenched disorder is proposed as an extension of the rock-paper-scissors model. By assuming that the effects of loops in a directed random graph can be ignored in the…
We investigate the stability of Quantum Critical Points (QCPs) in the presence of two competing phases. These phases near QCPs are assumed to be either classical or quantum and assumed to repulsively interact via square-square interactions.…
Graph spanners are sparse subgraphs that faithfully preserve the distances in the original graph up to small stretch. Spanner have been studied extensively as they have a wide range of applications ranging from distance oracles, labeling…
Fault-tolerant logical operations for qubits encoded by CSS codes are discussed, with emphasis on methods that apply to codes of high rate, encoding k qubits per block with k>1. It is shown that the logical qubits within a given block can…
A quantum finite multi-barrier system, with a periodic potential, is considered and exact expressions for its plane wave amplitudes are obtained using the Transfer Matrix method [10]. This quantum model is then associated with a stochastic…
We study theoretically transitions between the localized and chaotic many-body regimes in one-dimensional quantum lattice systems with long-range couplings between particles and linear external potential. In terms of established criteria…
Let $C$ be a plane rational curve of degree $d$ and $p:\tilde C \rightarrow C$ its normalization. We are interested in the splitting type $(a,b)$ of $C$, where $\mathcal{O}_{\mathbb{P}^1}(-a-d)\oplus \mathcal{O}_{\mathbb{P}^1}(-b-d)$ gives…
The component size of a graph is the maximum number of edges in any connected component of the graph. Given a graph $G$ and two integers $k$ and $c$, $(k,c)$-Decomposition is the problem of deciding whether $G$ admits an edge partition into…
We examine the scaling of the inverse participation ratio of spin coherent states in the energy basis of three collective spin systems: a bounded harmonic oscillator, the Lipkin-Meshkov-Glick model, and the Quantum Kicked Top. The…
1+1 dimensional integrable quantum field theories correspond to a sparse subset of quantum field theories where the calculation of physically interesting observables can be brought to explicit, closed and manageable expressions thanks to…
In this study, a formal definition, robustness analysis and discussion on the control of a position-based semiconductor charge qubit are presented. Such a qubit can be realized in a chain of coupled quantum dots, forming a register of…
The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times. The local crossing number of a graph is the…
Let C be a smooth cubic curve in the complex projective plane. We show that for every positive integer k, there are only finite number of rational curves of degree k each intersects the cubic C at exactly one point. The number of such…
A subset $S$ of vertices of a graph $G=(V,E)$ is called a $k$-path vertex cover if every path on $k$ vertices in $G$ contains at least one vertex from $S$. Denote by $\psi_k(G)$ the minimum cardinality of a $k$-path vertex cover in $G$ and…
Given a graph $G$, a configuration space of $G$ can be thought of as the set of all possible configurations of "robots" which can move throughout $G$, subject to some constraints. We introduce a type of configuration space which we call…
This work is devoted to the analysis of a Gibbs partition model, also known as a composition scheme. We consider a natural new condition on the component weights. It leads to a new behavior for the total number of components. We discover a…
A large (infinitely-dimensional) class of completely integrable (possibly non-autonomous) spin chains is discovered associated to an infinite-dimensional Lie Algebra of infinite rank. The complete set of integrals of motion is constructed…
Let K be an algebraically closed field of characteristic zero. Given a polynomial f(x,y) in K[x,y] with one place at infinity, we prove that either f is equivalent to a coordinate, or the family (f+c) has at most two rational elements. When…
We consider a Grover walk model on a finite internal graph, which is connected with a finite number of semi-infinite length paths and receives the alternative inflows along these paths at each time step. After the long time scale, we know…