Cyclic mutually unbiased bases, Fibonacci polynomials and Wiedemann's conjecture
From MaRDI portal
Publication:2865462
Abstract: We relate the construction of a complete set of cyclic mutually unbiased bases, i. e., mutually unbiased bases generated by a single unitary operator, in power-of-two dimensions to the problem of finding a symmetric matrix over F_2 with an irreducible characteristic polynomial that has a given Fibonacci index. For dimensions of the form 2^(2^k) we present a solution that shows an analogy to an open conjecture of Wiedemann in finite field theory. Finally, we discuss the equivalence of mutually unbiased bases.
Recommendations
- Approximately mutually unbiased bases by Frobenius rings
- Complete sets of cyclic mutually unbiased bases in even prime-power dimensions
- Mutually Unbiased Bases and the Complementarity Polytope
- Structure of the sets of mutually unbiased bases with cyclic symmetry
- Circulant matrices, Gauss sums and mutually unbiased bases. I: The prime number case
- Multiplicative functions arising from the study of mutually unbiased bases
- About mutually unbiased bases in even and odd prime power dimensions
- Constructions on approximately mutually unbiased bases by Galois rings
- Several new constructions of mutually unbiased bases derived from functions over finite fields
- The mutually unbiased bases revisited
Cites work
- A new proof for the existence of mutually unbiased bases
- Characterizing switch-setting problems∗
- Complete sets of cyclic mutually unbiased bases in even prime-power dimensions
- Elements of high order on finite fields from elliptic curves
- Equiangular lines, mutually unbiased bases, and spin models
- Fibonacci polynomials and parity domination in grid graphs
- MUBs inequivalence and affine planes
- On the construction of irreducible self-reciprocal polynomials over finite fields
- Similarity to symmetric matrices over finite fields
- Unconditionally Secure Key Distribution in Higher Dimensions by Depolarization
- Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
- \(\sigma\)-Automata and Chebyshev-polynomials
Cited in
(3)
This page was built for publication: Cyclic mutually unbiased bases, Fibonacci polynomials and Wiedemann's conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865462)