Cyclic mutually unbiased bases, Fibonacci polynomials and Wiedemann's conjecture
From MaRDI portal
Publication:2865462
DOI10.1063/1.4723825zbMath1276.81028arXiv1104.0202WikidataQ123363045 ScholiaQ123363045MaRDI QIDQ2865462
Ulrich Seyfarth, Kedar S. Ranade
Publication date: 29 November 2013
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.0202
11T06: Polynomials over finite fields
12E20: Finite fields (field-theoretic aspects)
11B39: Fibonacci and Lucas numbers and polynomials and generalizations
81P45: Quantum information, communication, networks (quantum-theoretic aspects)
Related Items
Cites Work
- Similarity to symmetric matrices over finite fields
- Fibonacci polynomials and parity domination in grid graphs
- A new proof for the existence of mutually unbiased bases
- \(\sigma\)-Automata and Chebyshev-polynomials
- On the construction of irreducible self-reciprocal polynomials over finite fields
- Equiangular lines, mutually unbiased bases, and spin models
- MUBs inequivalence and affine planes
- Unconditionally Secure Key Distribution in Higher Dimensions by Depolarization
- ELEMENTS OF HIGH ORDER ON FINITE FIELDS FROM ELLIPTIC CURVES
- Complete sets of cyclic mutually unbiased bases in even prime-power dimensions
- Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
- Characterizing switch-setting problems∗