21 citations · 21 across the 6 of their papers we have counts for
12 papers
-Laplacian State Transfer on Graphs with Involutions
Swornalata Ojha, Hiranmoy Pal
We study the existence of state transfer with respect to the -Laplacian matrix of a graph equipped with a non-trivial involution. We show that the occurrence of perfect state tr…
More graphs with pair state transfer
Hermie Monterde, Hiranmoy Pal
This paper has two main goals. First, we characterize perfect state transfer between -pair states in strongly regular graphs, as well as graphs in association schemes admitting…
Laplacian quantum walks on blow-up graphs
Hermie Monterde, Hiranmoy Pal, Steve Kirkland
This paper is a sequel to the work of Bhattacharjya et al.\ (J. Phys. A-Math. 57.33: 335303, https://doi.org/10.1088/1751-8121/ad6653) on quantum state transfer on blow-up graphs,…
Quantum walks on blow-up graphs
Bikash Bhattacharjya, Hermie Monterde, Hiranmoy Pal
A blow-up of copies of a graph is the graph obtained by replacing every vertex of by an independent set of size , where the copies of vertices…
Laplacian State Transfer on Graphs with an Edge Perturbation Between Twin Vertices
Hiranmoy Pal
We consider quantum state transfer relative to the Laplacian matrix of a graph. Let denote the set of all neighbors of a vertex in a graph . A pair of vertices an…
Quantum State Transfer on a Class of Circulant Graphs
Hiranmoy Pal
We study the existence of quantum state transfer on non-integral circulant graphs. We find that continuous time quantum walks on quantum networks based on certain circulant graphs…
More Circulant Graphs exhibiting Pretty Good State Transfer
Hiranmoy Pal
The transition matrix of a graph corresponding to the adjacency matrix is defined by where . The graph is said to exhibit p…
Pretty Good State Transfer on Circulant Graphs
Hiranmoy Pal, Bikash Bhattacharjya
Let be a graph with adjacency matrix . The transition matrix of relative to is defined by $H(t):=\exp{\left(-itA\right)},\;t\in\Rl$. The graph is said to admit p…
Pretty Good State Transfer on Some NEPS
Hiranmoy Pal, Bikash Bhattacharjya
Let be a graph with adjacency matrix . The transition matrix of relative to is defined by $H_{A}(t):=\exp{(-itA)},\;t\in\Rl$. We say that the graph admits perfec…
A class of gcd-graphs having Perfect State Transfer
Hiranmoy Pal, Bikash Bhattacharjya
Let be a graph with adjacency matrix . The transition matrix corresponding to is defined by , $t\in\Rl$. The graph is said to have perf…
Perfect State Transfer on gcd-graphs
Hiranmoy Pal, Bikash Bhattacharjya
Let be a graph with adjacency matrix . The transition matrix of is denoted by and it is defined by The graph …
Perfect State Transfer on NEPS of the path P3
Hiranmoy Pal, Bikash Bhattacharjya
Perfect state transfer is significant in quantum communication networks. There are very few graphs having this property. So, it is useful to find some new graphs having perfect sta…