相关论文: Fractional revival on abelian Cayley graphs
I review why and how physical states with fractional quantum numbers can occur, emphasizing basic mechanisms in simple contexts. The general mechanism of charge fractionalization is the passage from states created by local action of fields…
Revivals of the coherent states of a deformed, adiabatically and cyclically varying oscillator Hamiltonian are examined. The revival time distribution is exactly that of Poincar\'{e} recurrences for a rotation map: only three distinct…
Perfect state transfer (PST) has great significance due to its applications in quantum information processing and quantum computation. In this paper we present a characterization on connected simple Cayley graph $\Gamma={\rm Cay}(G,S)$…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
The notion of fractional charges was up until now reserved for quasiparticle excitations emerging in strongly correlated quantum systems, such as Laughlin states in the fractional quantum Hall effect, Luttinger quasiparticles, or…
Society relies and depends increasingly on information exchange and communication. In the quantum world, security and privacy is a built-in feature for information processing. The essential ingredient for exploiting these quantum advantages…
Strong cospectrality is an equivalence relation on the set of vertices of a graph that is of importance in the study of quantum state transfer in graphs. We construct families of abelian Cayley graphs in which the number of mutually…
Recently it has been shown that interparticle interactions\emph ongenerically\emph default destroy dynamical localization in periodically driven systems, resulting in diffusive transport and heating. In this work we rigorously construct a…
We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree $k$. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks. We find that for any…
In order to obtain perfect state transfer between two sites in a network of interacting qubits, their corresponding vertices in the underlying graph must satisfy a combinatorial property called strong cospectrality. Here we determine the…
We show that if a locally finite Borel graph with quasitransitive amenable components admits a fractional perfect matching, it will admit a Borel fractional perfect matching. In particular, if a countable amenable quasitransitive graph…
We investigate the time evolution of Gaussian wave packet (GWP) in the tight-binding chain with uniform nearest neighbor (NN) hopping integral. Analytical analysis and numerical simulations show that the fractional revival of the quantum…
The numerical prediction, theoretical analysis, and experimental verification of the phenomenon of wave packet revivals in quantum systems has flourished over the last decade and a half. Quantum revivals are characterized by initially…
Full state revivals in a quantum walk can be viewed as returning of the walker to the initial quantum state in a periodic fashion during the propagation of the walk. In this paper we show that for any given number of spatial dimensions, a…
Connections between the 1-excitation dynamics of spin lattices and quantum walks on graphs will be surveyed. Attention will be paid to perfect state transfer (PST) and fractional revival (FR) as well as to the role played by orthogonal…
We introduce a formalism of fractional diffusion on networks based on a fractional Laplacian matrix that can be constructed directly from the eigenvalues and eigenvectors of the Laplacian matrix. This fractional approach allows random walks…
Quantum revivals are investigated for the dynamics of an atom in a driven gravitational cavity. It is demonstrated that the external driving field influences the revival time significantly. Analytical expressions are presented which are…
We consider the Grover walk on a finite graph composed of two arbitrary simple graphs connected by one edge, referred to as a bridge. The parameter $\epsilon>0$ assigned at the bridge represents the strength of connectivity: if…
We study the problem of graph structure identification, i.e., of recovering the graph of dependencies among time series. We model these time series data as components of the state of linear stochastic networked dynamical systems. We assume…
We study the coherent exciton transport on Apollonian networks generated by simple iterative rules. The coherent exciton dynamics is modeled by continuous-time quantum walks and we calculate the transition probabilities between two nodes of…