A family of quantum walks on a finite graph corresponding to the generalized weighted zeta function

• URL: http://arxiv.org/abs/2211.00904v1
• Date: Wed, 2 Nov 2022 06:08:41 GMT
• Title: A family of quantum walks on a finite graph corresponding to the generalized weighted zeta function
• Authors: Ayaka Ishikawa
• Abstract summary: The result enables us to obtain the characteristic of the transition matrix of the quantum walk. We treat finite graphs allowing multi-edges and multi-loops.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper gives the quantum walks determined by graph zeta functions. The result enables us to obtain the characteristic polynomial of the transition matrix of the quantum walk, and it determines the behavior of the quantum walk. We treat finite graphs allowing multi-edges and multi-loops.

Related papers

• Quantum walks, the discrete wave equation and Chebyshev polynomials [1.0878040851638]
  A quantum walk is the quantum analogue of a random walk. We show that quantum walks can speed up the spreading or mixing rate of random walks on graphs.
  arXiv  Detail & Related papers  (2024-02-12T17:15:19Z)
• Continuous-time open quantum walks in one dimension: matrix-valued orthogonal polynomials and Lindblad generators [0.0]
  We study continuous-time open quantum walks in one dimension through a matrix focusing on nearest-neighbor transitions. Recent results for quantum walks are adapted in order to apply the folding trick to continuous-time birth-death chains on the integers.
  arXiv  Detail & Related papers  (2023-11-27T23:12:51Z)
• Multipartite Entanglement in the Measurement-Induced Phase Transition of the Quantum Ising Chain [77.34726150561087]
  External monitoring of quantum many-body systems can give rise to a measurement-induced phase transition. We show that this transition extends beyond bipartite correlations to multipartite entanglement.
  arXiv  Detail & Related papers  (2023-02-13T15:54:11Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Discrete Quantum Walks on the Symmetric Group [0.0]
  In quantum walks, the propagation is governed by quantum mechanical rules; generalizing random walks to the quantum setting. In this paper we investigate the discrete time coined quantum walk (DTCQW) model using tools from non-commutative Fourier analysis. Specifically, we are interested in characterizing the DTCQW on Cayley graphs generated by the symmetric group ($sym$) with appropriate generating sets.
  arXiv  Detail & Related papers  (2022-03-28T23:48:08Z)
• 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)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Implementing Quantum Gates Using Length-3 Dynamic Quantum Walks [0.0]
  We develop a length-3 dynamic quantum walk that implements any single-qubit gate. We extend this result to give length-3 dynamic quantum walks that implement any single-qubit gate controlled by any number of qubits.
  arXiv  Detail & Related papers  (2021-08-02T17:23:14Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)
• 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.