On quantum Cayley graphs

We clarify the correspondence between two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side and suggest an extension of the theory of quantum graphs to the infinite dimensional case. Then we use this framework to introduce quantum graphs associated to discrete quantum groups, leading to a new definition of a quantum Cayley graph.

Authors

Institutions

Publication Details

Journal
Documenta Mathematica
Published
2024-11-26
DOI
https://doi.org/10.4171/dm/987
Citations
2
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.69

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On quantum Cayley graphs

Mateusz Wasilewski
2 citations
Documenta Mathematica
Quantum Computing Algorithms and Architecture
0.69
article

On quantum Cayley graphs

Mateusz Wasilewski
article en
2 citations

Abstract

We clarify the correspondence between two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side and suggest an extension of the theory of quantum graphs to the infinite dimensional case. Then we use this framework to introduce quantum graphs associated to discrete quantum groups, leading to a new definition of a quantum Cayley graph.

Documenta MathematicaVol. 29(6)
Polish Academy of Sciences (PL)
Narodowa Agencja Wymiany Akademickiej
Openalex Percentile: Top 23%
Quantum Computing Algorithms and Architecture
0.69
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.