Related papers: Perfect State Transfer in Weighted Cubelike Graphs

Perfect State Transfer in Weighted Cubelike Graphs

URL: http://arxiv.org/abs/2109.12607v1
Date: Sun, 26 Sep 2021 13:44:44 GMT
Title: Perfect State Transfer in Weighted Cubelike Graphs
Authors: Jaideep Mulherkar and Rishikant Rajdeepak and V. Sunitha
Abstract summary: A continuous-time quantum random walk describes the motion of a quantum mechanical particle on a graph. We generalize the PST or periodicity of cubelike graphs to that of weighted cubelike graphs.
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: A continuous-time quantum random walk describes the motion of a quantum mechanical particle on an underlying graph. The graph itself is associated with a Hilbert space of dimension equal to the number of vertices. The dynamics of the walk is governed by the unitary operator $\mathcal{U}(t) = e^{iAt}$, where $A$ is the adjacency matrix of the graph. An important notion in the quantum random walk is the transfer of a quantum state from one vertex to another. If the fidelity of the transfer is unity, we call it a perfect state transfer. Many graph families have been shown to admit PST or periodicity, including cubelike graphs. These graphs are unweighted. In this paper, we generalize the PST or periodicity of cubelike graphs to that of weighted cubelike graphs. We characterize the weights for which they admit PST or show periodicity, both at time $t=\frac{\pi}{2}$.

Related papers

Limits, approximation and size transferability for GNNs on sparse graphs via graphops [44.02161831977037]
We take a perspective of taking limits of operators derived from graphs, such as the aggregation operation that makes up GNNs. Our results hold for dense and sparse graphs, and various notions of graph limits.
arXiv Detail & Related papers (2023-06-07T15:04:58Z)
A convergence time of Grover walk on regular graph to stationary state [0.0]
We consider a quantum walk model on a finite graph which has an interaction with the outside. We show that larger degree of the regular graph makes the convergence speed of this quantum walk model slower.
arXiv Detail & Related papers (2022-10-16T02:57:33Z)
From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
arXiv Detail & Related papers (2022-02-19T02:56:47Z)
The Exact Class of Graph Functions Generated by Graph Neural Networks [43.25172578943894]
Graph Neural Network (GNN) whose output is identical to the graph function? In this paper, we fully answer this question and characterize the class of graph problems that can be represented by GNNs. We show that this condition can be efficiently verified by checking quadratically many constraints.
arXiv Detail & Related papers (2022-02-17T18:54:27Z)
Quantum simulation of perfect state transfer on weighted cubelike graphs [0.0]
A continuous-time quantum walk on a graph evolves according to the unitary operator $e-iAt$. Perfect state transfer (PST) in a quantum walk is the transfer of a quantum state from one node to another node with $100%$ fidelity.
arXiv Detail & Related papers (2021-10-30T10:42:54Z)
Application of graph theory in quantum computer science [0.0]
We demonstrate that the continuous-time quantum walk models remain powerful for nontrivial graph structures. The quantum spatial search defined through CTQW has been proven to work well on various undirected graphs. In the scope of this aspect we analyze, whether quantum speed-up is observed for complicated graph structures as well.
arXiv Detail & Related papers (2021-09-27T12:07:25Z)
Equivalent Laplacian and Adjacency Quantum Walks on Irregular Graphs [0.0]
The continuous-time quantum walk is a particle evolving by Schr"odinger's equation in discrete space. In some physical systems, however, the Hamiltonian is proportional to the adjacency matrix instead.
arXiv Detail & Related papers (2021-07-12T16:59:06Z)
A Thorough View of Exact Inference in Graphs from the Degree-4 Sum-of-Squares Hierarchy [37.34153902687548]
We tackle the problem of exactly recovering an unknown ground-truth binary labeling of the nodes from a single corrupted observation of each edge. We apply a hierarchy of relaxations known as the sum-of-squares hierarchy, to the problem. We show that the solution of the dual of the relaxed problem is related to finding edge weights of the Johnson and Kneser graphs.
arXiv Detail & Related papers (2021-02-16T08:36:19Z)
Hamiltonian systems, Toda lattices, Solitons, Lax Pairs on weighted Z-graded graphs [62.997667081978825]
We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. We show that even for a simple example of a topologically interesting graph the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z-graded graph.
arXiv Detail & Related papers (2020-08-11T17:58:13Z)
Continuous-time quantum walks in the presence of a quadratic perturbation [55.41644538483948]
We address the properties of continuous-time quantum walks with Hamiltonians of the form $mathcalH= L + lambda L2$. We consider cycle, complete, and star graphs because paradigmatic models with low/high connectivity and/or symmetry.
arXiv Detail & Related papers (2020-05-13T14:53:36Z)
Search on Vertex-Transitive Graphs by Lackadaisical Quantum Walk [0.0]
The lackadaisical quantum walk is a discrete-time, coined quantum walk on a graph. It can improve spatial search on the complete graph, discrete torus, cycle, and regular complete bipartite graph. We present a number of numerical simulations supporting this hypothesis.
arXiv Detail & Related papers (2020-02-26T00:10:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.