Quantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits to architecture qubits. To achieve this, we first consider the qubit movement subproblem and use the ROUTING VIA MATCHINGS framework to prove tighter bounds on parallel routing. In practice, we only need to perform partial permutations, so we generalize ROUTING VIA MATCHINGS to that setting. We give new routing procedures for common architecture graphs and for the generalized hierarchical product of graphs, which produces subgraphs of the Cartesian product. Secondly, for serial routing, we consider the TOKEN SWAPPING framework and extend a 4-approximation algorithm for general graphs to support partial permutations. We apply these routing procedures to give several circuit transformations, using various heuristic qubit placement subroutines. We implement these transformations in software and compare their performance for large quantum circuits on grid and modular architectures, identifying strategies that work well in practice.


    Access

    Download


    Export, share and cite



    Title :

    Circuit Transformations for Quantum Architectures


    Contributors:

    Publication date :

    2019-01-01



    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    004 / 629





    Chained quantum arnold transformations

    López-Ruiz, F. F. / Guerrero, J. / Aldaya, V. | British Library Online Contents | 2011



    Circuit protection solutions for 42 V automotive electrical architectures

    Williams,M.E. / Wilhem Pudenz,DE | Automotive engineering | 2000


    DAMPER ARCHITECTURES

    LI DONGXU / BAI SHUSHAN | European Patent Office | 2018

    Free access