Graph comparison via nonlinear quantum search

DOI10.1007/S11128-019-2407-2MaRDI QIDQ2105947zbMATH OpenOpenAlexFDO

Authors 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

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) Quantum computation (81P68)

Recommendations

• Quantum search of matching on signed graphs
• Quantum Query Complexity of Some Graph Problems
• Automata, Languages and Programming
• A query-efficient quantum algorithm for maximum matching on general graphs
• SOFSEM 2004: Theory and Practice of Computer Science
• Comparing large-scale graphs based on quantum probability theory
• Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation
• Search on vertex-transitive graphs by lackadaisical quantum walk
• Quantum time complexity and algorithms for pattern matching on labeled graphs

Cites work

• scientific article; zbMATH DE number 3557795 (Why is no real title available?)
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• A distance measure between attributed relational graphs for pattern recognition
• A metric for graphs
• A similarity measure for graphs with low computational complexity
• Alignment of trees -- an alternative to tree edit
• An eigendecomposition approach to weighted graph matching problems
• Controlled quantum search
• Generalised phase kick-back: the structure of computational algorithms from physical principles
• Grover's Quantum Algorithm Applied to Global Optimization
• Nonlinear quantum search using the Gross–Pitaevskii equation
• Quantum algorithms revisited
• 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

Cited in

(2)

• Controlled quantum search
• Multiple network alignment on quantum computers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105947)