On the equivalence between real mutually unbiased bases and a certain class of association schemes

DOI10.1016/j.ejc.2009.11.014zbMath1195.81026OpenAlexW2142915235MaRDI QIDQ992778

William Owens, Nicholas LeCompte, William J. Martin

Publication date: 10 September 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.11.014

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (20)

Unit gain graphs with two distinct eigenvalues and systems of lines in complex space ⋮ Balancedly splittable Hadamard matrices ⋮ Unbiased orthogonal designs ⋮ Mutually Unbiased Biangular Vectors and Association Schemes ⋮ Unbiased complex Hadamard matrices and bases ⋮ Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: A coding-theoretic approach ⋮ Linking systems in nonelementary abelian groups ⋮ Maximal orthoplectic fusion frames from mutually unbiased bases and block designs ⋮ Coherent configurations and triply regular association schemes obtained from spherical designs ⋮ Characterizations of regularity for certain \(Q\)-polynomial association schemes ⋮ New pseudo-planar binomials in characteristic two and related schemes ⋮ Almost Hadamard Matrices: General Theory and Examples ⋮ Linked systems of symmetric group divisible designs ⋮ Complex Spherical Designs and Codes ⋮ A two-fold cover of strongly regular graphs with spreads and association schemes of class five ⋮ Mutually unbiased bush-type Hadamard matrices and association schemes ⋮ Commutative association schemes ⋮ Linked systems of symmetric group divisible designs of type. II ⋮ On the ideal of the shortest vectors in the Leech lattice and other lattices ⋮ Symplectic spreads, planar functions, and mutually unbiased bases

Cites Work

• The limitations of nice mutually unbiased bases
• Imprimitive cometric association schemes: constructions and analysis
• Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
• Spherical codes and designs
• Problems in algebraic combinatorics
• Imprimitive Q-polynomial association schemes
• Association schemes with multiple Q-polynomial structures
• Equiangular lines, mutually unbiased bases, and spin models
• Z₄ -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
• On antipodal spherical t-designs of degree s with $t\geq 2s-3$
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the equivalence between real mutually unbiased bases and a certain class of association schemes