Quantum State Diffusion on a Graph

• URL: http://arxiv.org/abs/2405.16394v1
• Date: Sun, 26 May 2024 01:06:42 GMT
• Title: Quantum State Diffusion on a Graph
• Authors: John C Vining III, Howard A. Blair,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum walks have frequently envisioned the behavior of a quantum state traversing a classically defined, generally finite, graph structure. While this approach has already generated significant results, it imposes a strong assumption: all nodes where the walker is not positioned are quiescent. This paper will examine some mathematical structures that underlie state diffusion on arbitrary graphs, that is the circulation of states within a graph. We will seek to frame the multi-walker problem as a finite quantum cellular automaton. Every vertex holds a walker at all times. The walkers will never collide and at each time step their positions update non-deterministically by a quantum swap of walkers at opposite ends of a randomly chosen edge. The update is accomplished by a unitary transformation of the position of a walker to a superposition of all such possible swaps and then performing a quantum measurement on the superposition of possible swaps. This behavior generates strong entanglement between vertex states which provides a path toward developing local actions producing diffusion throughout the graph without depending on the specific structure of the graph through blind computation.

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)
• 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)
• Key graph properties affecting transport efficiency of flip-flop Grover percolated quantum walks [0.0]
  We study quantum walks with the flip-flop shift operator and the Grover coin. We show how the position of the source and sink together with the graph geometry and its modifications affect transport. This gives us a deep insight into processes where elongation or addition of dead-end subgraphs may surprisingly result in enhanced transport.
  arXiv  Detail & Related papers  (2022-02-19T11:55:21Z)
• Feedback-assisted quantum search by continuous-time quantum walks [58.720142291102135]
  We address the quantum search of a target node on a cycle graph by means of a quantum walk assisted by continuous measurement and feedback. In particular, our protocol is able to drive the walker to a desired target node.
  arXiv  Detail & Related papers  (2022-01-12T16:59:53Z)
• On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids [63.75363908696257]
  The lackadaisical quantum walk is an algorithm developed to search graph structures whose vertices have a self-loop of weight $l$. This paper addresses several issues related to applying the lackadaisical quantum walk to search for multiple solutions on grids successfully.
  arXiv  Detail & Related papers  (2021-06-11T09:43:09Z)
• Quantum speed limits for time evolution of a system subspace [77.34726150561087]
  In the present work, we are concerned not with a single state but with a whole (possibly infinite-dimensional) subspace of the system states that are subject to the Schroedinger evolution. We derive an optimal estimate on the speed of such a subspace evolution that may be viewed as a natural generalization of the Fleming bound.
  arXiv  Detail & Related papers  (2020-11-05T12:13:18Z)
• 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)
• Analysis of Lackadaisical Quantum Walks [0.0]
  The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each. We analytically prove that lackadaisical quantum walks can find a unique marked. vertebrae on any regular locally arc-transitive graph with constant success probability. quadratically faster than the hitting time.
  arXiv  Detail & Related papers  (2020-02-26T00:40:25Z)
• 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)
• Jumptime unraveling of Markovian open quantum systems [68.8204255655161]
  We introduce jumptime unraveling as a distinct description of open quantum systems. quantum jump trajectories emerge, physically, from continuous quantum measurements. We demonstrate that quantum trajectories can also be ensemble-averaged at specific jump counts.
  arXiv  Detail & Related papers  (2020-01-24T09:35:32Z)
• Discrete-Time Quantum Walks on Oriented Graphs [0.0]
  We define discrete-time quantum walks on arbitrary oriented graphs. We introduce a parameter, called alpha, that quantifies the amount of orientation.
  arXiv  Detail & Related papers  (2020-01-13T01:42:42Z)

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.