IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i12p1388-d575238.html
   My bibliography  Save this article

Unextendible Sets of Mutually Unbiased Basis Obtained from Complete Subgraphs

Author

Listed:
  • Andrés García

    (Departamento de Matemáticas, Universidad de Guadalajara, Revolución 1500, Guadalajara 44420, Jalisco, Mexico
    These authors contributed equally to this work.)

  • Pablo Carlos López

    (Departamento de Ciencias Naturales y Exactas, Universidad de Guadalajara, Carretera Guadalajara-Ameca Km 45.5, Ameca 46600, Jalisco, Mexico
    These authors contributed equally to this work.)

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.

Suggested Citation

  • Andrés García & Pablo Carlos López, 2021. "Unextendible Sets of Mutually Unbiased Basis Obtained from Complete Subgraphs," Mathematics, MDPI, vol. 9(12), pages 1-11, June.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:12:p:1388-:d:575238
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/12/1388/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/12/1388/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:12:p:1388-:d:575238. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.