Walking on vertices and edges by continuous-time quantum walk
Publication:2693842
DOI10.1007/S11128-023-03842-4OpenAlexW4318705670MaRDI QIDQ2693842FDOQ2693842
Daniel F. D. Posner, Cauê F. Teixeira da Silva, R. Portugal
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
Eigenvalues, singular values, and eigenvectors (15A18) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Random walks on graphs (05C81) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The staggered quantum walk model
- Spatial search and the Dirac equation
- Kirchhoff index in line, subdivision and total graphs of a regular graph
- Spectral and asymptotic properties of Grover walks on crystal lattices
- Quantum walks on graphs
- Quantum walks on simplicial complexes
- Laplacian state transfer in total graphs
- Integrity of total graphs via certain parameters
- Spatial search on Johnson graphs by continuous-time quantum walk
- Quantum walks and search algorithms
- On the kernels of the incidence matrices of graphs
- The kernels of the incidence matrices of graphs revisited
- The generalized connectivity of the line graph and the total graph for the complete bipartite graph
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
- Quantum walks on embeddings
- Internally disjoint trees in the line graph and total graph of the complete bipartite graph
Cited In (2)
This page was built for publication: Walking on vertices and edges by continuous-time quantum walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693842)
