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.
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.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact email@example.com.