Quantum isomorphism of graphs from association schemes
From MaRDI portal
Publication:6144402
DOI10.1016/j.jctb.2023.09.005arXiv2209.04581OpenAlexW4387834961MaRDI QIDQ6144402
Publication date: 29 January 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.04581
Association schemes, strongly regular graphs (05E30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum homomorphisms
- Distance-regular graphs
- On knot invariants related to some statistical mechanical models
- Commutative association schemes
- A characterization of \(P\)- and \(Q\)-polynomial association schemes
- An optimal lower bound on the number of variables for graph identification
- Strongly regular graphs and spin models for the Kauffman polynomial
- Hadamard equivalence via graph isomorphism
- Quantum symmetry groups of finite spaces
- Problems in algebraic combinatorics
- On spin models, triply regular association schemes, and duality
- Scaffolds: a graph-theoretic tool for tensor computations related to Bose-Mesner algebras
- Nonlocal games and quantum permutation groups
- Quantum and non-signalling graph isomorphisms
- Exponentially many Hadamard designs
- Quantum permutations, Hadamard matrices, and the search for matrix models
- Operations with structures
- Spin models constructed from Hadamard matrices
- Quantum permutation matrices