相关论文: Localization in a quasiperiodic model on quantum g…
We show that the tails of the asymptotic density distribution of a quantum wave packet that localizes in the the presence of random or quasiperiodic disorder can be described by the diagonal term of the projection over the eingenstates of…
We introduce a dynamically defined class of unbounded, connected, equilateral metric graphs on which the Kirchhoff Laplacian has zero Lebesgue measure spectrum and a nontrivial singular continuous part. A new local Borg--Marchenko…
We study the entanglement dynamics of discrete time quantum walks acting on bounded finite sized graphs. We demonstrate that, depending on system parameters, the dynamics may be monotonic, oscillatory but highly regular, or quasi-periodic.…
Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…
The paper is concerned with the number of open gaps in spectra of periodic quantum graphs. The well-known conjecture by Bethe and Sommerfeld (1933) says that the number of open spectral gaps for a system periodic in more than one direction…
We study a set of scattering matrices of quantum graphs containing minimal number of passbands, i.e., maximal number of zero elements. The cases of even and odd vertex degree are considered. Using a solution of inverse scattering problem,…
We consider a family of quantum graphs $\{(\Gamma,\mathcal{A}_\varepsilon)\}_{\varepsilon>0}$, where $\Gamma$ is a $\mathbb{Z}^n$-periodic metric graph and the periodic Hamiltonian $\mathcal{A}_\varepsilon$ is defined by the operation…
By using highly entangled states, quantum metrology guarantees precision impossible with classical measurements. Unfortunately such states can be very susceptible to noise, and it is a great challenge of the field to maintain quantum…
We demonstrate the onset of strong on-site localization in a one-dimensional many-particle system. The localization is obtained by constructing, in an explicit form, a bounded sequence of on-site energies that eliminates resonant hopping…
Quantum graphs are a paradigmatic model for quantum chaos as well as for spectral theory. We give a concise didactical introduction to quantum graphs, or Schr\"odinger Hamiltonians on metric graphs, with a focus on results related to…
We present a novel approach to quantizing Markov chains. The approach is based on the Markov chain coupling method, which is frequently used to prove fast mixing. Given a particular coupling, e.g., a grand coupling, we construct a…
In this paper, we discuss the concept of quantum graphs with transparent vertices by considering the case where the graph interacts with an external time-independent field. In particular, we address the problem of transparent boundary…
We discuss approximations of the vertex coupling on a star-shaped quantum graph of $n$ edges in the singular case when the wave functions are not continuous at the vertex and no edge-permutation symmetry is present. It is shown that the…
We present an exact analytical solution of the spectral problem of quasi one-dimensional scaling quantum graphs. Strongly stochastic in the classical limit, these systems are frequently employed as models of quantum chaos. We show that…
We investigate the entanglement properties of quantum states associated with directed graphs. Using a measure derived from the Fubini-Study metric, we quantitatively relate multipartite entanglement to the local connectivity of the graph.…
This article studies Markovian stochastic motion of a particle on a graph with finite number of nodes and periodically time-dependent transition rates that satisfy the detailed balance condition at any time. We show that under general…
We study Schr\"odinger operators on quantum graphs where the number of edges between points is determined by orbits of a "shift of finite type". We prove Anderson localization for these systems.
The energy level statistics of uniform random graphs are studied, by treating the graphs as random tight-binding lattices. The inherent random geometry of the graphs and their dynamical spatial dimensionality, leads to various quantum…
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…
Hypergraph states are multiqubit states whose combinatorial description and entanglement properties generalize the well-studied class of graph states. Graph states are important in applications such as measurement-based quantum computation…