Complexity of reversible circuits and their quantum implementations

被引:10
|
作者
Abdessaied, Nabila [1 ,2 ]
Amy, Matthew [3 ]
Drechsler, Rolf [1 ,2 ]
Soeken, Mathias [1 ,2 ]
机构
[1] Univ Bremen, Fac Math & Comp Sci, D-28359 Bremen, Germany
[2] DFKI GmbH, Cyber Phys Syst, Bremen, Germany
[3] Univ Toronto, Dept Comp Sci, Toronto, ON, Canada
关键词
Complexity analysis; Reversible functions; Reversible circuits; Quantum circuits; Upper bounds; Synthesis; Technology mapping; ALGORITHM; OPTIMIZATION; COST;
D O I
10.1016/j.tcs.2016.01.011
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We provide an extensive overview of upper bounds on the number of gates needed in reversible and quantum circuits. As reversible gate libraries we consider single-target gates, mixed-polarity multiple-controlled Toffoli gates, and the set consisting of the NOT, the CNOT, and the two-controlled Toffoli gate. As quantum gate libraries we consider the semi-classical NCV library (consisting of NOT, CNOT, and the square-root of NOT called V) as well as the universal and commonly used Clifford + T gate library. Besides a summary of known bounds, the paper provides several new and tighter bounds. Several synthesis approaches and mapping schemes were used to calculate the bounds. (C) 2016 Published by Elsevier B.V.
引用
收藏
页码:85 / 106
页数:22
相关论文
共 50 条
  • [31] On asymptotic gate complexity and depth of reversible circuits without additional memory
    Zakablukov, Dmitry V.
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 84 : 132 - 143
  • [32] Commuting quantum circuits and complexity of Ising partition functions
    Fujii, Keisuke
    Morimae, Tomoyuki
    NEW JOURNAL OF PHYSICS, 2017, 19
  • [33] Quantum complexity phase transitions in monitored random circuits
    Suzuki, Ryotaro
    Haferkamp, Jonas
    Eisert, Jens
    Faist, Philippe
    QUANTUM, 2025, 9
  • [34] Transitions in entanglement complexity in random quantum circuits by measurements
    Oliviero, Salvatore F. E.
    Leone, Lorenzo
    Hamma, Alioscia
    PHYSICS LETTERS A, 2021, 418
  • [35] Transitions in entanglement complexity in random quantum circuits by measurements
    Oliviero, Salvatore F.E.
    Leone, Lorenzo
    Hamma, Alioscia
    Physics Letters, Section A: General, Atomic and Solid State Physics, 2021, 418
  • [36] Complexity of Quantum Circuits via Sensitivity, Magic, and Coherence
    Bu, Kaifeng
    Garcia, Roy J.
    Jaffe, Arthur
    Koh, Dax Enshan
    Li, Lu
    COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2024, 405 (07)
  • [37] Recent Developments on Mapping Reversible Circuits to Quantum Gate Libraries
    Miller, D. Michael
    Sasanian, Zahra
    2012 INTERNATIONAL SYMPOSIUM ON ELECTRONIC SYSTEM DESIGN (ISED 2012), 2012, : 17 - 22
  • [38] REDUCING QUANTUM COST OF REVERSIBLE CIRCUITS FOR HOMOGENEOUS BOOLEAN FUNCTIONS
    Younes, Ahmed
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2010, 19 (07) : 1423 - 1434
  • [39] Online error detection method for quantum reversible logic circuits
    Feng, Ran
    Wang, Youren
    Chen, Yan
    Zhang, Zhai
    Yi Qi Yi Biao Xue Bao/Chinese Journal of Scientific Instrument, 2010, 31 (11): : 2534 - 2541
  • [40] Reversible circuits with testability using quantum controlled NOT and swap gates
    Gaur, Hari Mohan
    Singh, Ashutosh Kumar
    Ghanekar, Umesh
    INDIAN JOURNAL OF PURE & APPLIED PHYSICS, 2018, 56 (07) : 529 - 532