Layout Optimization for Quantum Circuits with Linear Nearest Neighbor Architectures

被引:30
|
作者
Pedram, Massoud [1 ]
Shafaei, Alireza [1 ]
机构
[1] Univ So Calif, Dept Elect Engn, Los Angeles, CA 90089 USA
关键词
D O I
10.1109/MCAS.2016.2549950
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper is concerned with the physical design of quantum logic circuits. More precisely, it addresses the problem of minimizing the number of required qubit reorderings (achieved by inserting explicit SWAP gates) when mapping a quantum circuit into a linear nearest neighbor quantum architecture. First, an interaction graph that captures the interaction distances among various qubits in the quantum circuit is constructed. The interaction graph is utilized to partition the quantum circuit into a set of subcircuits such that the number of required qubit reoderings within each subcircuit is provably no more than a given threshold. Next, a Minimum Linear Arrangement problem for each subcircuit is formulated and solved to achieve the minimum number of internal qubit reorderings and determine the subcircuit input and output qubit orderings. Finally, a bubble sort algorithm is repeatedly employed to minimize the number of qubit reorderings that are required between the consecutive subcircuits. Experiments done on various quantum Fourier transform circuits as well as various reversible logic circuits demonstrate the effectiveness of the proposed approach.
引用
收藏
页码:62 / 74
页数:13
相关论文
共 50 条
  • [21] Linear Nearest Neighbor Quantum Circuit Synthesis and Optimization Based on the Matrix
    Lu Y.
    Guan Z.-J.
    Cheng X.-Y.
    Tan Y.-Y.
    Zhang Z.-Y.
    2018, Chinese Institute of Electronics (46): : 688 - 694
  • [22] An efficient method to convert arbitrary quantum circuits to ones on a Linear Nearest Neighbor architecture
    Hirata, Yuichi
    Nakanishi, Masaki
    Yamashita, Shigeru
    Nakashima, Yasuhiko
    ICQNM 2009: THIRD INTERNATIONAL CONFERENCE ON QUANTUM, NANO AND MICRO TECHNOLOGIES: PROCEEDINGS, 2009, : 26 - 33
  • [23] Deep Reinforcement Learning for Mapping Quantum Circuits to 2D Nearest-Neighbor Architectures
    Li, Yangzhi
    Liu, Wen
    Li, Maoduo
    ADVANCED QUANTUM TECHNOLOGIES, 2024, 7 (02)
  • [24] Exact Reordering of Circuit Lines for Nearest Neighbor Quantum Architectures
    Wille, Robert
    Lye, Aaron
    Drechsler, Rolf
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2014, 33 (12) : 1818 - 1831
  • [25] Quantum Circuit Optimization by Changing the Gate Order for 2D Nearest Neighbor Architectures
    Hattori, Wakaki
    Yamashita, Shigeru
    REVERSIBLE COMPUTATION, RC 2018, 2018, 11106 : 228 - 243
  • [26] Linear Nearest Neighbor Realization of Quantum Circuits Using Clustering and Look-ahead Policy
    Bhattacharjee, Anirban
    Bandyopadhyay, Chandan
    Mondal, Bappaditya
    Rahaman, Hafizur
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2020, 29 (16)
  • [27] Line ordering of reversible circuits for linear nearest neighbor realization
    Mohammad AlFailakawi
    Laila AlTerkawi
    Imtiaz Ahmad
    Suha Hamdan
    Quantum Information Processing, 2013, 12 : 3319 - 3339
  • [28] Line ordering of reversible circuits for linear nearest neighbor realization
    AlFailakawi, Mohammad
    AlTerkawi, Laila
    Ahmad, Imtiaz
    Hamdan, Suha
    QUANTUM INFORMATION PROCESSING, 2013, 12 (10) : 3319 - 3339
  • [29] Optimal SWAP Gate Insertion for Nearest Neighbor Quantum Circuits
    Wille, Robert
    Lye, Aaron
    Drechsler, Rolf
    2014 19TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE (ASP-DAC), 2014, : 489 - 494
  • [30] Exact Global Reordering for Nearest Neighbor Quantum Circuits Using A
    Zulehner, Alwin
    Gasser, Stefan
    Wille, Robert
    REVERSIBLE COMPUTATION, RC 2017, 2017, 10301 : 185 - 201