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 inextensibl...

Full description

Saved in:
Bibliographic Details
Published in:Mathematics (Basel) 2021-06, Vol.9 (12), p.1388
Main Authors: García, Andrés, López, Pablo Carlos
Format: Article
Language:English
Subjects:
complete subgraphs
Decomposition
Eigenvectors
Graph theory
Mathematics
mutually unbiased bases
Pauli group
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2227-7390
2227-7390
DOI:10.3390/math9121388