Odd-periodic Grover walk

• URL: http://arxiv.org/abs/2106.06710v2
• Date: Wed, 30 Nov 2022 03:19:27 GMT
• Title: Odd-periodic Grover walk
• Authors: Yusuke Yoshie
• Abstract summary: We investigate the relationship between the quantum walk and the underlying graph, focusing on the characterization of graphs exhibiting a periodic Grover walk. It is expected that graphs exhibiting a periodic Grover walk with odd period correspond to cycles with odd length. We address that problem and are able to perfectly characterize the class of graphs exhibiting an odd-periodic Grover walk by using a method.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Grover walk is one of the most well-studied quantum walks on graphs. In this paper, we investigate its periodicity to reveal the relationship between the quantum walk and the underlying graph, focusing particularly on the characterization of graphs exhibiting a periodic Grover walk. Graphs having a periodic Grover walk with periods of $2, 3, 4$, and $5$ have previously been characterized. It is expected that graphs exhibiting a periodic Grover walk with odd period correspond to cycles with odd length. We address that problem and are able to perfectly characterize the class of graphs exhibiting an odd-periodic Grover walk by using a combinatorial method.

Related papers

• Global Phase Helps in Quantum Search: Yet Another Look at the Welded Tree Problem [55.80819771134007]
  In this paper, we give a short proof of the optimal linear hitting time for a welded tree problem by a discrete-time quantum walk. The same technique can be applied to other 1-dimensional hierarchical graphs.
  arXiv  Detail & Related papers  (2024-04-30T11:45:49Z)
• Self-Supervised Continual Graph Learning in Adaptive Riemannian Spaces [74.03252813800334]
  Continual graph learning routinely finds its role in a variety of real-world applications where the graph data with different tasks come sequentially. Existing methods work with the zero-curvature Euclidean space, and largely ignore the fact that curvature varies over the coming graph sequence. To address the aforementioned challenges, we propose to explore a challenging yet practical problem, the self-supervised continual graph learning.
  arXiv  Detail & Related papers  (2022-11-30T15:25:27Z)
• Periodicity of bipartite walk on biregular graphs with conditional spectra [0.0]
  We study a class of discrete quantum walks, known as bipartite walks. Any discrete quantum walk is given by the powers of a unitary matrix $U$ indexed by arcs or edges of the underlying graph. We apply periodicity results of bipartite walks to get a characterization of periodicity of Grover's walk on regular graphs.
  arXiv  Detail & Related papers  (2022-11-04T21:02:30Z)
• 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)
• Quantitative approach to Grover's quantum walk on graphs [62.997667081978825]
  We study Grover's search algorithm focusing on continuous-time quantum walk on graphs. Instead of finding specific graph topologies convenient for the related quantum walk, we fix the graph topology and vary the underlying graph endowed Laplacians.
  arXiv  Detail & Related papers  (2022-07-04T19:33:06Z)
• A comfortable graph structure for Grover walk [0.0]
  We consider a Grover walk model on a finite internal graph, which is connected with a finite number of semi-infinite length paths. We give some characterization upon the scattering of the stationary state on the surface of the internal graph. We introduce a comfortability function of a graph for the quantum walk, which shows how many walkers can stay in the interior.
  arXiv  Detail & Related papers  (2022-01-06T05:29:50Z)
• Spatio-Temporal Joint Graph Convolutional Networks for Traffic Forecasting [75.10017445699532]
  Recent have shifted their focus towards formulating traffic forecasting as atemporal graph modeling problem. We propose a novel approach for accurate traffic forecasting on road networks over multiple future time steps.
  arXiv  Detail & Related papers  (2021-11-25T08:45:14Z)
• Relation between quantum walks with tails and quantum walks with sinks on finite graphs [0.0]
  We connect the Grover walk with sinks to the Grover walk with tails. The survival probability of the Grover walk with sinks in the long time limit is characterized by the centered generalized eigenspace of the Grover walk with tails.
  arXiv  Detail & Related papers  (2021-05-07T08:31:06Z)
• Order from chaos in quantum walks on cyclic graphs [0.0]
  We study chaotic and periodic nature of cyclic quantum walks and focus on a unique situation wherein a periodic quantum walk on a 3-cycle graph is generated via a deterministic combination of two chaotic quantum walks on the same graph. Our results will be relevant in quantum cryptography and quantum chaos control.
  arXiv  Detail & Related papers  (2020-08-01T18:39:40Z)
• 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)
• Gated Graph Recurrent Neural Networks [176.3960927323358]
  We introduce Graph Recurrent Neural Networks (GRNNs) as a general learning framework for graph processes. To address the problem of vanishing gradients, we put forward GRNNs with three different gating mechanisms: time, node and edge gates. The numerical results also show that GRNNs outperform GNNs and RNNs, highlighting the importance of taking both the temporal and graph structures of a graph process into account.
  arXiv  Detail & Related papers  (2020-02-03T22:35:14Z)

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

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.