Unextendible Sets of Mutually Unbiased Basis Obtained from Complete Subgraphs

Mathematics

Pablo Carlos López¹  Andrés García² 

[1] Departamento de Ciencias Naturales y Exactas, Universidad de Guadalajara, Carretera Guadalajara-Ameca Km 45.5, Ameca 46600, Jalisco, Mexico;Departamento de Matemáticas, Universidad de Guadalajara, Revolución 1500, Guadalajara 44420, Jalisco, Mexico;

关键词: mutually unbiased bases;    complete subgraphs;    Pauli group;   

DOI  :  10.3390/math9121388

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown