Graph comparison via nonlinear quantum search

DOI10.1007/s11128-019-2407-2OpenAlexW2969354510MaRDI QIDQ2105947

Yanyan Li

Publication date: 8 December 2022

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

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

zbMATH Keywords

permutationsquantum computinggraph comparisonnonlinear quantum search

Mathematics Subject Classification ID

Quantum computation (81P68) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Unnamed Item
• Alignment of trees -- an alternative to tree edit
• A similarity measure for graphs with low computational complexity
• Scattering and inverse scattering for nonlinear quantum walks
• The maximum common edge subgraph problem: A polyhedral investigation
• Weak limit theorem for a nonlinear quantum walk
• Controlled quantum search
• A metric for graphs
• An eigendecomposition approach to weighted graph matching problems
• Quantum algorithms revisited
• A distance measure between attributed relational graphs for pattern recognition
• Nonlinear quantum search using the Gross–Pitaevskii equation
• Grover's Quantum Algorithm Applied to Global Optimization
• Generalised phase kick-back: the structure of computational algorithms from physical principles

This page was built for publication: Graph comparison via nonlinear quantum search