Complete classification of directed quantum graphs on $$M_2$$

Abstract In 2022, Gromada and Matsuda classified undirected quantum graphs on the matrix algebra $$M_2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>2</mml:mn> </mml:msub> </mml:math> (Gromada in Lett Math Phys 112:122, 2022; Matsuda in J Math Phys. 63:092201, 2022). Later, Wasilweski provided a solid theory of directed quantum graphs (Wasilewski in 29:1281–1317, 2024) which was formerly only established for undirected quantum graphs. Using this framework we extend the results of Matsuda and Gromada, and present a complete classification of directed quantum graphs on $$M_2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>2</mml:mn> </mml:msub> </mml:math> . Most prominently, we observe that there is a far bigger range of directed quantum graphs than of undirected quantum graphs on $$M_2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>2</mml:mn> </mml:msub> </mml:math> . Moreover, for quantum graphs on a nontracial quantum set $$(M_2, \psi )$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>2</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:mi>ψ</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> we illustrate the difference between GNS- and KMS-undirected quantum graphs.

Authors

Institutions

Publication Details

Journal
Letters in Mathematical Physics
Published
2026-03-04
DOI
https://doi.org/10.1007/s11005-026-02052-0
Primary Topic
Algebraic structures and combinatorial models
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Complete classification of directed quantum graphs on $$M_2$$

Björn Malte Schäfer, Nina Kiefer
Letters in Mathematical Physics
Algebraic structures and combinatorial models
article

Complete classification of directed quantum graphs on $$M_2$$

Björn Malte Schäfer, Nina Kiefer
article en

Abstract

Abstract In 2022, Gromada and Matsuda classified undirected quantum graphs on the matrix algebra $$M_2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>2</mml:mn> </mml:msub> </mml:math> (Gromada in Lett Math Phys 112:122, 2022; Matsuda in J Math Phys. 63:092201, 2022). Later, Wasilweski provided a solid theory of directed quantum graphs (Wasilewski in 29:1281–1317, 2024) which was formerly only established for undirected quantum graphs. Using this framework we extend the results of Matsuda and Gromada, and present a complete classification of directed quantum graphs on $$M_2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>2</mml:mn> </mml:msub> </mml:math> . Most prominently, we observe that there is a far bigger range of directed quantum graphs than of undirected quantum graphs on $$M_2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>2</mml:mn> </mml:msub> </mml:math> . Moreover, for quantum graphs on a nontracial quantum set $$(M_2, \psi )$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>2</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:mi>ψ</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> we illustrate the difference between GNS- and KMS-undirected quantum graphs.

Letters in Mathematical PhysicsVol. 116(2)
Saarland University (DE)
Openalex Percentile: Top 96%
Algebraic structures and combinatorial models
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.