Equivariant quantum graph circuits: constructions for universal approximation over graphs.
Péter MernyeiKonstantinos MeichanetzidisIsmail Ilkan CeylanPublished in: Quantum Mach. Intell. (2023)
Keyphrases
- graph representation
- quantum computing
- graph theory
- graph structure
- weighted graph
- graph theoretic
- graph construction
- directed graph
- labeled graphs
- graph databases
- adjacency matrix
- graph matching
- graph model
- graph classification
- graph clustering
- graph mining
- graph structures
- bipartite graph
- graph properties
- graph search
- graph theoretical
- random graphs
- graph partitioning
- logic circuits
- series parallel
- subgraph isomorphism
- graph representations
- laplacian matrix
- graph kernels
- undirected graph
- graph data
- reachability queries
- graph transformation
- structural pattern recognition
- spanning tree
- approximation algorithms
- graph isomorphism
- edge weights
- dense subgraphs
- inexact graph matching
- maximum cardinality
- connected graphs
- dynamic graph
- web graph
- minimum spanning tree
- attributed graphs
- neighborhood graph
- logic synthesis
- social graphs
- evolving graphs
- connected dominating set
- high speed
- random walk
- maximum clique
- adjacency graph
- graph layout
- structured data
- small world
- directed acyclic
- graph patterns
- frequent subgraphs
- bounded treewidth
- graph drawing
- polynomial time complexity
- spectral clustering
- finding the shortest path
- query graph
- maximum common subgraph
- real world graphs
- maximal cliques
- quasi cliques
- vertex set
- connected components