Groups, graphs and mutually unbiased bases
| Contribuinte(s) |
Imai, H. Yamamoto, Y. Jozsa, R. Hayashi, M. |
|---|---|
| Data(s) |
01/01/2005
|
| Resumo |
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.<br /> |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Erato Conference on Quantum Information Science |
| Relação |
http://dro.deakin.edu.au/eserv/DU:30005863/charnes-groupsgraphs-2005.pdf |
| Direitos |
2005, Erato Conference on Quantum Information Science |
| Palavras-Chave | #mutually unbiased bases #finite complex unitary groups #strongly regular graphs #clique bounds |
| Tipo |
Conference Paper |
