Skip to main content
Have a personal or library account? Click to login
Eigenvalues of Two-Parameter Complex Hadamard Matrices of Order Six Cover

Eigenvalues of Two-Parameter Complex Hadamard Matrices of Order Six

By:  and    
Open Access
|Jun 2026

Full Article

1. Introduction

Characterizing complex Hadamard matrices of order n is a fundamental problem in quantum physics, as it is a way to find the complete mutually unbiased bases (MUBs). In general, k MUBs in Hilbert space ℂn are k orthogonal bases, the inner product of any two vectors from different bases has a modulus of 1/n. When there are n + 1 MUBs in ℂn, then they are referred to as complete MUBs. So far, it has been proven that complete MUBs exist in ℂn when n is a prime power [1]. The complete classification of CHMs gives us a new way to find the maximal MUBs in the unsolved dimensions. In particular, the dimension six is the smallest one. Paper [2] investigated that the average distance between four bases in dimension six, providing a strong evidence against the existence of four MUBs in ℂ6. Paper [3] showed that if complete MUBs in dimension six exist, it cannot include more than one product basis. The examination of the number of product vectors in a set of four MUBs in dimension six showed that each of the remaining three MUBs contains at most two product vectors [4]. The existence and limitations of MUB product bases in dimension six were explored in [57]. The skills such as Schmidt ranks, Lie algebra, semidefinite programming, entanglement theory and so on are used in [814].

The complete classification of 6 × 6 CHMs is also unsolved. Karlsson presented a three-parameter CHMs family in ℂ6 [15], and named the family “the H2-reducible matrices”. As far as we know, most known 6 × 6 CHMs belong to the H2-reducible matrices such as the Haagerup matrix [16], but the Tao matrix is an exception [17]. The paper [18] presented a four-parameter 6 × 6 CHM family, though the analytic form of these matrices is still unknown. Another idea is analyzing the eigenvalues of the CHM. It was shown that CHMs of order six with dephased form have eigenvalues 6, – 6, and for the remaining four eigenvalues, at most two of them are the same [19]. More facts investigating the classification problem have been presented in [2025].

CHMs in dimension six are also bipartite unitary matrices from the point of view in quantum information theory. Such matrices can be applied to create quantum entanglement and to implement quantum circuits and cryptography [26]. The so-called controlled-unitary (say controlled-NOT) gate, which is a fundamental bipartite unitary operator, serves as both the primary entanglement resource and a critical component of universal quantum computation [27]. Finding the decompositions by controlled-unitary gates of bipartite unitary operators generated by CHMs will provide a simple physical realization of complex operations. Schmidt rank of bipartite unitary matrices was shown to be closely connected to the existence of this decomposition [28,29].

In this paper, we investigate CHMs with certain type of eigenvalues. In Theorem 1 we prove that CHMs with only two sorts of eigenvalues must be complex equivalent to a family we will refer to as K(d, x) in (8) with two parameters d, x. Lemma 1 gives the solutions of parameters in Theorem 1, and gives the suitable value range of the parameters. The main technical treatment in the proof of Theorem 1 is the construction in (A4), which exhausts the form of CHMs with only two sorts of eigenvalues. Next we analyze the CHMs in dephased form whose eigenvalues are 6, – 6, λ1, λ1, λ2, λ2. We give a complete classification of these CHMs, containing the Tao matrix in (3) and a family K′ (d, x) in (21) with parameters d, x. That is the result in Theorem 2. The key equation in the proof of Theorem 2 is shown in (A35), which gives the main restriction of this class of CHMs. In Corollary 1 we present the outcome of a special case of Theorem 2, we claim that if λ2 = –λ1, then such CHM must be complex equivalent to the Hermitian matrices. In Theorem 3 we show that a family of K(d, x) has Schmidt rank at most three, and this family can be carried out as controlled unitary gates.

The rest of this paper will be presented as follows. In Section 2 we introduce some facts used in this paper, such as the definition of MUBs and CHMs, the eigenvalues of some famous CHMs. In Section 3, we classify all the CHMs with the specified eigenvalue structure. In Section 4, we find the application of some CHMs in implementable unitary gate. We conclude in Section 5.

2. Preliminaries

In this section, we present the definition of CHMs and MUBs, as well as the eigenvalues of some special CHMs.

Definition 1.

Suppose1 = {|ϕ1j〉}j=1,…,d,…, ℬn = {|ϕnj〉}j=1,…,d are n orthonormal basis ind, if

|ϕjlϕkm|=1d,
for any jk, j, k = 1, …, n; l, m = 1, …, d, then ℬ1, …, n form n MUBs.

Definition 2.

If H = [hjk] is an n × n complex matrix satisfying

  • (i). |hjk| = 1 for any j, k = 1, …, n;

  • (ii). H · H = nI,

then H is an n × n complex Hadamard matrix(CHM).

We also introduce the definition of complex equivalence. We refer to the monomial unitary matrix as a unitary matrix that every row and column have exactly one nonzero element. Then two matrices U and V are complex equivalent when U = PVQ where P, Q are monomial unitary matrices.

Next we list some famous CHMs and their eigenvalues. The Haagerup matrices [16] are

1
H6q=[11111111iiii1i1iqq1ii1qq1i1q1q1i1i1q1qi1],
where |q| = 1. The eigenvalues of H6q are 6, – 6, –1 + 5i, –1 + 5i, –1 – 5i, –1 – 5i.

