Brauer Analysis of Some Cayley and Nilpotent Graphs and Its Application in Quantum Entanglement Theory

: Cayley and nilpotent graphs arise from the interaction between graph theory and algebra and are used to visualize the structures of some algebraic objects as groups and commutative rings. On the other hand, Green and Schroll introduced Brauer graph algebras and Brauer configuration algebras to investigate the algebras of tame and wild representation types. An appropriated system of multisets (called a Brauer configuration) induces these algebras via a suitable bounded quiver (or bounded directed graph), and the combinatorial properties of such multisets describe corresponding indecomposable projective modules, the dimensions of the algebras and their centers. Undirected graphs are examples of Brauer configuration messages, and the description of the related data for their induced Brauer configuration algebras is said to be the Brauer analysis of the graph. This paper gives closed formulas for the dimensions of Brauer configuration algebras (and their centers) induced by Cayley and nilpotent graphs defined by some finite groups and finite commutative rings. These procedures allow us to give examples of Hamiltonian digraph constructions based on Cayley graphs. As an application, some quantum entangled states (e.g., Greenberger–Horne–Zeilinger and Dicke states) are described and analyzed as suitable Brauer messages.


Introduction
Cayley and nilpotent graphs are helpful combinatorial tools for the visualization of different algebraic structures [1][2][3][4][5][6].On the one hand, Cayley graphs were introduced as a consequence of Cayley's theorem; in such a case, given a group G and a subset S ⊆ G, the Cayley graph is an undirected graph C (G,S) = (V C (G,S) , E C (G,S) ) whose set of vertices V C (G,S) = G.Furthermore, there is an edge e g 1 ,g 2 ∈ E C (G,S) connecting two elements g 1 , g 2 ∈ G if there is an element s ∈ S such that g 1 s = g 2 [1].
Investigations regarding Cayley graphs study graph properties such as connectedness, amenability, perfect matchings, algebraic degrees, chromatic and clique numbers or the existence of Hamiltonian paths [7][8][9][10].The spectrum of the adjacency matrix of a Cayley graph allows interactions between graph, group representation and graph energy theories [11,12].In particular, Sarmin et al. [12] studied the Seidel energy for Cayley graphs associated with dihedral groups.Moreover, Cayley graphs of groups and semigroups allow applications in cryptography via the construction of provably secure hash functions [13][14][15][16].
Currently, Cayley graphs are used to design good models of network architectures.The pancake and star graphs introduced by Akers and Krishnamurthy are examples of Cayley graphs commonly accepted as models for such architectures.Butterfly networks are also examples of these kinds of graphs.
On the other hand, nilpotent graphs associated with rings have been studied by Chen, Khojasteh et al., Basnet et al. and Riyas et al. [5,6,17].If R is a ring and Nil(R) = {x ∈ R | x n = 0 for some positive integer n} is a ring R set of nilpotent elements, then the nilpotent graph N(R) = (V N(R) , E N(R) ) of the ring R has R\Nil(R) as a set of vertices.Two elements x, y ∈ R, x ̸ = y are connected by an edge e x,y ∈ E N(R) , if x + y ∈ Nil(R).Studies dealing with nilpotent graphs are similar to those presented for Cayley graphs [6].
Green and Schroll [18,19] introduced Brauer configuration algebras to investigate algebras of the wild representation type.These algebras are bounded path algebras induced by a suitable collection of multisets Γ, i.e., such algebras are generated by paths in a directed graph or quiver Q Γ whose vertices correspond to the multisets in Γ.In such a case, each element x ∈ U ∩ V with U, V ∈ Γ defines an arrow α x U,V connecting U and V. Afterwards, Espinosa [20] introduced the Brauer message of a Brauer configuration.Such a definition allowed for the application of the theory of Brauer configuration algebras in different science and mathematics fields.Undirected graphs are mainly examples of Brauer messages.Therefore, Cayley and nilpotent graphs give rise to Brauer configuration algebras, whose associated multisets and the dimensions of their centers are defined by the number of corresponding edges.
Recently, Brauer configuration algebras have been a helpful tool for research on graph energy theory, block cyphers in cryptography, the Yang-Baxter equation and the number of zinc sulfide (ZnS) molecules in clusters of n layers in zinc-blended crystals [21][22][23][24][25].
This paper defines the Brauer configuration algebras induced by some finite groups and finite commutative rings via their associated Cayley and nilpotent graphs.It gives the dimensions of these algebras, the structures of their indecomposable projective modules, the dimensions of their centers and examples of Hamiltonian Brauer quivers.Furthermore, we describe new applications to the Brauer configuration algebra theory in quantum entanglement theory; specifically, we prove that quantum GHZ entanglement states of type GHZ d n and entanglement Dicke states of type D m n , recently realized in the laboratory, can be seen as suitable Brauer messages [26][27][28][29][30].

Motivations
Cayley and nilpotent graphs are undirected graphs that allow the visualization of algebraic structures as groups and rings.Research on these graphs establishes relationships between algebra and combinatorics.Since undirected graphs are Brauer messages, the Brauer analysis of the corresponding Brauer configuration algebras allows new interactions between representations of algebras, groups and graph theories.
If a given algebraic structure is associated with an undirected graph, it is suitable for a Brauer analysis.For instance, recently, Zeilinger et al. [28][29][30] realized experiments to derive the quantum entanglement states of type GHZ and D m n ; such entanglements give rise to appropriate undirected graphs whose perfect matchings allow their final states.

