A characterization of complex Hadamard matrices appearing in families of MUB triplets

Abstract It is shown that a normalized complex Hadamard matrix of order 6 having three distinct columns each containing at least one $$-1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> entry, necessarily belongs to the transposed Fourier family, or to the family of 2-circulant complex Hadamard matrices. The proofs rely on solving polynomial systems of equations by Gröbner basis techniques, and make use of a structure theorem concerning regular Hadamard matrices. As a consequence, members of these two families can be easily recognized in practice. In particular, one can identify complex Hadamard matrices appearing in known triplets of pairwise mutually unbiased bases in dimension 6.

Authors

Institutions

Publication Details

Journal
Designs Codes and Cryptography
Published
2024-10-03
DOI
https://doi.org/10.1007/s10623-024-01503-w
Citations
1
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.21

Funders

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

A characterization of complex Hadamard matrices appearing in families of MUB triplets

Ferenc Szöllősi, Ákos K. Matszangosz
1 citations
Designs Codes and Cryptography
graph theory and CDMA systems
0.21
article

A characterization of complex Hadamard matrices appearing in families of MUB triplets

Ferenc Szöllősi, Ákos K. Matszangosz
article en
1 citations

Abstract

Abstract It is shown that a normalized complex Hadamard matrix of order 6 having three distinct columns each containing at least one $$-1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> entry, necessarily belongs to the transposed Fourier family, or to the family of 2-circulant complex Hadamard matrices. The proofs rely on solving polynomial systems of equations by Gröbner basis techniques, and make use of a structure theorem concerning regular Hadamard matrices. As a consequence, members of these two families can be easily recognized in practice. In particular, one can identify complex Hadamard matrices appearing in known triplets of pairwise mutually unbiased bases in dimension 6.

Designs Codes and CryptographyVol. 92(12)
HUN-REN Alfréd Rényi Institute of Mathematics (HU), Shimane University (JP)
Shimane University, Japan Society for the Promotion of Science, National Research, Development and Innovation Office
Openalex Percentile: Top 48%
graph theory and CDMA systems
0.21
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.