arXiv (All)
open access
Vertex-transitive quantum graphs
We define a quantum graph to be vertex-transitive if the join of its automorphism group is the maximum quantum relation on its quantum vertex set, in direct analogy with the classical case. All simple quantum graphs in $M_2(\mathbb C)$ are vertex-transitive, but many simple quantum graphs in $M_3(\m
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Laziness of Quantum Walks on Graphs#659293
- Laziness of Quantum Walks on Graphs#657157
- Hybrid Quantum-Classical Generative Adversarial Networks with Transfer Learning#139208
- Graph Neural Post-selection for Quantum Error Correction#1155439
- Inductive Graph Representation Learning with Quantum Graph Neural Networks#1036546
Record · ID 1104446
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive