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

DOI10.1016/J.EJC.2009.11.014MaRDI QIDQ992778zbMATH OpenOpenAlexFDO

Authors Nicholas LeCompte, William J. Martin, William Owens

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)

Recommendations

• On approximate real mutually unbiased bases in square dimension
• Finite Fields and Applications
• A Fourier analytic approach to the problem of mutually unbiased bases
• A new construction of mutually unbiased maximally entangled bases in \(\mathbb{C}^q\otimes \mathbb{C}^q\)
• Mutually orthogonal Latin squares from the inner products of vectors in mutually unbiased bases

Cites work

• Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
• Association schemes with multiple Q-polynomial structures
• Equiangular lines, mutually unbiased bases, and spin models
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3733933 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3503264 (Why is no real title available?)
• scientific article; zbMATH DE number 3407684 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Imprimitive cometric association schemes: constructions and analysis
• Imprimitive Q-polynomial association schemes
• New construction of mutually unbiased bases in square dimensions
• On antipodal spherical t-designs of degree s with t 2s-3
• Problems in algebraic combinatorics
• Spherical codes and designs
• The CRC handbook of combinatorial designs
• The limitations of nice mutually unbiased bases
• Z₄ -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets

Cited in

(24)

• Commutative association schemes
• Balancedly splittable Hadamard matrices
• Unbiased orthogonal designs
• Linked systems of symmetric group divisible designs
• Coherent configurations and triply regular association schemes obtained from spherical designs
• On approximate real mutually unbiased bases in square dimension
• Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
• 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
• Linking systems in nonelementary abelian groups
• Mutually unbiased bush-type Hadamard matrices and association schemes
• Resolvable block designs in construction of approximate real MUBs that are sparse
• Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: a coding-theoretic approach
• Mutually Unbiased Biangular Vectors and Association Schemes
• Maximal orthoplectic fusion frames from mutually unbiased bases and block designs
• Characterizations of regularity for certain \(Q\)-polynomial association schemes
• Almost Hadamard Matrices: General Theory and Examples
• New pseudo-planar binomials in characteristic two and related schemes
• Mutually unbiased unitary bases of operators on d-dimensional Hilbert space
• Complex spherical designs and codes
• A two-fold cover of strongly regular graphs with spreads and association schemes of class five
• Unbiased complex Hadamard matrices and bases
• Almost perfect mutually unbiased bases that are sparse

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992778)