Unextendible Sets of Mutually Unbiased Basis Obtained from Complete Subgraphs
We propose a method, based on the search and identification of complete subgraphs of a regular graph, to obtain sets of Pauli operators whose eigenstates form unextendible complete sets of mutually unbiased bases of n-qubit systems. With this method we can obtain results for complete and inextensible sets of mubs for 2, 3, 4 and 5 qubits.
Keyword(s):
2010 ◽
Vol 43
(27)
◽
pp. 275305
◽
Keyword(s):
Keyword(s):
Keyword(s):