Charnes, C. and Beth, T. 2005, Groups, graphs and mutually unbiased bases, in EQIS 2005 : Proceedings of the Erato Conference on Quantum Information Science, Erato Conference on Quantum Information Science, [Tokyo, Japan], pp. 73-74.
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
A new characteristic free approach to constructing large sets of mutually unbiased bases in Hilbert space is developed. We associate with a seed set of bases a finite subgroup of which defines a strongly regular graph. Large sets of mutually unbiased bases are obtained as the cliques of the graph.