Second, the Diţă matrix D0 [30] is equivalent to H6q for q = ±i. D0 has the same eigenvalues as H6q.

2
D0=[11111111iiii1i1iii1ii1ii1iii1i1iiii1].

Third, the Tao matrix is isolated and belongs to the Buston matrices [31,32].

3
S6(0)=[11111111ωωω2ω21ω1ω2ω2ω1ωω21ωω21ω2ω2ω1ω1ω2ωω2ω1],
where ω=e2πi3. The eigenvalues of S6(0) are 6,6,3+15i2,3+15i2,315i2,315i2.

The Hermitian matrices, by exchanging rows and columns, can take the following form [33],

4
H(t)=[111111111xy1xy1x1ttx11y1t11y1t1x1ty11z11y1xtz1],
where θ ∈ [–π, – arccos(1+32)] ∪ [arccos(1+32), π], and the parameters x, y, t, z are given by
5
y=eiθ,z=1+2yy2y(1+2y+y2);
6
x=1+2y+y22(1+2y+2y3+y4)1+2yy2;
7
t=1+2y+y22(1+2y+2y3+y4)1+2y+y2.

The eigenvalues of the Hermitian matrix H(t) are 6,6,6,6,6,6.

3. Result

In this section, we will present our results in this paper. We will discuss CHMs with special type of eigenvalues up to complex equivalence. Though eigenvalues are not invariant with respect to the equivalence relation, we can simplify the result by this relation and at the same time, no results will be omitted. We first consider a family of CHMs with exactly two sorts of eigenvalues. Paper [19] claimed that there is no 6 × 6 CHM with four identical eigenvalues. So the two distinct eigenvalues must be of algebraic multiplicity three. The following theorem shows the complete classification of such CHMs.

Theorem 1.

The order-six CHM with exactly two sorts of eigenvalues is complex equivalent to the following CHM.

8
K(d,x)=[d111111d¯xy¯xy¯1x¯d¯zzx¯1yz¯d¯yz¯1x¯z¯y¯dxyz¯1yxzxyzd].

Here the parameters d, x, y, z are all of modulus one and satisfy

9
2Re[d]+x+y+z+xyz=0.

If d = e, then the eigenvalues of K(d, x) are

10
λ1=6sin2θ+isinθ,λ2=6sin2θ+isinθ.

The proof of Theorem 1 will be present in Appendix A. The restriction in (9) can be solved by the following lemma. Note that if |d| = 1, then –2Re[d] ∈ [–2,2].

Lemma 1.

For a real number r ∈ [–2,2], suppose the complex numbers x, y, z of modulus one satisfy the following equation,

11
r+x+y+z+xyz=0.

We denote x = e1, y = e2, z = e3, then x, y, z can be solved as follows.

  • (i) If r = 0, then {x, y} = {1,−1} or {y, z} = {1, –1} or {x, z} = {1, –1}.

  • (ii) If ϕ1 = – ϕ2, then cos ϕ1=r22, ϕ3 = 0 or cos ϕ1=r+22, ϕ3 = ±π.

  • (iii) If ϕ1ϕ2 = ±π, i.e. x = –y, then z+z¯=r,{x,y}={i¯z¯,iz¯}.

  • (iv) For other cases, a, b, c can be solved by

    12
    y=rx2+r2x+r±Δ2(x2rx1),
    13
    c=r+x+y1+xy,
    where
    14
    Δ=(r2+4)x4+2r3x3+(r42r28)x2+2r3x+r2+4,
    and the range of ϕ1 is
    15
    r342r2+22(r2+4)cosϕ1r3+42r2+22(r2+4).

The proof of Lemma 1 will be presented in Appendix B. Noting that the solutions of (9) can be expressed by parameter ϕ1 below (11) or x. So the notation K(d, x) means a class of two-parameter CHMs, here d controls the eigenvalues, d and x control the solutions of restriction (9).

Recall that the CHM of order-six with dephased form has eigenvalues 6,6 [19]. If the remaining four eigenvalues have at most two distinct elements, then [19] claims that the remaining four eigenvalues are λ3, λ3, λ4, λ4 with λ3 ≠ λ4. Next we present another theorem to classify such CHMs.

Theorem 2.

Suppose that an order-six CHM H with dephased form has eigenvalues 6,6,λ3,λ3,λ4,λ4. Then H is complex equivalent to the Tao matrix S6(0) in (3) or the following two-parameter H2-reducible CHM

16
K(d,x)=[11111111xdy¯dxdy¯d1x¯d1zdzdx¯d1ydz¯d1ydz¯d1x¯dz¯dy¯dd2xyz¯d1ydxdzdxyzdd2],
where
17
λ3=dλ1,λ4=dλ2
with d, λ1, λ2 in (10).

In particular, if d = ±i, then K′(±i, x) is complex equivalent to Haagerup matrices in (1). If d = ±1, then K′(±1, x) in (16) is complex equivalent to Hermitian matrices in (4).

We present the brief version of proof of Theorem 2 below. More details can be found in Appendix C. The proof shows the connection between Theorems 1 and 2. In fact, K(d, x) and K′ (d, x) are equivalent by the equality

18
K(d,x)=d·p·K(d,x)·p
where
19
P=[d¯00000010000001000000100000010000001].

