Unextendible Sets of Mutually Unbiased Basis Obtained from Complete Subgraphs

Andrés García and Pablo Carlos López
Additional contact information
Andrés García: Departamento de Matemáticas, Universidad de Guadalajara, Revolución 1500, Guadalajara 44420, Jalisco, Mexico
Pablo Carlos López: Departamento de Ciencias Naturales y Exactas, Universidad de Guadalajara, Carretera Guadalajara-Ameca Km 45.5, Ameca 46600, Jalisco, Mexico

Mathematics, 2021, vol. 9, issue 12, 1-11

Abstract: 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.

Keywords: mutually unbiased bases; complete subgraphs; Pauli group (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/12/1388/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/12/1388/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2021:i:12:p:1388-:d:575238

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().