相关论文: Quantum site percolation on amenable graphs
We summarize different approaches to the theory of quantum graphs and provide several ways to construct concrete examples. First, we classify all undirected quantum graphs on the quantum space $M_2$. Secondly, we apply the theory of…
We show that on a Cayley graph of a nonamenable group, almost surely the infinite clusters of Bernoulli percolation are transient for simple random walk, that simple random walk on these clusters has positive speed, and that these clusters…
The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…
Integrability is a cornerstone of classical mechanics, where it has a precise meaning. Extending this notion to quantum systems, however, remains subtle and unresolved. In particular, deciding whether a quantum Hamiltonian - viewed simply…
Based on the analogy with the quantum mechanics of a particle propagating in a {\em complex} potential, we develop a field-theoretical description of the statistical properties of a self-avoiding polymer chain in a random environment. We…
Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…
We demonstrate that a quantum graph exhibits a $\mathcal{PT}$-symmetry provided the coefficients in the condition describing the wave function matching at the vertices are circulant matrices; this symmetry is nontrivial if they are not…
We describe the notion of a quantum family of maps of a quantum space and that of a quantum commutant of such a family. Quantum commutants are quantum semigroups defined by a certain universal property. We give a few examples of these…
Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum…
In the model suggested by Smilansky one studies an operator describing the interaction between a quantum graph and a system of K one-dimensional oscillators attached at different points of the graph. This paper is a continuation of our…
We consider the dynamics of relativistic spin-half particles in quantum graphs with transparent branching points. The system is modeled by combining the quantum graph concept with the one of transparent boundary conditions applied to the…
We construct a non-perturbative approach based on quantum averaging combined with resonant transformations to detect the resonances of a given Hamiltonian and to treat them. This approach, that generalizes the rotating-wave approximation,…
A quantum graph $\mathcal{G}$ housed by a matrix algebra $M_n$ can be encoded as an operator system $\mathcal S=\mathcal{S}_{\mathcal{G}}\le M_n$. There are two sensible notions of quantum automorphism group for any such:…
We discuss the discrete spectrum of the Hamiltonian describing a two-dimensional quantum particle interacting with an infinite family of point interactions. We suppose that the latter are arranged into a star-shaped graph with N arms and a…
The quantum dynamics of a free particle on a circle with point interaction is described by a U(2) family of self-adjoint Hamiltonians. We provide a classification of the family by introducing a number of subfamilies and thereby analyze the…
We study the thermodynamic properties of a family of integrable 1D spin chain hamiltonians associated with quantum groups at roots of unity. These hamiltonians depend for each primitive root of unit on a parameter $s$ which plays the role…
In the present article a family of quantum anharmonic oscillators is studied using Hermite's function basis (Fock's basis) in the Hilbert space. The numerical investigation of the eigenenergies of that family is presented. The statistical…
The social percolation model \citep{solomon-et-00} considers a 2-dimensional regular lattice. Each site is occupied by an agent with a preference $x_{i}$ sampled from a uniform distribution $U[0,1]$. Agents transfer the information about…
We connect quantum graphs with infinite leads, and turn them to scattering systems. We show that they display all the features which characterize quantum scattering systems with an underlying classical chaotic dynamics: typical poles, delay…
We establish the existence of the phase transition in site percolation on pseudo-random $d$-regular graphs. Let $G=(V,E)$ be an $(n,d,\lambda)$-graph, that is, a $d$-regular graph on $n$ vertices in which all eigenvalues of the adjacency…