A convergence time of Grover walk on regular graph to stationary state

• URL: http://arxiv.org/abs/2210.08420v1
• Date: Sun, 16 Oct 2022 02:57:33 GMT
• Title: A convergence time of Grover walk on regular graph to stationary state
• Authors: Ayaka Ishikawa, Sho Kubota, Etsuo Segawa
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider a quantum walk model on a finite graph which has an interaction with the outside. Here a quantum walker from the outside penetrates the graph and also a quantum walker in the graph goes out to the outside at every time step. This dynamics of the quantum walk converges to a stationary state. In this paper, we estimate the speed of the convergence to the stationary state on the $\kappa$-regular graph with the uniformly inserting of the inflow to the graph. We show that larger degree of the regular graph makes the convergence speed of this quantum walk model slower.

Related papers

• Quantum State Diffusion on a Graph [0.0]
  Quantum walks have frequently envisioned the behavior of a quantum state traversing a classically defined, generally finite, graph structure. This paper will examine some mathematical structures that underlie state diffusion on arbitrary graphs.
  arXiv  Detail & Related papers  (2024-05-26T01:06:42Z)
• 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)
• Generalized Graphon Process: Convergence of Graph Frequencies in Stretched Cut Distance [30.279435887366578]
  sparse graph sequences converge to the trivial graphon under the conventional definition of cut distance. We utilize the concepts of generalized graphons and stretched cut distance to describe the convergence of sparse graph sequences. Our results indicate the possibility of transfer learning between sparse graphs.
  arXiv  Detail & Related papers  (2023-09-11T06:34:46Z)
• 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 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)
• 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)
• Perfect State Transfer in Weighted Cubelike Graphs [0.0]
  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.
  arXiv  Detail & Related papers  (2021-09-26T13:44:44Z)
• Simplifying Continuous-Time Quantum Walks on Dynamic Graphs [0.0]
  A continuous-time quantum walk on a dynamic graph evolves by Schr"odinger's equation with a sequence of Hamiltonians encoding the edges of the graph. In this paper, we give six scenarios under which a dynamic graph can be simplified.
  arXiv  Detail & Related papers  (2021-06-10T19:24:32Z)
• The Time-Evolution of States in Quantum Mechanics [77.34726150561087]
  It is argued that the Schr"odinger equation does not yield a correct description of the quantum-mechanical time evolution of states of isolated (open) systems featuring events. A precise general law for the time evolution of states replacing the Schr"odinger equation is formulated within the so-called ETH-Approach to Quantum Mechanics.
  arXiv  Detail & Related papers  (2021-01-04T16:09:10Z)
• Bosonic Random Walk Networks for Graph Learning [32.24009574184356]
  We explore applications of multi-particle quantum walks on diffusing information across graphs. Our model is based on learning the operators that govern the dynamics of quantum random walkers on graphs. We demonstrate the effectiveness of our method on classification and regression tasks.
  arXiv  Detail & Related papers  (2020-12-31T21:40: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)

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.