Proof.

For a given H in dephased form with eigenvalues 6,6,λ3,λ3,λ4,λ4, we choose

20
|u1=112+26[1+611111],|u2=11226[1611111].
as the eigenvectors of 6,6, respectively. We have
21
H=H2+λ3j=34|ujuj|+λ4j=56|ujuj|.

Here

22
H2=6|u1u1|6|u2u2|=15[555555511111511111511111511111511111].

The equation (21) can be rewritten as follows.

23
H=6|u1u1|6|u2u2|+λ3i=34|uiui|+λ4j=56|ujuj|
24
=6|u1u1|6|u2u2|+λ3(I|u1u1||u2u2|)+(λ4λ3)j=56|ujuj|
25
=15[55555551+4λ31λ31λ31λ31λ351λ31+4λ31λ31λ31λ351λ31λ31+4λ31λ31λ351λ31λ31λ31+4λ31λ351λ31λ31λ31λ31+4λ3]+(λ4λ3)j=56|ujuj|.

Let the vectors |uj=[g1j,,g6j]T,j=5,6, and we can deduce the expressions of all elements in H. The details will be present in Appendix C.

By discussing three distinct cases, we obtain the relations of λ3, λ4. Further construction shows that for given CHM in dephased form with eigenvalues 6,6,λ3,λ3,λ4,λ4, we will deduce the Tao matrix in (3) or a CHM with two sorts of eigenvalues, that is K(d, x). By Theorem 1, we have finished the proof of Theorem 2. The details will be present in Appendix C.

Corollary 1.

Suppose H is an order-six CHM in dephased form with the first two eigenvalues 6 and6.

  • (i) If H has the remaining four eigenvalues λ, λ, – λ, – λ, then H is the Hermitian matrix in (4).

  • (ii) If H has the remaining four eigenvalues of at most two distinct elements, then H has been completely studied in [19] and Theorem 2.

Proof.

(i) By using Theorem 1, we substitute λ3 = – λ4 into (10). We know that d = ±1, and thus {λ3,λ4}={6,6}. Hence H is the Hermitian matrix in (4). (ii) If the four remaining eigenvalues satisfy λ3 = λ4 = λ5, then by the result of Theorem 5 in paper [19] we deduce the contradiction. If λ3 = λ4 and λ5 = λ6, then Theorem 2 has done the complete classification of this case.

4. Application

In this section, we introduce an application of our results. For a bipartite Hilbert space ℋA ⊗ ℋB, a controlled unitary gate up to local unitary equivalence takes the form

26
U=i=1dA|ii|AUB(i).
where {|iA} is an orthonormal basis for subsystem A and UB(i) are unitary operators acting on subsystem B. dA is the dimension of subsystem A.

It is known that every bipartite unitary matrix can be regarded a non-local operation from the viewpoint of quantum information. For example, the so-called controlled-NOT and other types of controlled unitary gates play a key role in quantum computing and so on, as every bipartite unitary gate can be decomposed into the product of some controlled unitary gates [34].

Further, it has been proven that a bipartite unitary gate of Schmidt rank at most three is actually a controlled unitary gate [28], which is more easily implementable in experiments. Here, for a bipartite unitary matrix U ∈ ℋA ⊗ ℋB, the Schmidt rank is the smallest integer r such that

27
U=i=1rλiMi(A)Ni(B)
with linearly independent sets {Mi} and {Ni} and all λi > 0.

In the following, we show that a family of CHMs K(d, x) are complex equivalent to some CHMs of Schmidt rank three. In particular, all order-six Hermitian CHMs are included in this family. Hence, such CHMs can be actually carried out as a controlled unitary gate, and they can be applied in experiments more easily. Our result help realize more non-local operations in quantum system with less coherence time and lower error rates.

Theorem 3.

For the CHM K(d, x) in (8), if x = d or x=d¯ and {y,z}={ix¯,ix¯}, then K(d, x) is complex equivalent to a CHM whose Schmidt rank is at most three.

Proof.

We consider the monomial unitary matrix

28
Q=[10000000000y¯0000z0000100010000001000],
then we have
29
M=Q·K(d,x)·Q=[d111zy¯1dxyz¯y¯1xy¯1xyzdzxz11yz¯d¯11z¯1xz¯1d¯xyz¯yxy11xyzd¯].

We denote M=[ABCD] and A, B, C, D are four 3 × 3 submatrices of M. Then we have

30
A+D=(dd¯)I3,
and
31
B+C=[2yzy¯z¯y¯z¯2x¯(y¯+z¯)yzx(y+z)2].

If y = –z, then B + C = 2I3, and A + D, B + C are linear dependent. It means that the CHM M has Schmidt rank at most three. Using the Lemma 1 we know that if y = –z, then x = d or x=d¯ and {y,z}={ix¯,ix¯}. Hence we have finished the proof.

For example, if d = 1, then x = 1 and K(d, x) is indeed Hermitian. We shall take y = i, z = –i, then M in (29) turns to be

32
[1111ii111i1i111ii11ii111i1i111ii1111]
and we can rewrite M as follows:
33
M=[1001][111111111]+[0100][1iii1iii1]+[0010][1iii1iii1]

We take

34
Q1=I216[231231202].

Then

35
Q1+MQ1=[112i1+2i1]|00|+[21+i1i2](|11|+|22|).

