Related papers: State transfer on integral mixed circulant graphs
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…
This contribution gives an extensive study on spectra of mixed graphs via its Hermitian adjacency matrix of the second kind { ($N$-matrix for short)} introduced by Mohar \cite{0001}. This matrix is indexed by the vertices of the mixed…
We construct a large class of quantum "d x d" states which are positive under partial transposition (so called PPT states). The construction is based on certain direct sum decomposition of the total Hilbert space displaying characteristic…
The Spectral Excess Theorem (SPET) for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. Recently, some local or global approaches to the SPET…
A mixed multigraph is obtained from an undirected multigraph by orienting a subset of its edges. In this paper, we study a new Hermitian matrix representation of mixed multigraphs, give an introduction to cospectral operations on mixed…
Quantum spin networks can be used to transport information between separated registers in a quantum information processor. To find a practical implementation, the strict requirements of ideal models for perfect state transfer need to be…
A mixed graph is called \emph{second kind hermitian integral}(or \emph{HS-integral}) if the eigenvalues of its Hermitian-adjacency matrix of second kind are integers. A mixed graph is called \emph{Eisenstein integral} if the eigenvalues of…
A permutiple is a natural number whose representation in some base is an integer multiple of a number whose representation has the same collection of digits. A previous paper utilizes a finite-state-machine construction and its state graph…
We introduce the concept of group state transfer on graphs, summarize its relationship to other concepts in the theory of quantum walks, set up a basic theory, and discuss examples. Let $X$ be a graph with adjacency matrix $A$ and consider…
The transmission ${\rm Tr}_G(u)$ of a vertex $u$ of a connected graph $G$ is the sum of distances from $u$ to all other vertices. $G$ is a stepwise transmission irregular (STI) graph if $|{\rm Tr}_G(u) - {\rm Tr}_G(v)|= 1$ holds for any…
In this paper, we characterize the existence of perfect state transfer (PST) and fractional revival in continuous-time quantum walks on the zero-divisor graph $\Gamma(\mathbb{Z}_n)$. By using the canonical equitable partition of…
This work presents an exactly soluble scheme to address the problem of optimal transfer of quantum states through a set of $s$ harmonic oscillators composing a network with connected ends as a closed quantum circuit. For this purpose we…
We introduce a scheme for perfect state transfer in regular two and three dimensional structures. The interactions on the lattices are of XX spin type with uniform couplings. In two dimensions the structure is a hexagonal lattice and in…
We consider a system of qubits coupled via nearest-neighbour interaction governed by the Heisenberg Hamiltonian. We further suppose that all coupling constants are equal to $1$. We are interested in determining which graphs allow for a…
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…
In this paper we study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer: the transmission of quantum states without dissipation. The essential goal is to…
There is perfect state transfer between two vertices of a graph, if a single excitation can travel with fidelity one between the corresponding sites of a spin system modeled by the graph. When the excitation is back at the initial site, for…
A mixed graph $G$ is a graph obtained from a simple undirected graph by orientating a subset of edges. $G$ is self-converse if it is isomorphic to the graph obtained from $G$ by reversing each directed edge. For two mixed graphs $G$ and $H$…
In this paper we build on the ideas presented in previous works for perfectly transferring a quantum state between opposite ends of a spin chain using a fixed Hamiltonian. While all previous studies have concentrated on nearest-neighbor…
The main objective of the paper is to unveil an adequate mathematics hidden behind entanglement, that is Geometric Invariant Theory. More specifically relation between these two subjects can be described by the following theses. (i) Total…