Generating three-qubit quantum circuits with neural networks

Michael Swaddle, Lyle Noakes, Harry Smallbone, Liam Salter, Jingbo Wang

    Research output: Contribution to journalArticle

    Abstract

    A new method for compiling quantum algorithms is proposed and tested for a three qubit system. The proposed method is to decompose a unitary matrix U, into a product of simpler Uj via a neural network. These Uj can then be decomposed into product of known quantum gates. Key to the effectiveness of this approach is the restriction of the set of training data generated to paths which approximate minimal normal subRiemannian geodesics, as this removes unnecessary redundancy and ensures the products are unique. The two neural networks are shown to work effectively, each individually returning low loss values on validation data after relatively short training periods. The two networks are able to return coefficients that are sufficiently close to the true coefficient values to validate this method as an approach for generating quantum circuits. There is scope for more work in scaling this approach for larger quantum systems.

    LanguageEnglish
    Pages3391-3395
    Number of pages5
    JournalPhysics Letters, Section A: General, Atomic and Solid State Physics
    Volume381
    Issue number39
    DOIs
    StatePublished - 17 Oct 2017

    Fingerprint

    education
    products
    redundancy
    coefficients
    constrictions
    scaling

    Cite this

    @article{01349f3f7ca24627bf5f2f808e157ab8,
    title = "Generating three-qubit quantum circuits with neural networks",
    abstract = "A new method for compiling quantum algorithms is proposed and tested for a three qubit system. The proposed method is to decompose a unitary matrix U, into a product of simpler Uj via a neural network. These Uj can then be decomposed into product of known quantum gates. Key to the effectiveness of this approach is the restriction of the set of training data generated to paths which approximate minimal normal subRiemannian geodesics, as this removes unnecessary redundancy and ensures the products are unique. The two neural networks are shown to work effectively, each individually returning low loss values on validation data after relatively short training periods. The two networks are able to return coefficients that are sufficiently close to the true coefficient values to validate this method as an approach for generating quantum circuits. There is scope for more work in scaling this approach for larger quantum systems.",
    keywords = "Neural networks, Quantum compiling, Quantum computation, subRiemannian geometry",
    author = "Michael Swaddle and Lyle Noakes and Harry Smallbone and Liam Salter and Jingbo Wang",
    year = "2017",
    month = "10",
    day = "17",
    doi = "10.1016/j.physleta.2017.08.043",
    language = "English",
    volume = "381",
    pages = "3391--3395",
    journal = "Physics Letters, Section A: General, Atomic and Solid State Physics",
    issn = "0375-9601",
    publisher = "Elsevier",
    number = "39",

    }

    Generating three-qubit quantum circuits with neural networks. / Swaddle, Michael; Noakes, Lyle; Smallbone, Harry; Salter, Liam; Wang, Jingbo.

    In: Physics Letters, Section A: General, Atomic and Solid State Physics, Vol. 381, No. 39, 17.10.2017, p. 3391-3395.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Generating three-qubit quantum circuits with neural networks

    AU - Swaddle,Michael

    AU - Noakes,Lyle

    AU - Smallbone,Harry

    AU - Salter,Liam

    AU - Wang,Jingbo

    PY - 2017/10/17

    Y1 - 2017/10/17

    N2 - A new method for compiling quantum algorithms is proposed and tested for a three qubit system. The proposed method is to decompose a unitary matrix U, into a product of simpler Uj via a neural network. These Uj can then be decomposed into product of known quantum gates. Key to the effectiveness of this approach is the restriction of the set of training data generated to paths which approximate minimal normal subRiemannian geodesics, as this removes unnecessary redundancy and ensures the products are unique. The two neural networks are shown to work effectively, each individually returning low loss values on validation data after relatively short training periods. The two networks are able to return coefficients that are sufficiently close to the true coefficient values to validate this method as an approach for generating quantum circuits. There is scope for more work in scaling this approach for larger quantum systems.

    AB - A new method for compiling quantum algorithms is proposed and tested for a three qubit system. The proposed method is to decompose a unitary matrix U, into a product of simpler Uj via a neural network. These Uj can then be decomposed into product of known quantum gates. Key to the effectiveness of this approach is the restriction of the set of training data generated to paths which approximate minimal normal subRiemannian geodesics, as this removes unnecessary redundancy and ensures the products are unique. The two neural networks are shown to work effectively, each individually returning low loss values on validation data after relatively short training periods. The two networks are able to return coefficients that are sufficiently close to the true coefficient values to validate this method as an approach for generating quantum circuits. There is scope for more work in scaling this approach for larger quantum systems.

    KW - Neural networks

    KW - Quantum compiling

    KW - Quantum computation

    KW - subRiemannian geometry

    UR - http://www.scopus.com/inward/record.url?scp=85028655784&partnerID=8YFLogxK

    U2 - 10.1016/j.physleta.2017.08.043

    DO - 10.1016/j.physleta.2017.08.043

    M3 - Article

    VL - 381

    SP - 3391

    EP - 3395

    JO - Physics Letters, Section A: General, Atomic and Solid State Physics

    T2 - Physics Letters, Section A: General, Atomic and Solid State Physics

    JF - Physics Letters, Section A: General, Atomic and Solid State Physics

    SN - 0375-9601

    IS - 39

    ER -