Contributions
The main contributions of this paper are Theorem 1, Proposition 2, Corollary 1, Theorem 2, Corollary 2, Theorems 3-5, Corollary 5, Theorems 6-8 and Corollary 6.This paper presents Brauer analyses of nilpotent and Cayley graphs associated with some groups and commutative rings.As an application, some GHZ and Dicke states are defined as appropriate Brauer messages.
Theorem 1 proves that the Brauer configuration algebra induced by a Cayley graph defined by a set of generators of a group G satisfies the length grading property (see the fifth item in Remark 2), and closed formulas for the dimensions of these algebras and their centers are also given.Proposition 2 gives similar results for the dimensions of Brauer configuration algebras induced by butterfly graphs.Corollary 1 establishes relationships between star and pancake graphs, which help to design network interconnections.Theorem 2 gives conditions for the construction of Hamiltonian Brauer quivers, and Corollary 2 gives an example of a Hamiltonian directed graph induced by a Cayley graph.
Theorems 3-5 are devoted to the properties of Brauer configuration algebras induced by nilpotent graphs.Theorem 3 proves that Brauer configuration algebras induced by nilpotent graphs N(Z 2 n ) satisfy the length grading property, and the dimensions of these algebras and their centers can be obtained via some closed formulas.Theorems 4 and 5 give similar results for Brauer configuration algebras induced by nilpotent graphs of the form N(Z 2 n p 1 p 2 ...p t ) and N(Z p a 1 1 p a 2 2 ...p a t t ), where p j denotes an odd prime number and a i is a positive integer.Corollary 5 gives closed formulas for the centers of Brauer configuration algebras induced by connected components of some nilpotent graphs.
Theorems 6-8 and Corollary 6 give the main properties of the Brauer configuration algebras induced by quantum entanglements of type GHZ 2 n , GHZ 3 n , W n and D n/2 n .They also prove that the corresponding final states are specialized Brauer messages.

Preliminaries
This section gives basic definitions and notations regarding Cayley and nilpotent graphs associated with groups and commutative rings.It also introduces the notion of Brauer configuration algebra.Section 2.5 recalls the basic notations and definitions of quantum entanglement theory.

Background
The Cayley graph of a group was introduced in 1878 by Cayley [1]; since then, many works have been devoted to its properties and applications.According to Witte and Gallian [7], Rankin's paper [31] is the pioneering work regarding the existence of Hamiltonian cycles in Cayley digraphs.
Brian Alspach et al. [32] proved that every connected non-bipartite Cayley graph of valency at least three on a generalized dihedral group, whose order is divisible by four, is Hamilton-connected.Pastine and Jaume [33] proved that if S is a generating subset of a dihedral group D n such that D n ∩ S ̸ = ∅, then the Cayley graph of D n is Hamiltonian.
Riyas and Geetha [8] presented a study on the Cayley graphs over dihedral groups.They gave conditions for subgraphs of Cayley graphs associated with dihedral groups to be bipartite or Hamiltonian.
Applications of Cayley graphs in cryptography have been given by Charles and Lauter [14], Jao et al. [15] and Sosnovski [16], who used Cayley graphs associated with semigroups and groups to define provably secure hash functions.
Palanivel and Chithra [34] studied the energy and Laplacian energy of some Cayley graphs, whereas Sarmin et al. [12] investigated the Seidel energy for Cayley graphs associated with dihedral groups and Lu and Mönius [10] established the properties of the algebraic degree of Cayley graphs over abelian groups and dihedral groups.
The idea of using group theory to design interconnection networks was introduced in 1986 by Akers and Krishnamurthy, who presented some Cayley graphs named pancake and star graphs as examples of network architecture graphs.The butterfly and wrap-around butterfly networks are also examples of Cayley graphs in network design.The hypercube and the augmented cube are examples of the presence of Cayley graphs in networking research.
A vast body of literature is devoted to studying the properties of graphs defined by rings.Beck [2] introduced zero-divisor graphs to investigate the coloring problem in commutative rings.Afterwards, Anderson and Livingston [3] modified the notion of the zero-divisor graph introduced by Beck.Kala and Kavitha [4] also studied non-zero divisor graphs.
The notion of a weakly nilpotent graph of a commutative ring was introduced by Khojasteh and Nikmehr [5], and Basnet et al. [6] introduced nilpotent graphs for commutative rings whose edges connect non-nilpotent elements x, y with x ̸ = y if x + y is a nilpotent element.They gave conditions for rings of type Z n whose nilpotent graphs are connected, bipartite, regular or complete.
According to Schrödinger, quantum entanglement is the essence of quantum mechanics.Such a notion was introduced in 1935 by Einstein, Podolsky and Rosen to show the incompleteness of quantum mechanics theory.The trio, known as EPR, used perfect correlations of entangled states (called EPR states) to define so-called "elements of the reality", which were missing in quantum theory, according to them [26].
EPR's proposal was untestable for almost thirty years, until the introduction of Bell's inequalities, which revealed that two-particle correlations for the two spin-1 2 singlet disagree with any local realistic model.Freedman and Clauser realized such an experiment in 1972, followed by Aspect et al. between 1981 and1982.Meanwhile, the Greenberger-Horne-Zeilinger (GHZ) theorem showed that the concept of EPR's elements is self-contradictory.We recall that the 2022 Nobel Prize was granted to Clauser, Aspect and Zeilinger for their experiments regarding quantum entanglement theory [27].
The interpretation of perfect matchings' superposition as quantum entanglements was introduced by Gu, Zeilinger et al. [28][29][30].They associated suitable undirected graphs with experimental quantum entanglements, so their perfect matchings allowed GHZ and Dicke entanglement states.
Green and Schroll [18,19] introduced Brauer graph algebras and Brauer configuration algebras.These algebras are generated by paths in a suitable quiver (digraph).Espinosa [20] introduced the message of a Brauer configuration, proving that any directed graph is the Brauer message of a Brauer configuration.This result proves that any algebraic structure whose elements and operations between them define an unoriented graph also induces a Brauer configuration algebra, and it is suitable for a Brauer analysis.

