相关论文: $q$-Laplacian State Transfer on Graphs with Involu…

Gibbs states of an infinite system of interacting quantum particles are considered. Each particle moves on a compact Riemannian manifold and is attached to a vertex of a graph (one particle per vertex). Two kinds of graphs are studied: (a)…

Given two graphs $G_{1}$ of order $n_{1}$ and $G_{2}$, the neighborhood corona of $G_{1}$ and $G_{2}$, denoted by $G_{1}\bigstar G_{2}$, is the graph obtained by taking one copy of $G_{1}$ and taking $n_{1}$ copies of $G_{2}$, in the…

We explicitate the relation between Hamiltonians for networks of interacting qubits in the XYZ model and graph Laplacians. We then study evolution in networks in which all sites can communicate with each other. These are modeled by the…

We initiate the study of approximate quantum fractional revival in graphs, a generalization of pretty good quantum state transfer in graphs. We give a complete characterization of approximate fractional revival in a graph in terms of the…

It is shown how to perfectly transfer an arbitrary qudit state in interacting boson networks. By defining a family of Hamiltonians related to Bose-Hubbard model, we describe a possible method for state transfer through bosonic atoms trapped…

The transfer of quantum states has played an important role in quantum information processing. In fact, transfer of quantum states from point $A$ to $B$ with unit fidelity is very important for us and we focus on this case. In recent years,…

Given any two forests with the same degree sequence, we show in an algorithmic way that one can be transformed into the other by a sequence of 2-switches in such a way that all the intermediate graphs of the transformation are forests. We…

We analyze the transition into the most favorable ordered state for a system of 2D fermions with spin and valley degrees of freedom. We show that for a range of rotationally invariant dispersions, the ordering transition is highly…

We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…

High fidelity state transfer is an important ingredient of distributed quantum information processing. We present and analyse results on perfect and quasi-perfect state transfer with linear spin chains incorporating non-uniform on-site…

Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density…

This paper focuses on the problem of the degree sequence for a mixed random graph process which continuously combines the {\it classical} model and the BA model. Note that the number of step added edges for the mixed model is random and…

Cubelike graphs are the Cayley graphs of the elementary abelian group (Z_2)^n (e.g., the hypercube is a cubelike graph). We give conditions for perfect state transfer between two particles in quantum networks modeled by a large class of…

We show a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flippings, and extend this method to distribution of an arbitrary unknown multi-qubit…

We analyse the sensitivity of a spin chain modelled by an undirected weighted connected graph exhibiting perfect state transfer to small perturbations in readout time and edge weight in order to obtain physically relevant bounds on the…

The problem of one-dimensional quantum wire along which a moving particle interacts with a linear array of N delta-function potentials is studied. Using a quantum waveguide approach, the transfer matrix is calculated to obtain the…

We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties,…

We consider the Grover walk model on a connected finite graph with two infinite length tails and we set an $\ell^\infty$-infinite external source from one of the tails as the initial state. We show that for any connected internal graph, a…

Following the prescription of Ref. \cite{PST} in which perfect state transference (PST) of a qubit over distance regular spin networks was discussed, in this paper PST of an arbitrary $d$-level quantum state (qudit) over antipodes of more…

As quantum information technologies advance, challenges in scaling and connectivity persist, particularly the need for long-range qubit connectivity and efficient entanglement generation. Perfect State Transfer enables time-optimal state…