Coined quantum walks lift the cospectrality of graphs and trees

DOI10.1016/j.patcog.2008.10.025zbMath1177.68169OpenAlexW2054036712WikidataQ60431122 ScholiaQ60431122MaRDI QIDQ2270832

Simone Severini, Edwin R. Hancock, Richard C. Wilson, David Emms

Publication date: 29 July 2009

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2008.10.025

zbMATH Keywords

strongly regular graphsunitary representationscospectralitygraph matchingquantum walksgraph spectra

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Related Items (16)

Graph characterization by counting sink star subgraphs ⋮ Graph isomorphism and Gaussian boson sampling ⋮ Kinematics and dynamics of quantum walks in terms of systems of imprimitivity ⋮ Quantum walk and its application domains: a systematic review ⋮ Quantum walks on generalized quadrangles ⋮ Corrigendum to: ``Coined quantum walks lift the cospectrality of graphs and trees ⋮ Eigenfunctions of the edge-based Laplacian on a graph ⋮ A remark on zeta functions of finite graphs via quantum walks ⋮ Ruelle zeta functions for finite digraphs ⋮ On the relation between quantum walks and zeta functions ⋮ A Quantum Jensen-Shannon Graph Kernel Using Discrete-Time Quantum Walks ⋮ Local feature point extraction for quantum images ⋮ Quantum walks, Ihara zeta functions and cospectrality in regular graphs ⋮ A zeta function related to the transition matrix of the discrete-time quantum walk on a graph ⋮ Characteristic Polynomial Analysis on Matrix Representations of Graphs ⋮ Discrete-time quantum walks and graph structures

Uses Software

• COIL-100
• COIL-20

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Almost all trees are co-immanantal
• Concerning the complexity of deciding isomorphism of block designs
• Combinatorics, Paul Erdős is eighty. Vol. 2
• On the structure of the adjacency matrix of the line digraph of a regular digraph
• The strongly regular (45,\,12,\,3,\,3) graphs
• An example of the difference between quantum and classical random walks
• A Stochastic Demand Model for Optimal Pricing of Non-Life Insurance Policies
• Markov Chains
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• One-dimensional quantum walks
• Quantum walks on graphs
• Quantum Walk Algorithm for Element Distinctness
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

This page was built for publication: Coined quantum walks lift the cospectrality of graphs and trees