Walking on vertices and edges by continuous-time quantum walk

DOI10.1007/s11128-023-03842-4OpenAlexW4318705670MaRDI QIDQ2693842

Cauê F. Teixeira da Silva, Renato Portugal, Daniel F. D. Posner

Publication date: 24 March 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.03375

zbMATH Keywords

total graphcontinuous-time quantum walkquantum spatial search

Mathematics Subject Classification ID

Quantum computation (81P68) Eigenvalues, singular values, and eigenvectors (15A18) Random walks on graphs (05C81) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Unnamed Item
• The staggered quantum walk model
• Quantum walks on simplicial complexes
• Kirchhoff index in line, subdivision and total graphs of a regular graph
• Spectral and asymptotic properties of Grover walks on crystal lattices
• Integrity of total graphs via certain parameters
• On the kernels of the incidence matrices of graphs
• The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
• The generalized connectivity of the line graph and the total graph for the complete bipartite graph
• Quantum walks on embeddings
• Spatial search on Johnson graphs by continuous-time quantum walk
• Internally disjoint trees in the line graph and total graph of the complete bipartite graph
• Laplacian state transfer in total graphs
• The kernels of the incidence matrices of graphs revisited
• Spatial search and the Dirac equation
• Quantum walks on graphs
• Quantum walks and search algorithms

This page was built for publication: Walking on vertices and edges by continuous-time quantum walk