Graph comparison via nonlinear quantum search
DOI10.1007/S11128-019-2407-2OpenAlexW2969354510MaRDI QIDQ2105947FDOQ2105947
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
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
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)
Cites Work
- A distance measure between attributed relational graphs for pattern recognition
- Quantum algorithms revisited
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alignment of trees -- an alternative to tree edit
- A similarity measure for graphs with low computational complexity
- An eigendecomposition approach to weighted graph matching problems
- Grover's Quantum Algorithm Applied to Global Optimization
- Scattering and inverse scattering for nonlinear quantum walks
- The maximum common edge subgraph problem: A polyhedral investigation
- A metric for graphs
- Generalised phase kick-back: the structure of computational algorithms from physical principles
- Weak limit theorem for a nonlinear quantum walk
- Controlled quantum search
- Nonlinear quantum search using the Gross–Pitaevskii equation
Cited In (2)
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)
