相关论文: Laplacian quantum walks on blow-up graphs

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…

In this paper, we study Grover's search algorithm focusing on continuous-time quantum walk on graphs. We propose an alternative optimization approach to Grover's algorithm on graphs that can be summarized as follows: instead of finding…

We consider the Dyson hierarchical graph $\mathcal{G}$, that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter $\sigma \in (1/2, 1]$. Exploiting the deterministic recursivity through which…

We introduce a minimal set of physically motivated postulates that the Hamiltonian H of a continuous-time quantum walk should satisfy in order to properly represent the quantum counterpart of the classical random walk on a given graph. We…

Let A be the adjacency matrix of a graph $X$ and suppose U(t)=exp(itA). We view A as acting on $\cx^{V(X)}$ and take the standard basis of this space to be the vectors $e_u$ for $u$ in $V(X)$. Physicists say that we have perfect state…

In Part I [J. Chem. Phys. 138, 084108 (2013)] we derived a quantum transition-state theory by taking the t->0+ (short-time) limit of a new form of quantum flux-side time-correlation function containing a ring-polymer dividing surface. This…

We consider quantum walks on a finite graphs to which infinite tails are attached. We explore how the propagating and bound states depend on the structure of the finite graph. The S-matrix for such graphs is defined. Its unitarity is proved…

Here I present a new discrete model of quantum mechanics for relativistic 1-electron systems, in which particle movement is described by a directed space-time graph with attached 4-spinors, but without any continuous wave functions. These…

We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrix theory. We also define a classical phase space for the…

We demonstrate mesoscopic transport through quantum states in quasi-1D lattices maintaining the combination of parity and time-reversal symmetries by controlling energy gain and loss. We investigate the phase diagram of the non-Hermitian…

We develop a full characterization of abelian quantum statistics on graphs. We explain how the number of anyon phases is related to connectivity. For 2-connected graphs the independence of quantum statistics with respect to the number of…

Pretty good state transfer in networks of qubits occurs when a continuous-time quantum walk allows the transmission of a qubit state from one node of the network to another, with fidelity arbitrarily close to 1. We prove that in a…

To every finite metric space $X$, including all connected unweighted graphs with the minimum edge-distance metric, we attach an invariant that we call its blowup-polynomial $p_X(\{ n_x : x \in X \})$. This is obtained from the blowup…

We exhibit non-equivariant perturbations of the blowup solutions constructed in \cite{KST} for energy critical wave maps into $\mathbb{S}^2$. Our admissible class of perturbations is an open set in some sufficiently smooth topology and…

We study phase transition and percolation at criticality for three random graph models on the plane, viz., the homogeneous and inhomogeneous enhanced random connection models (RCM) and the Poisson stick model. These models are built on a…

We prove that the empirical density of states of quantum spin glasses on arbitrary graphs converges to a normal distribution as long as the maximal degree is negligible compared with the total number of edges. This extends the recent…

This paper focuses on periodicity and perfect state transfer of Grover walks on two well-known families of Cayley graphs, namely, the unitary Cayley graphs and the quadratic unitary Cayley graphs. Let $R$ be a finite commutative ring. The…

In this thesis, we analyze the stochastic completeness of a heat kernel on graphs which is a function of three variables: a pair of vertices and a continuous time, for infinite, locally finite, connected graphs. For general graphs, a…

Let $X$ be a graph on $n$ vertices with with adjacency matrix $A$ and let $H(t)$ denote the matrix-valued function $\exp(iAt)$. If $u$ and $v$ are distinct vertices in $X$, we say perfect state transfer}from $u$ to $v$ occurs if there is a…

We study impact of quantum phase transitions (QPTs) on the distribution of exceptional points (EPs) of the Hamiltonian in complex-extended parameter domain. Analyzing first- and second-order QPTs in the Lipkin model, we find an…