Graphs and Multisets
A graph G is composed of two types of objects.It has a finite set V G = {a 1 , a 2 , a 3 , . . ., a n } of elements called vertices and a set E G of pairs of distinct vertices called edges [35].We let G = (V G , E G ) denote a graph G whose vertex set is V G , and whose edge set is E G , where A graph G can be graphically represented by drawing a dot for each vertex and linking two of these dots with a line if they constitute an edge.It is considered irrelevant how these dots and lines are drawn.According to Diestel [36], all that matters is the information offered by the picture about the edges of the graph G.
A quiver or digraph Q is a directed graph given by a system of the form (Q 0 , Q 1 , s, t), where Q 0 (Q 1 ) is the set of vertices (arrows) of Q. s and t are maps s, t : ) is said to be the source (target) of an arrow a.The graphical representation of a quiver Q is similar to the construction of a graph.In this case, two vertices (represented by dots) are connected by an arrow a whose starting vertex is the source s(a) and the ending vertex is the target t(a).A directed path is a sequence of arrows P = {a 0 , a 1 , . . ., a k−1 , a k } for which s(a i ) = t(a i−1 ),  Let Q be a digraph for which The decision problem of whether a graph has a Hamilton cycle is NP-complete [38].This problem appears on Karp's original list of 21 NP-complete problems.
Currently, there is a plethora of results regarding Hamiltonicity.For instance, Dirac proved that every graph on n ≥ 3 vertices with minimum degree at least n/2 contains a Hamilton cycle.Meanwhile, Nash-Williams proved that if Q is a digraph on n ≥ 2 vertices such that, for every vertex x, it holds that d + (x) ≥ n/2 and d − (x) ≥ n/2, then Q is Hamiltonian [39].
A multiset M is a pair M = (M, f ) of a set M and a map f : M → N, where N is the set of nonnegative integers.f is said to be the multiplicity function associated with the set M. If m ∈ M, then f (m) is the frequency of m in the multiset M, i.e., f (m) denotes the number of times that m occurs in M. In this work, it is assumed that f (m) ≥ 1 for any m ∈ M. In other words, a multiset is a set with possibly repeated elements [40].
Any finite multiset M = (M, f ) with M = {m 1 , m 2 , . . ., m n } can be written as a word w(M) with the form A permutation of a multiset (1), is a word in which each letter belongs to M and, for each m ∈ M, the number of appearances of m in the word is f (m) [40].
As an example, symmetry is a permutation of the multiset e 1 m 2 r 1 s 1 t 1 y 2 .Such permutations give rise to labeled multisets of the form (M, π) = π(w(M)).According to Espinosa [20], a labeling (M, f ) of a multiset M means that the word w(M) can be transformed using a suitable map φ : M * → A, where A is an appropriated set and M * is the set of words induced by M. In such a case, it is assumed that (M, φ) is a multiset M ′ for which w(M ′ ) = φ(w(M)).Specifically, multiset permutations define labeled multisets. If ( According to Espinosa [20], the message M(M) of a system of labeled multisets with suitable maps φ j , 1 ≤ j ≤ k is the concatenation of their words.That is, Graphs are examples of multiset messages.To see this, let G = (V G , E G ) be the graph for which V G = {0, 1, 2, 3}, E G = {e i | 0 ≤ i ≤ 3}; the edges (multisets) are given by the following identities: e 1 = {1, 2}, e 2 = {2, 3}, e 3 = {3, 0}, e 0 = {0, 1}.The labeled edges are shown in Figure 1, where The graph shown in Figure 2 is the message M(G) defined by the graph G and the labeling {φ i }, 0 ≤ i ≤ 3.
Remark 1.Note that labeled messages of type (4) can be interpreted as elements of suitable algebraic objects.In fact, the first interpretation of such messages is as elements of a monoid determined by word-polygons.However, it is possible to enrich the structure M(M) by adding a suitable collection of maps in such a way that φ i (w To obtain a specialized message M e (M) from M(M), we consider that A is a Hilbert space of type C n , where C denotes the complex numbers field and n is an appropriate integer number.Then, we define a partition F = {F 1 , F 2 , . . ., F p } for the set of words induced by M.
For j fixed and O h j ∈ O A , the specialized word w e (F j ) associated with F j and O h j ∈ O A is given by an identity of the form where B is a suitable fixed Hilbert space.Often, B = A.
The specialized message M e (M) associated with the fixed operations O h 1 , O h 2 , . . ., O h p , O s ∈ O A is given by the following identity: A system of multisets as defined in ( 3) is said to be a Brauer configuration if it is endowed with a multiplicity function, µ : M → N + , and an orientation, O, where N + is the set of positive integers.

M m denotes the intersection of all sets
corresponds to a copy of the multiset M j .The valency val(m) of an element m ∈ M (see (3)) is given by the sum.
If µ(m)val(m) = 1, then m is said to be truncated; otherwise, m is non-truncated.In this work, µ(m) = 2 if val(m) = 1.Thus, the elements m ∈ M in a Brauer configuration of type M (also called vertices) are non-truncated.Multisets in Brauer configurations are named polygons by Green and Schroll [18].
The orientation O is defined by extending the totally ordered set (S m , <) with a new relation of the form max S m < min S m .Thus, C m = (S m , <) ∪ {max S m < min S m } is a circular ordering associated with the point m.
A chain S x is the successor sequence associated with the point x.Note that all the circular orderings defined by C x are equivalent.Therefore, the Brauer configuration (M, µ, O) As in the case for unoriented graphs, each circular ordering C m is labeled with a digraph obtained by assigning to each covering of the form . Such labeling associates each circular ordering with an oriented cycle called a special cycle.Therefore, the word w(Γ) is nothing but a bounded quiver or digraph denoted Q Γ , called the Brauer quiver, induced by the Brauer configuration Γ.For an algebraically closed field k, we let Λ Γ = kQ Γ /I Γ (in brief, Λ = Q/I) denote the bound quiver algebra generated by all the paths in Q bounded by an admissible ideal I Γ generated by the following relations: We recall [18] that a multiserial algebra is defined to be a finite dimensional algebra A such that, for every indecomposable projective left and right A-module P, the corresponding radical rad(P) is a sum of uniserial modules (an A-module M is said to be uniserial if it has a unique composition series), i.e., rad(P) = m ∑ j=1 V j , where, for some integer m and uniserial modules V j , it holds that if i ̸ = j, then V i ∩ V j is either 0 or a simple A-module.

•
There is a bijective correspondence between the set of indecomposable projective Λ-modules and the polygons in Γ.

•
P is an indecomposable projective Λ-module corresponding to a polygon V in Γ.Then, rad P is a sum of r indecomposable uniserial modules, where r is the number of (non-truncated) vertices of V and where the intersection of any two of the uniserial modules is a simple Λ-module.

•
A Brauer configuration algebra is a multiserial algebra.

•
The number of summands in the heart ht(P) = rad P/soc P of an indecomposable projective Λ-module P such that rad 2 P ̸ = 0 equals the number of non-truncated vertices of the polygons in Γ corresponding to P counting repetitions.

•
Let Λ be the Brauer configuration algebra associated with a connected Brauer configuration Γ.
The algebra Λ has a length grading induced from the path algebra kQ if and only if there is an N ∈ Z >0 such that, for each non-truncated vertex, α ∈ Γ 0 val(α)µ(α) = N.In such a case, we say that the algebra Λ has the length grading property.

Cayley Graphs
If G is a group and S ⊆ G, then the Cayley graph C (G,S) induced by the system (G, S) is an undirected graph whose set of vertices V C (G,S) = G.In such a case, two elements g 1 , g 2 ∈ G are connected by an edge e, if there is an element s ∈ S such that g 1 s = g 2 .
Cayley graphs are helpful tools in modeling interconnection networks.The vertices of the graph correspond to processing elements such as memory modules or switches, and the edges correspond to communication lines.For example, the Connection Machine has a network architecture that the 12-dimensional binary hypercube can model.Akers and Krishnamurthy introduced star and pancake graphs.They found that networks modeled by these types of graphs are superior to the binary n-cube when measured by degrees, diameter and connectivity.They found that networks based on star graphs possess the maximum connectivity and minimal degradation in the presence of faults [42].
The butterfly network and the cube-connected cycle network are vertex-symmetric graphs that are widely accepted as models for network architectures.An n-dimensional butterfly is a symmetric Cayley graph whose set of vertices V = {0, 1} n × {i | 0 ≤ i ≤ n}.Two vertices, (x, i) and (y, j), are connected if and only if j = i + 1 and either x = y or x and y only differ in the jth bit.
The following result gives the Cayley graph structure induced by group generator sets.
Proposition 1 ([42], Proposition 1.1).Let S be a set of generators for a group G.The Cayley graph C (G,S) has the following properties: 1.
C (G,S) is a connected regular graph of degree equal to the cardinality of S; 2.
C (G,S) is a vertex-symmetric graph.
Let n be a positive integer and n = {1, 2, 3, . . ., n − 1, n}.The n-dimensional pancake graph denoted by P n is a graph (V P n , E P n ) whose set of vertices A sequence of the form {U 1 , U 2 , . . ., U n } denotes a sequence of vertices in P n ; e denotes the vertex 123 . . .n.A pancake graph P n is an (n − 1)-regular graph with n! vertices.
The star graph ST n is defined to be the Cayley graph of the symmetric group S n with respect to the generating set of transpositions S = {(1, 2), (1, 3), . . ., (1, n)}.Therefore, ST n is a vertex transitive graph on n! vertices with each vertex having degree n − 1.
The transposition graph ) is a tool to represent graphically a set of transpositions ∆ ⊂ S n .In such a case, V G ∆ ⊆ {1, 2, . . ., n} and two vertices i and j are connected if the transposition (i, j) ∈ ∆. Figure 3 shows the transposition graphs of the star graph ST n and the pancake graph P n .
As an example, Figures 4 and 5 show the way that the Cayley graph In this case, µ(x) = 1, for any x ∈ K. Oriented cycles C x = α x 1 α x 2 are attached to each x ∈ K.   Relations of the form (11) generate the ideal ) is a bound quiver algebra (Brauer configuration algebra).The same procedure can be applied to any graph G for which the degree deg(x) ≥ 2 for any vertex x ∈ V G .
, for all possible values of i, j and x. (11)