Where |0〉 = [1,0,0]T, |1〉 = [0,1,0]T and |2〉 = [0,0,1]T. So we know that up to local unitary equivalence, M is a controlled unitary gate. Thus it can be applied in experiments more easily.

5. Conclusion

In this paper, we have presented the complete classification of CHMs with two sorts of eigenvalues λ1, λ2, these CHMs are included in a two-parameter family K(d, x) in (8). Moreover, we have classified all CHMs with dephased form whose eigenvalues are exactly 6,6,λ1,λ1,λ2,λ2, this class consists of K′(d, x) in (21) and Tao matrix in (3), here K′(d, x) is complex equivalent to K(d, x) for the same d, x. One interesting thing is that some known CHMs such as Diţă matrix, Haagerup matrices and Hermitian matrices, are included in the class K′(d, x) and all CHMs in this class are H2-reducible. We have shown that the Schmidt rank of some CHMs including all Hermitian CHMs in K(d, x) is at most three up to complex equivalence. Our future research will focus on the Schmidt rank of every CHM in K(d, x) and more CHMs with three or more sorts of eigenvalues to find more connections between the classification of CHMs and their eigenvalues.

Notes

[1] Contributed by Author Contributions

Authors equally contribute to the paper. All authors have read and agreed to the published version of the manuscript.

[2] Conflicts of interest Conflicts of Interest

No conflict.

[3] Data Availability Statement

No data.

Appendices

Appendix A. The proof of Theorem 1

Proof.

We consider the spectral decomposition of a CHM H whose eigenvalues are λ1, λ1, λ1, λ2, λ2, λ2, that is, H = λ1H1 + λ2H2, with projection matrices H1, H2. It implies that Hj·Hk=0 for jk and Hj·Hj=Hj and Hj=Hj for j = 1,2. We have H1=j=13|ujuj| and H2=j=46|ujuj|, such that H1 + H2 = I6. If we consider the matrix M=6λ1H, then M=6H1+λH2 with λ=6λ2λ1. So we obtain that M=6I6+(λ6)H2. The point of our proof is to design the projection matrix H2 such that M is indeed a CHM for a given λ. Since all the entries of M have modulus one, we consider the diagonal elements and non-diagonal elements of M respectively. If we denote M = [hjk] and H2 = [gjk], then the diagonal elements are hjj=6+(λ6)gjj and the non-diagonal elements can be expressed by hjk=(λ6)gjk for jk. So we have

A1
|6+(λ6)gjj|=1,|(λ6)gjk|=1,j,k{1,,6};jk.

Recall that H2=j=46|ujuj|, we see that gjj is real for all j ∈ {1, …, 6}. The first equation shows that

A2
[6+(λ6)gjj]·[6+(λ¯6)gjj]=1,
which means (126(λ+λ¯))gjj2(126(λ+λ¯))gjj+5=0. If we denote m=Re[λ]6, then the solution will be expressed by gjj=12±3m+212(m1). The second equation in (A1) shows that |gjk|=1|λ6|=11212m. The range of m is in [–1, 1], and the above gjj and |gjk| are both real. So 3m+212(m1)0 and 12 – 12m < 0, hence the range of m should be restricted in [1,23].

We then rewrite the projection matrix H2 by H2=12I6+kM(a), and once we take k=11212m, then the non-diagonal elements of M(a) have modulus one. The diagonal elements have modulus 3m2. We denote a=3m2, then k=120+4a2 and we have already constructed the following form of Hermitian matrices M(a), here a is real, 0 ≤ a ≤ 1. For M(a) = [fjk]6×6, the entries of M(a) satisfies the following conditions: For jk, we have |fjk| = 1, fjk=fkj¯, and fjj = ±a. Since the trace of M is 3(6+λ) and the trace of M can also be 66+6×12(λ6)+j=16gjj=3(6+λ)+j=16gjj, we must have j=16gjj=0 so j=16fjj=0. We shall assume f11 = f55 = f66 = a and f22 = f33 = f44 = –a, then M(a) takes the following form.

A3
[a111111a1a1a1a1a]

Now we recall that M is a CHM, then M · M = 6I6, and

A4
M=6I6+(λ6)(12I6+120+4a2M(a)),
it means that M(a) · M(a) = M(a)2 = (5 + a2)I6.

We analyze the orthogonality of row 1 and rows 2,3,4 of M(a) in (A3), and we assume the entries of M(a) to be

A5
M(a)=[a111111ah23h24h25h261h23¯ah34h35h361h24¯h34¯ah45h461h25¯h35¯h45¯ah561h26¯h36¯h46¯h56¯a]

The orthoganality of rows 1,2 shows that h23 + h24 + h25 + h26 = 0. By permuting rows and columns, we divide into two cases namely Case A, B, that is h23 = –h24 or h23 = –h25.

Case A.

h23 = –h24, we denote x1 = h23, x2 = h25, then M(a) become

A6
[a111111ax1x1x2x21x1¯ah34h35h361x1¯h34¯ah45h461x2¯x1h45¯ah561x2¯h34¯h46¯h56¯a]

Considering the orthogonality of rows 1,3, we have x1¯+h34+h35+h36=0, then we discuss the following two cases by permuting columns 5,6, namely Case A.1 and A.2, that is h34=x1¯ or h35=x1¯.

Case A.1.

