The search functionality is under construction.
The search functionality is under construction.

Author Search Result

[Author] Wakaki HATTORI(2hit)

1-2hit
  • An Efficient Method to Decompose and Map MPMCT Gates That Accounts for Qubit Placement

    Atsushi MATSUO  Wakaki HATTORI  Shigeru YAMASHITA  

     
    PAPER-Algorithms and Data Structures

      Pubricized:
    2022/08/10
      Vol:
    E106-A No:2
      Page(s):
    124-132

    Mixed-Polarity Multiple-Control Toffoli (MPMCT) gates are generally used to implement large control logic functions for quantum computation. A logic circuit consisting of MPMCT gates needs to be mapped to a quantum computing device that invariably has a physical limitation, which means we need to (1) decompose the MPMCT gates into one- or two-qubit gates, and then (2) insert SWAP gates so that all the gates can be performed on Nearest Neighbor Architectures (NNAs). Up to date, the above two processes have only been studied independently. In this work, we investigate that the total number of gates in a circuit can be decreased if the above two processes are considered simultaneously as a single step. We developed a method that inserts SWAP gates while decomposing MPMCT gates unlike most of the existing methods. Also, we consider the effect on the latter part of a circuit carefully by considering the qubit placement when decomposing an MPMCT gate. Experimental results demonstrate the effectiveness of our method.

  • Mapping a Quantum Circuit to 2D Nearest Neighbor Architecture by Changing the Gate Order Open Access

    Wakaki HATTORI  Shigeru YAMASHITA  

     
    PAPER-Fundamentals of Information Systems

      Pubricized:
    2019/07/25
      Vol:
    E102-D No:11
      Page(s):
    2127-2134

    This paper proposes a new approach to optimize the number of necessary SWAP gates when we perform a quantum circuit on a two-dimensional (2D) NNA. Our new idea is to change the order of quantum gates (if possible) so that each sub-circuit has only gates performing on adjacent qubits. For each sub-circuit, we utilize a SAT solver to find the best qubit placement such that the sub-circuit has only gates on adjacent qubits. Each sub-circuit may have a different qubit placement such that we do not need SWAP gates for the sub-circuit. Thus, we insert SWAP gates between two sub-circuits to change the qubit placement which is desirable for the following sub-circuit. To reduce the number of such SWAP gates between two sub-circuits, we utilize A* algorithm.