Nilpotent Graphs
A nilpotent graph N(R) induced by a commutative ring (e.g., Z n ) has V N(R) = R\Nil(R) as a set of vertices, where Nil(R) denotes the set of nilpotent elements of R. Two elements i, j ∈ V N(R) are connected by an edge e ∈ E N(R) provided that i + j ∈ Nil(R).
Nilpotent graphs associated with commutative rings have been studied by Chen, Khojasteh et al., Basnet et al. and Riyas et al. [5,6,17].The following Remark 3 describes some properties of the nilpotent graphs associated with commutative rings of type Z n .These results are used to prove Theorems 3-5.[6], Lemma 2.1, Corollaries, 2.2, 2.4 and 2.5) proved that if a positive integer n can be written as a product of distinct odd prime numbers with the form n = p a 1 1 p a 2 2 . . .p a t t , then the nilpotent graph N(Z n ) induced by a commutative ring of type Z n is bipartite and consists of ⌊ p 1 p 2 ...p t 2 ⌋ disjoint complete bipartite subgraphs with |Nil(
It is easy to see that if G = (Z 2 n , +) is a 2 n -element additive group group (n ≥ 1) and S = G\{0}, then the Cayley graph C (G,S) and the nilpotent graph N(Z 2 n+1 ) coincide as a consequence of Remark 3.

Quantum Entanglement Theory
A qubit or quantum bit is a quantum system Q whose state lies in a two-dimensional Hilbert space H.
A qubit is the most elementary unit of quantum information.It is a generalization of the notion of a bit in classical computing.A qubit can have two indistinguishable orthogonal states, denoted |0⟩ and 1⟩.In such a case, a qubit can be prepared as or transformed into any superposition of these two states, i.e., A photon is an ideal candidate for a qubit.Q 1 , Q 2 , . . ., Q n are quantum systems with underlying Hilbert spaces H 1 , H 2 , . . ., H n , respectively.The global quantum system Q is defined in such a way that its underlying Hilbert space H is given by the following identity: The following identities hold: Entanglement is a property of more than one quantum system such that the state of one system cannot be seen independently of the other's.It is the main source for many types of quantum information processing (e.g., quantum computing).
If n = 2, we assume that the quantum systems Q 1 and Q 2 have been separately prepared in states |φ 1 ⟩ and |φ 2 ⟩, and that they have been united without interacting.Thus, they lie in distinct Hilbert spaces H 1 and H 2 .In such a case, the physical predictions relating to one of these quantum systems do not depend in any way on the other quantum system.
The global quantum state Q is called the juxtaposition of the quantum system Q 1 and Q 2 .The state of the global quantum system Q is |φ 1 ⟩ ⊗ |φ 2 ⟩.If Q 1 and Q 2 are two qubits separately prepared in the states 1   √ 2 (|0⟩ + |1⟩) and 1 √ 2 (|0⟩ + |1⟩), then the state |φ⟩ of the global system Q is given by the following identity: Greenberger-Horne-Zeilinger (GHZ) and Dicke states D k n are classes of entangled states defined by the following identities: where n is the number of particles, k is the number of excitations, d is the dimension for every particle, and S is the symmetrical operator that gives summation over all distinct permutations of the n particles.Zeilinger et al. [28][29][30] realized experimental setups based on entanglement by path identity to build |GHZ 2 n ⟩ and |D 1 n ⟩ = |W n ⟩ states.In the experiment, to create a |GHZ 2 4 ⟩ state, four crystals were pumped coherently (crystals I and II had mode number |00⟩, whereas crystals III and IV had mode number |11⟩), and the pump power was set in such a way that pairs were produced with reasonable probabilities.They generalized the setup to find any |GHZ d n ⟩ state for n > 1 and d = 2.The final quantum state was obtained by post-selection on four-fold coincidences, which meant that all four detectors clicked simultaneously.They associated with each of these experiments a suitable undirected graph G |φ⟩ whose edges were labeled by appropriate quantum states (qubits).They calculated the tensor product of the labels attached to the perfect matchings of G |φ⟩ and the sum of all these tensor products gave the state of the (see [28][29][30]) and its perfect matchings giving the state |GHZ 2 4 ⟩ = |0000⟩ + |1111⟩.Meanwhile, Figures 9 and 10 show a setup of type W 4 and its induced graph [30].
In the last few years, quantum entanglement and quantum computing have paved the way for cryptography research.Nowadays, asymmetric cryptographic algorithms, used in key exchange protocols, appear to be most vulnerable to compromise by known quantum algorithms, specifically by Shor's algorithm.For instance, 2300 logical qubits are required to break the cryptographic system RSA based on the factoring problem.Given this potential threat to cybersecurity, the National Institute of Standards (NIST) began a process in 2016 to select and standardize replacement asymmetric cryptographic algorithms that are quantumsecure.The process was completed in 2022, when it was announced that CRYSTALS-KYBER and CRYSTALS-Dillitium were the new standards for post-quantum cryptography.
Jacques et al. implemented Grover oracles for the quantum key search on the Advanced Encryption Standard (AES).Grover's search algorithm gives a quantum attack against block cyphers.Furthermore, Yin et al. developed, in a laboratory, a quantum key distribution (QKD) method to share secret keys based on quantum entanglement [43][44][45].

Main Results
This section gives the main characteristics of the Brauer configuration algebras associated with Cayley graphs, star graphs, pancake graphs, butterfly graphs and some nilpotent graphs.Section 3.3 is devoted to the study of the Brauer configuration algebras induced by setups of type GHZ d n , W n and D m n , d ∈ {2, 3}, m = n/2, n ≥ 4.

Brauer Configuration Algebras Induced by Cayley Graphs
The following result provides the algebraic properties of the Brauer configuration algebras induced by some Cayley graphs.
Theorem 1.The Brauer configuration algebra Λ C (G,S) induced by the Cayley graph C (G,S) of a group G generated by a set S is connected and Proof.Λ C (G,S) is connected as a consequence of Proposition 1, which states that the Cayley graph C (G,S) is connected.On the other hand, we note that the Brauer configuration Γ C (G,S) induced by the Cayley graph C (G,S) has non-truncated vertices, and the number of polygons has no loops, the Formula ( 17) holds as a consequence of Remark 2. We are finished.
As an example, we note that (see Figure 5) The following proposition gives the properties of the Brauer configuration algebra Λ B n induced by the butterfly graph B n .
Proposition 2. The Brauer configuration algebra Λ B n induced by an n-dimensional butterfly graph is connected and it holds that Proof.Since B n is connected, Λ B n is connected.Furthermore, Λ B n is reduced and the Brauer quiver induced by B n has no loops.Formula ( 19) hold considering that if (w, Corollary 1 establishes relationships between the Brauer configuration algebras induced by pancake and star graphs.
Corollary 1.For any n > 2, the Brauer configuration algebras Λ P n and Λ S n induced by the nth pancake graph and the nth star graph defined by the transposition graphs shown in Figure 3 are isomorphic.
Proof.Since P n and S n are (n − 1)-regular, connected graphs with n! vertices, it holds that dim K Λ P n = dim k Λ S n for any n > 2.
Figure 11 shows the butterfly graph B 2 and its induced Brauer quiver bounded by relations of the following types: • α a i α a j α a i , for all possible values of i, j, a ∈ {x 1 , x 2 , x 3 ,  The successor sequences are given by the following identities: ( Figure 12 shows the star graph ST 3 induced by the transposition graph shown in Figure 3 for n = 3.The following Theorem 2 defines Hamiltonian Brauer quivers.
the successor sequences associated with the vertices; Then, the Brauer quiver Q M induced by the Brauer configuration M and bounded by relations of type (10) is Hamiltonian, and the number h M of Hamilton cycles is h M = n|N|.
We also note that a typical successor sequence S 2j−1 induced by the Brauer configuration Γ N(Z 2 n ) has the form 25) The following Corollary proves that Brauer quivers of type Q N(2 n ) are not Hamiltonian.
. We are finished.
As an example, the following are the successor sequences induced by the nilpotent graph N(Z 8 ) shown in Figure 13.Brauer quivers Q N Z 8 and Q N Z 16 induced by N(Z 8 ) and N(Z 16 ) are shown in Figures 13 and 14, respectively.The Brauer quiver Q N(Z 2 n ) , n > 1, is bounded by relations of the following form.
Proof.Firstly, we note that |Nil(Z t ) = 2 n−1 |.In fact, if h = 2p 1 p 2 . . .p s , then Nil(Z t ) = {jh | 1 ≤ j ≤ 2 n−1 }.Let Γ N(Z t ) be the Brauer configuration defined by the nilpotent graph N(Z t ); then, according to Remark 3, it holds that |Q 1 | can be found by building successor sequences as in the proof of Theorem 3 and enumerating their edges without taking into account repetitions.In such a case, we note that there are h/2 − 1 successor sequences with 2 n−1 edges, and h − 1 sequences with Thus, The following result gives a closed formula for the dimension of a Brauer configuration algebra induced by a graph N(Z p a 1 1 p a 2 2 ...p a t t ), where p j , 1 ≤ j ≤ t is an odd prime number and a i is a positive integer 1 ≤ i ≤ t.Theorem 5. Let Λ N(Z n ) be a Brauer configuration algebra induced by the nilpotent graph N(Z n ), where p is a product of the form n = p a 1 1 p a 2 2 . . .p a t t , where, for each 1 ≤ j ≤ t, a j is a positive integer and p j is an odd prime number, p i ̸ = p j if i ̸ = j.Then, where p = p 1 p 2 . . .p t .
Proof.It is a consequence of the results mentioned in Remark 3. Firstly, we note that We are finished.
The following Corollary gives a closed formula for the dimension of a Brauer configuration algebra induced by components of some disconnected nilpotent graphs.
Corollary 5. Let Λ κ(N(Z n ) ) be a Brauer configuration algebra induced by a component of the nilpotent graph N(Z n ) mentioned in Theorem 5.Then, a j 1 a j 2 are concatenated if M i ∩ M j ̸ = ∅.In such a case, a two-word concatenation w(M i )w(M j ) defines a path in G GHZ d n and the message M(M GHZ 2 n ) obtained via such concatenation gives G GHZ 2 n .Since each coincidence corresponds to the mode number of a photon state, it labels the corresponding polygon (edge in E GHZ 2 n ). 6.
Perfect matching PM(G GHZ 2 n ) gives a partition . Each specialized word w e(F j ) is the tensor product of its edge labels.Then, As an example, note that the Brauer quiver Q C(K,S) shown in Figure 5 and induced by the four Klein group is isomorphic to the Brauer Q induced by the quantum entanglement setup GHZ 2 4 .The following result is a version of Theorem 6 for generalized GHZ 3  n setups.We recall that the case GHZ 3  4 is the only one that has been experimentally developed.
Theorem 7. Setups of type GHZ 3 n (n ≥ 4) induce Brauer configuration algebras Λ GHZ 3 n with the following properties.
Λ GHZ 3 n has the length grading property.3.
where k is an algebraically closed field.4.
Theorem 8 concerns Brauer configuration algebras induced by setups of type D 1 n = W n .We assume the notation a 1 , a 2 , . . ., a n for particles and that one crystal produces two-photon pairs in states |01⟩ and |10⟩.
Paths associated with particles a 1 and a 2 are the only containing such a crystal.Defining, in this way, two identical word-polygons with different labels M 1 = (a 1 a 2 ; |10⟩) and M 2 = (a 1 a 2 ; |01⟩), we let L x denote the path length associated with a particle x in a setup of type W n .1.
The Brauer message of a labeled Brauer configuration M(M W n ) is the undirected graph P 2 × S n whose edges are labeled by the states |10⟩ and |01⟩, where P 2 is the two-vertex path graph and S n is an n-vertex transposition graph (see Figure 3).

5.
If the hypothesis in the sixth item of Theorem 6 holds for P 2 × S n , then M e (M W n )/ √ n = |W n ⟩.

1.
The Brauer configuration M W n = (M W n 0 , M W n 1 , µ, O) induced by a setup W n (n ≥ 4 is a fixed even integer) has the particles as a set of vertices M W n 0 = {a 1 , a 2 , . . ., a n }, and word-polygons are defined by path coincidences.There are two polygons M 1 = (a 1 a 2 ; |10⟩) and M 2 = (a 1 a 2 ; |01⟩) defined by the same words with different labels.Since (a The remaining word-polygons have the form (a r a s ; |01⟩), r, s / ∈ {1, 2}, where a r a s is an edge of the undirected graph induced by the setup.Furthermore, µ(a j ) = 1 for any a j ∈ M W n 0 .The order in the successor sequences is given as in the proof of Theorem 6.These constructions allow us to conclude that the Brauer configuration M W n is connected.

2.
We note that M W n 1 contains polygon-words of the form (a The remaining (#particles − 2)-vertices have valency 3 (note that the undirected graph induced by the setup is given by a graph product of the form P 2 × S n/2 , where S n/2 is a transposition graph (see Figure 3)).The formula holds provided that µ(a j ) = 1 for any particle a j ∈ M W n 0 .

3.
The Brauer configuration M W n is connected, M W n 0 consists of non-truncated vertices, and the induced Brauer quiver Q M Wn has no loops.The formula follows as a consequence of the seventh item of Remark 2.

4.
Words a i a j associated with polygons of the form (a i a j ; |x 1,1 x 1,2 ⟩) ∈ M W n 1 are given by path-particle coincidences.Therefore, their concatenation defines an unoriented graph G W n = (V W n , E W n ) with V W n = M W n 0 and E W n = M W n 1 .Since the concatenation is defined as in Theorem 6, it defines the undirected graph of the form P 2 × S n whose edges are labeled by photon states |10⟩ and |01⟩.

5.
This result holds by applying to the graph G W n similar arguments as in the proof of Theorem 6.
The following result concerns the D n/2 n setups introduced by Zeilinger et al. [28][29][30] to derived Dicke states of type |D n/2 n ⟩ via the perfect matchings of its associated graph., vertex-multiplicity µ and orientation O are defined as in Theorems 6-8, where labeled words have the forms (a i a j ; |10⟩) and (a i a j ; |01⟩), 1 ≤ i, j ≤ n.Then, for n ≥ 4 fixed, the Brauer configuration algebra Λ D n/2 n satisfies the following properties.

5.
The Brauer message of a labeled Brauer configuration M(M D n/2 n ) is the undirected complete graph K n whose vertices (particles) are connected by doubled edges (of the complete graph K n ) labeled by the states |10⟩ and |01⟩.

6.
If the hypothesis in the sixth item of Theorem 6 holds for K n , then M e (M D n/2 n )/ √ n = |D n/2 n ⟩. Proof.

1.
We note that, by definition, if a i , a j ∈ M D n/2 n 0 , then there is a crystal e i,j where their corresponding paths L a i and L a j coincide.

2.
val(a i )µ(a i ) = 2(#particles − 1), for any particle a i ∈ M D n/2 n 0 . .Thus, M(M D n/2 n ) is nothing but the graph induced by the setup D n/2 n .6.
As in Theorem 6, the labels associated with the perfect matchings of M(M D n/2 n ) give |D n/2 n ⟩.

Conclusions
Cayley and nilpotent graphs induce Brauer configuration algebras.If a subset S generates a group G, the induced Brauer configuration algebra satisfies the length grading property, and closed formulas for their dimensions and center can be obtained.The same can be proven for Brauer configuration algebras induced by commutative rings of the form Z 2 n .In particular, it is possible to prove that some Cayley graphs give rise to Hamiltonian Brauer quivers.
Although Brauer configuration algebras induced by butterfly graphs do not satisfy the length grading property, such algebras are connected and reduced, and it is possible to obtain closed formulas for their dimensions.These results prove that some Brauer configuration algebras induced by pancake and star graphs are isomorphic.
Since quantum entangled states GHZ 2 n , GHZ 3 n and W n give rise to undirected graphs, we conclude that such quantum states induce Brauer configuration algebras whose dimensions depend on the number of crystals used in the corresponding setups.

1.
This paper gives closed formulas for Brauer configuration algebras induced by some nilpotent graphs.It would be an interesting task for the future to give closed formulas (or to perform a Brauer analysis) for the dimensions of all Brauer configuration algebras induced by commutative rings of type Z n .2.
Another task for the future is to determine which Cayley graphs induce Hamiltonian Brauer quivers.

3.
In the future, the experimental construction of generalized quantum entangled states will allow the existence of suitable Brauer configuration algebras.

where x 1 ,
x 2 , . . ., x n are the n vertices of G in the same order.A Hamilton path in G joining vertices a and b is a Thus, a Hamilton path is given by a permutation of the n vertices of G in which consecutive vertices are joined by an edge.The Hamilton path joins the first vertex of the permutation to the last.The edges of a Hamilton path and of a Hamilton cycle are necessarily distinct [35].

Figure 1 .
Figure 1.Edges are considered labeled multisets defined by a graph.

Figure 2 .
Figure 2. Example of a graph viewed as a message of a labeled system of multisets.

Figure 3 .
Figure 3. Transposition graphs of the star graph ST n (above) and the pancake graph P n (below).

Figure 4 .
Figure 4.The Cayley graph of the Klein four-group and oriented cycles associated with its vertices.

Figure 5 .
Figure 5. Construction of a Brauer quiver from the Cayley graph of the Cayley four-group.The oriented cycles associated with vertices in the same edge are identified.

Figure 6 .
Figure 6.Nilpotent graph N(Z 8 ) is a complete graph with four vertices and six edges.

Figures 7 and 8
show a setup of type GHZ 2 4 , the induced undirected graph G |GHZ 2 4 ⟩

Figure 7 .
Figure 7. Setup of type GHZ 2 4 with four crystals and four particles.
for all possible values of i, j; • C a − C b , if a and b are endings of the same vertex e ∈ E B 2 and C x denotes a special cycle associated with the vertex x ∈ V B 2 .

Figure 11 .
Figure 11.Butterfly graph B 2 and its induced Brauer quiver.

Figure 12 .
Figure 12.Star graph ST 3 defined by the transposition graph shown in Figure 3 for n = 3.

1 , 3 n 3 n 1 | 3 n 0 .Figures 15
Figures 15 and 16 show a generalized setup of type GHZ 3n and its induced graph G GHZ 3 n .The number of perfect matchings #PM(G GHZ 3 n ) of the graph G GHZ 3 n is given by the so-called Jacobsthal sequence J n = 2 n −(−1) n

Figure 15 .
Figure 15.Generalized setup of type GHZ 3 n .

Figure 16 .Theorem 8 .
Figure 16.The graph G GHZ 3 n induced by a generalized setup of type GHZ 3 n .Theorem 8. Setups of type W n (n ≥ 4) induce Brauer configuration algebras Λ W n with the following properties.
1 = e 1 2 = e 3 3 4 3 n ) is the undirected graph G GHZ 3 n obtained via the concatenation of consecutive complete graphs K 4 (see Figures 15 and 16