h34=x1¯, then h36 = –h35 and the orthogonality of rows 3,4 shows that a(x1+x1¯)+h35(h45¯h46¯)=0. The orthogonality of rows 2,4 shows that a(x1+x1¯)+x2(h45¯h46¯)=0. So h35 = x2 or h45 = h46. If h35 = x2, then the orthogonality of rows 2,3 shows 3a(x1+x1¯)+x12=0, the equation has no solution, which is a contradiction. If h45 = h46, then a = 0 or x1 = ±i. Now if a = 0, then the inner product of rows 2,3 is 1+x12+2x2h35¯=0. Then x12=1 and x2h35¯=1, then x1 = ±1, h35 = –x2, M(a) becomes

A7
[01111110x1x1x2x21x10x1x2x21x1x10x1x11x2¯x2¯x10h561x2¯x2¯x1h56¯0]

The orthogonality of rows 4,5 shows h56 = –x1, then for any x2, M(a) indeed satisfies that M(a)2 = 5I6. For x1 = 1 weobtain M(0)1, for x1 = –1 we obtain M(0)2. The expression of M in (A4) deduced by M(0)1 or M(0)2 will be shown in the latter case.

If x1 = ±i, then the inner product of rows 2,3 is 2ax1+2x2h35¯=0, so a = 1. We then find that M(a) is indeed a self-adjoint CHM, which means M(a) is complex equivalent to Hermitian matrices in (4). Moreover, m = –1 and λ=6. It is known that CHM with eigenvalues 6,6,6,6,6,6 is complex equivalent to Hermitian matrices in (4).

Case A.2.

h35=x1¯, then h36 = –h34, and the row 5 turns to [1, x2¯, –x1, h45¯, a, h56], the orthogonality of rows 2,5 shows that x1h45x2h56¯=0. And the orthogonality of rows 3,5 and shows that 1+x1¯x2+h34(h45h56¯)=0, then (1+x1¯x2)(1h34h56¯)=0, then h34 = h56 or x2 = –x1. If h34 = h56, then the orthogonality of rows 1,6 shows 1x2¯+h46¯+a=0, since we let 0 ≤ a ≤ 1, then h46=x2¯. The orthogonality of rows 2,6 and rows 4,5 show that 1+x1x2¯+h34(x2x1)=0 and 1x1x2¯h34(x1+x2)=0. Then h34=x1¯, then h45 = –x2. The inner product of rows 1,5 is 2a+x1¯x1=0, which shows x1 is real and a = 0. The orthogonality of rows 1,4 shows that h46 = x2, so M(a) takes the following form.

A8
[01111110x1x1x2x21x10x1x1x11x1x10x2x21x2¯x1x2¯0x11x2¯x1x2¯x10]

We denote this matrix by M(0)3. The expression of M in (A4) deduced by M(0)3 will be shown in the latter case.

If x2 = –x1, then rows 2 and 4 are respectively [1, –a, x1, –x1, –x1, x1] and [1, x1¯, x1, –a, –x1, x1¯], the orthogonality of rows 2,4 shows that 3+a(x1+x1¯)+x12=0, which has no solution.

Case B.

h23 = –h25, then by permuting rows and columns, the first four rows of M(a) must be

A9
[a111111ax1x2x1x21x1¯ax3h35h361x2¯x3¯ah45h46]

Here x1 ≠ –x2, x3x1¯, x3 ≠ –x2, otherwise Case B will degenerate into Case A. By permuting rows and columns and redefining x1, x2, x3, there are only two distinct cases to discuss, that is h35=x1¯,h36=x3,h45=x2¯,h46=x3¯orh35=x3,h36=x1¯,h45=x2¯,h46=x3¯. We denote the two cases by Case B.1 and Case B.2.

Case B.1.

Now M(a) is

A10
[a111111ax1x2x1x21x1¯ax3x1¯x31x2¯x3¯ax2¯x3¯1x1¯x1x2ah561x2¯x3¯x3h56¯a]

The orthogonality of rows 3,5 shows that h56 = –x2. The orthogonality of rows 1,5 and 1,6 show that x2 is real and either x1 = x3 or x1=x3¯. The orthogonality of rows 4,5 implies that x1=x3¯. By solving the equation M(a)2 = (5 + a2)I6, we obtain the only restriction, that is

A11
2ax1+2x1x2+x12+1=0.

We substitute x = x1, y=x3=x¯, z = x2, the above equation turns to – 2a + 2z + x + y = 0, i.e. – 2a + x + y + z + xyz = 0. This case corresponds to the case ϕ1 = –ϕ2 in Lemma 1. The solutions and the expression of M in (A4) will be shown in the latter case.

Case B.2.

Now M(a) is

A12
[a111111ax1x2x1x21x1¯ax3x3x1¯1x2¯x3¯ax2¯x3¯1x1¯x3¯x2ah561x2¯x1x3h56¯a]

The orthogonality of rows 3,5 shows that h56=x1¯x2x3¯. Computing M(a)2, we denote M(a)2 = [fjk]6×6, then f11 = f22 = ⋯ = f66 = 5 + a2, and |f15|=|2ax1x3x2¯x1x2¯x3|. To satisfy M(a)2 = (5 + a2)I6, we must have

A13
x1+x2¯+x3+x1x2¯x3=2a.

The equation above is the only restriction such that M(a)2 = (5 + a2)I6 in Case B.2. To solve this equation, we substitute x = x1, y=x2¯, z = x3, then equation A13 becomes

A14
x+y+z+xyz=2a.

By Lemma 1 we can solve the above equation. In fact, this equation takes the same form as equation (9).

In fact, If we take a = 0, the equation (A13) has solutions {x1, x2} = {1, –1} or {x1, x3} = {1, –1} or {x2, x3} = {1, –1}. If we take {x1, x3} = {1, –1}, then the matrix in (A12) gives M(0)1 and M(0)2 in Case A.1 and M(0)3 in Case A.2 up to complex equivalence. Moreover, if we take y=x¯, then by the result in Lemma 1 (ii) we can solve the case B.1.

In conclusion, M(a) must be complex equivalent to

A15
[a111111axy¯xy¯1x¯azzx¯1yz¯ayz¯1x¯z¯y¯axyz¯1yxzxyza]

Then

A16
M=λ620+4a2[d111111d¯xy¯xy¯1x¯d¯zzx¯1yz¯d¯yz¯1x¯z¯y¯dxyz¯1yxzxyzd]

Here d=20+4a2λ6·[6+(λ6)(12+a4a2+20)]. We know that Re[λ]=6m=63(2+a2), and we may assume Im[λ]=108a22a43, then d=25+a2(a1a2i). The eigenvalues of M are 6,6,6,λ,λ,λ, λ, λ, λ. For the simplicity of the form, we denote

A17
K(d,x)=[d111111d¯xy¯xy¯1x¯d¯zzx¯1yz¯d¯yz¯1x¯z¯y¯dxyz¯1yxzxyzd]

In conclusion, CHMs with two sorts of eigenvalues must be complex equivalent to two-parameter matrices K(d, x). The meaning of parameter d, x will be explained in detail in Lemma 1. The trace of K(d, x) is 6Im[d], we denote the two sorts of eigenvalues by

A18
λ1=20+4a2λ6·6,λ2=20+4a2λ6·λ,
and rewrite d = e, then by computation we know that
A19
λ1=6sin2θ+isinθ,λ2=6sin2θ+isinθ.

Hence we have finished the proof of Theorem 1.

Appendix B. The Proof of Lemma 1

Proof.

If r = 0 then we have x = –y or x = –z or y = –z. If x = –y, then equation (11) turns to za y2z = 0. Hence y = ±1, and {x, y} = {1, –1}. For the other two cases, we can deduce {x, z} = {1, –1} or {y, z} = {1, –1} similarly.

If r ≠ 0, then r ∈ [–2, 0) ∪ (0, 2]. Now if 1 + xy = 0, then y=x¯, then (11) turns to r+xx¯=0, which means x ∈ ℝ and r = 0, hence the contradiction. So we obtain that z=r+x+y1+xy.

To satisfy |z| = 1, we have

A20
(1+x¯y¯)(1+xy)=(r+x+y)(r+x¯+y¯).

Then

A21
(xx¯r)y2r(x+x¯+r)y+(x¯xr)=0.

We obtain that

A22
y=rx2+r2x+r±Δ2(x2rx1).
where
A23
Δ=(r2+4)x4+2r3x3+(r42r28)x2+2r3x+r2+4.
here the square root denotes the principal value of the complex power function zz12. Next we discuss the condition that keeps |y| = 1.

We assume x = e1, y = e2, z = e3, then

A24
{cosϕ1+cosϕ2+cosϕ3+cos(ϕ1+ϕ2+ϕ3)=r;sinϕ1+sinϕ2+sinϕ3+sin(ϕ1+ϕ2+ϕ3)=0.

If ϕ1 = –ϕ2, then (A24) becomes

A25
{2cosϕ1+2cosϕ3=r;2sinϕ3=0.

Once λ1, λ2 are given, then r is also given, we can solve x, y, z due to (A25). That is, cosϕ1=r22,ϕ3=0 or cosϕ1=r+22, ϕ3 = ±π.

If ϕ1 + ϕ2 = π, then x=y¯, and (A24) becomes

A26
{0=r;2sinϕ1=0.

Hence r = 0, which is a contradiction.

If ϕ1ϕ2 = ±π, then x = –y, (11) becomes r + zy2z = 0, then y = ±1 or y2z2 = –1. y = ±1 violates the restriction; y2z2 = –1 means z+z¯=r,{x,y}={iz¯,iz¯}.

For other cases, we have

A27
sinϕ3=r+cosϕ1+cosϕ2+(1+cos(ϕ1+ϕ2))cosϕ3sin(ϕ1+ϕ2)=sinϕ1+sinϕ2+sin(ϕ1+ϕ2)cosϕ31+cos(ϕ1+ϕ2).

We square both sides of equations of (A24). Their sum is

A28
cosϕ3=r244cosϕ1cosϕ2cosϕ1+cosϕ2.

Substituting the value of cos ϕ3 in (A28) to (A27), we have

A29
12cosϕ1+ϕ22secϕ1ϕ22(r2+2r(cosϕ1+cosϕ2)+4sinϕ1sinϕ2)=0.

Then we have

A30
r22rcosϕ1=2rcosϕ2+4sinϕ1sinϕ2.

The right side of (A30) can be written as 4r2+16sin2ϕ1sin(ϕ2+ψ), where tanψ=r2sinϕ1. For the case that sin ϕ1 = 0, we stipulate that ψ=π2. Since sin( ϕ2 + ψ) ∈ [–1, 1], we deduce the value condition of ϕ1 below.

A31
1r2+2rcosϕ14r2+16sin2ϕ11.

So we have

A32
r342r2+22(r2+4)cosϕ1r3+42r2+22(r2+4).

This equation ensures that |y| = 1 and determines the range of ϕ1. Hence we have finished the proof.

Appendix C. The Proof of Theorem 2

Proof.

We assume |u5〉 = [0, g2, g3eis3, g4eis4, g5eis5, g6eis6]T, |u6〉 = [0, h2, h3eit3, h4eit4, h5eit5, h6eit6]T and denote s2 = t2 = 0 and λ3=6eiθ1,λ4=6eiθ2. We have

A33
hjk=1515λ3+(λ4λ3)(gjgkei(sjsk)+hjhkei(tjtk)),j,k2,jk,
A34
hjj=15+45λ3+(λ4λ3)(gj2+hj2),j2,
A35
hjk|2|hkj|2=856(6cosθ1θ22+cosθ1+θ22)·sinθ1θ22.gjgksin(sjsk)+hjhksin(tjtk)=0.

To satisfy the condition in (A35), we divide our discussion into three cases, namely Case A, B and C.

Case A.

If sin sinθ1θ22=0, then θ1 = θ2, and λ3 = λ4. From the first sentence below (19), we see that K′(d, x) has four identical eigenvalues. However the CHM with four identical eigenvalues does not exist due to Theorem 6 in [19].

Case B.

If gjgk sin(sjsk) + hjhk sin(tjtk) = 0, then for any j, k ≥ 2, fjk := gjgkei(sjsk) + hjhkei(tjtk) is real. Now hjk=1515λ3+fjk(λ4λ3) for jk, so we have hjk = hkj and H is symmetric. Note that |hjk| = 1, if λ3, λ4 are given, then 1515λ3 and λ4 – λ3 are both given. Using geometry properties, we see that fjk takes only two distinct values. It means for all j, k ≥ 2 and jk, hjk can only take two distinct values. We denote them by a1, a2. For hjj, j ≥ 2, by a similar discussion, we obtain that hjj can take at most two distinct values b1, b2. In particular if hjj can only take one value, then we take b1 = b2.

We consider the orthogonality of rows 1,2, that is, 1+k=26h2k=0. If three of h23, …, h26 are the same, we shall assume 1 + h22 + 3h23 + h26 = 0. Then h22 = h26 = 1 and h23 = – 1, so λ3, λ4 are both real, which means for any j, k ≥ 2, hjk is real, too. So H contains only real elements, i.e. {1, –1}. Such a CHM is known to be non-existent. So two of h23, …, h26 are the same, then 1 + h22 + 2a1 + 2a2 = 0. By simple vector theory we know that the vector a1 + a2 is orthogonal to λ4 – λ3.

Then 1 + h22 must be orthogonal to λ4 – λ3. If b1 = b2 then h22 is orthogonal to λ4 – λ3, so b1 = b2 = 1. If b1b2, we shall assume h22 = b1. Since b1 + b2 is orthogonal to λ4 – λ3, then we have b2 = 1. So in both cases, we have b2 = 1.

Since hjk = hkj, if b1 appears no less than three times in h22, …, h66, then we select three rows that contain b1, and by permuting columns, the three rows should be

[1b1a1a1a2a21a1b1x1x2x31a1x1b1x4x5]

Here {x1, x2, x3} = {x1, x4, x5} = {a1, a2, a2}. If x1 = a1, then the orthogonality of rows 2, j never holds. Then x1 = a2, then x4 = x3, x5 = x2, the inner products of the three rows shows that 2+b1a1¯+a1b1¯+a1a2¯+a2a1¯=0 and 2+b1a2¯+a1b2¯+a1a2¯+a2a1¯=0. Then we know that b12|a2a1|2=(a1a2)2. Then b1 is orthogonal to a1a2. By simple goemetry property we know that b1 – 1 isparallelto a1a2, then b1 = 1 or a1 = a2. The latter case violates the orthogonal of the three rows, then b1 = 1. And by solving 2+a2+a2¯+a1a2¯+a2a1¯=0, we know that {a1, a2} = {ω, ω2} with ω=e2πi3. Other rows contains the same elements, so H is complex equivalent to Tao matrix S6(0). If b2 appears no less than three times, we can also solve that {a1, a2} = {ω, ω2}, and we then deduce that b1 = 1.

Case C.

If 6cosθ1θ22+cosθ1+θ22=0, then tanθ12tanθ22=7+265. Since λ3 ≠ λ4, we denote a=1+λ35(λ4λ3),b=gjgkei(sjsk)+hjhkei(tjtk), then |hjk| = |hkj| = 1 shows that |a+b|=|a+b¯|, where b¯ is the conjugate of b′. Since a′ is a given complex number, the equality shows that either a′ is real or b′ is always real whatever j, k are. The latter case was discussed in Case B, it is just the case that g1g2 sin(s1s2) + h1h2 sin(t1t2) = 0.

Now a′ is real, so there exists a real number k such that a′ = k, then 1515λ3=k(λ4λ3). So

A36
λ4=15k+(115k)λ3.

Compute the real and imaginary part of two sides, we obtain the following system of equations.

A37
{6cosθ2=15k+6(115k)cosθ1;sinθ2=(115k)sinθ1.

We compute

A38
|λ4λ3|=(λ4λ3)(λ4¯λ3¯)=1k5k2.

We claim that the following equality holds:

A39
1+λ3+λ4=λ4λ3λ4¯λ3¯.

From (A36), the equality turns to be

A40
(115k+(215k)λ3)(1+λ¯3)=1+λ3.

Using |λ3|=6, it turns to be

A41
(115k)λ32+(1275k)λ3+6(115k)=0.

From (A36) and |λ4|2=λ4·λ¯4=6 we deduce the same equation as (A41). So we have proven the equality (A39).

Now we denote

A42
d=λ4λ3|λ4λ3|.

So from (A39) we know that

A43
d2=(λ4λ3)2(λ4λ3)(λ¯4λ¯3)=λ3+λ4+1.

We select

A44
|v1=[5k,15k5,15k5,15k5,15k5,15k5]T,
A45
|v2=[15k,k,k,k,k,k]T.

If we denote λ43 = λ4 – λ3, then

A46
λ3|v1v1|+λ4|v2v2|=[A1A2A2A2A2A2A2A3A3A3A3A3A2A3A3A3A3A3A2A3A3A3A3A3A2A3A3A3A3A3A2A3A3A3A3A3]
with A1 – λ4 – 543, A2=k5k2λ43,A3=15λ3+kλ43.

Substituting the expression of λ3, λ4 discussed in (A36), (A38), (A42), (A43), we have

A47
A1=λ45kλ43=(15k)λ43+λ3=1+λ4+λ3=d2,
A48
A2=k5k2λ43=λ4λ3|λ4λ3|=d,
A49
A3=15λ3+kλ43=15λ3+k[15k+(115k)λ3λ3]=15.

And

A50
v1v2=5k(15k)5k(15k)5=0.

So |v1〉, |v2〉 are orthogonal. From (A46), (A47), (A48), (A49) we know that

A51
λ3|v1v1|+λ4|v2v2|=15[5d25d5d5d5d5d5d111115d111115d111115d111115d11111].

For the vector |uj=[g1j,,g6j]T,j=3,4,5,6, we have 〈u1|uj〉 = 〈u2|uj〉 = 0. Then 〈u1u2|uj〉 = 0, from (20) we know that g1j=0 for j = 3,4,5,6. So once we take the matrix P in (19) and set the parameter d to be in (A42), we have P · 〈uj|uj〉 · P = 〈uj|uj〉 for j = 3, 4, 5, 6. And

A52
P·H·P=PH2P+λ3j=34|ujuj|+λ4j=56|ujuj|,
here H2 was defined in (22) and
A53
PH2P=15[5d25d5d5d5d5d5d111115d111115d111115d111115d11111].

Then we find that

A54
λ3|v1v1|+λ4|v2v2|=PH2P.

We shall assume |uk〉 = [0, x1, x2, x3, x4, x5]T for any k = 3,4,5,6, from (20) and the orthogonality of |u1〉 and |uk〉, we know that

A55
x1+x2+x3+x4+x5=0.

From (A44), (A45) we know that 〈vj|uk〉 = 0 for any j = 1,2. So we obtain a orthonormal basis {|v1〉, |v2〉, |u3〉, |u4〉, |u5〉, |u6〉} and from (A52), (A54) we know that

A56
PHP=λ3|v1v1|+λ4|v2v2|+λ3j=34|ujuj|+λ4j=56|ujuj|.

So PHP exactly has eigenvalues λ3, λ3, λ3, λ4, λ4, λ4. Hence given a CHM H in dephased form with eigenvalues 6,6,λ3,λ3,λ4,λ4, excluding the Tao matrix (which has been discussed in Case B) in (3), we will deduce a CHM with two sorts of eigenvalues, the latter one must be complex equivalent to K(d, x) due to Theorem 1. So H must be complex equivalent to P · K(d, x) · P with P in (19). We take K′(d, x) = d · P · K(d, x) · P, now K′(d, x) here is in dephased form. And if we assume the eigenvalues of K′(d, x) are 6,6,λ3,λ3,λ4,λ4, we obtain that {λ3, λ4} = {1, 2} with λ1, λ2 in (10). Hence we deduce the expression of K′(d, x) in (21).

Now if d = ±i, then by the result of Lemma 1 (i), we obtain that {x, y} or {y, z} or {x, z} is equal to {1, –1}. It is easy to verify that in all these cases, K′(d, x) must be complex equivalent to Haagerup matrices in (1).

If d = ±1, then from (10) we know that λ1=6,λ2=6. So {λ3,λ4}={6,6}, then K′(d, x) is complex equivalent to Hermitian matrices in (4). Hence we have finished the proof of Theorem 2.

DOI: https://doi.org/10.2478/qic-2026-0010 | Journal eISSN: 3106-0544 (formerly 1533-7146) | Journal ISSN: 1533-7146
Language: English
Page range: 192 - 209
Submitted on: Jan 14, 2026
Accepted on: Mar 3, 2026
Published on: Jun 4, 2026
Published by: Cerebration Science Publishing Co., Limited
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year

© 2026 Yanzu Huang, Lin Chen, published by Cerebration Science Publishing Co., Limited
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.