Technology Mapping of Reversible Circuits to Clifford plus T Quantum Circuits

被引:35
作者
Abdessaied, Nabila [1 ]
Amy, Matthew [2 ]
Soeken, Mathias [1 ,4 ]
Drechsler, Rolf [1 ,3 ]
机构
[1] DFKI GmbH, Cyber Phys Syst, Bremen, Germany
[2] Univ Toronto, Dept Comp Sci, Toronto, ON M5S 1A1, Canada
[3] Univ Bremen, Inst Comp Sci, D-28359 Bremen, Germany
[4] Ecole Polytech Fed Lausanne, Integrated Syst Lab, Lausanne, Switzerland
来源
2016 IEEE 46TH INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC (ISMVL 2016) | 2016年
关键词
OPTIMIZATION;
D O I
10.1109/ISMVL.2016.33
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The Clifford+T quantum gate library has attracted much interest in the design of quantum circuits, particularly since the contained operations can be implemented in a fault-tolerant manner. Since fault tolerant implementations of the T gate have very high latency, synthesis and optimization are aiming at minimizing the number of T stages, referred to as the T-depth. In this paper, we present an approach to map mixed polarity multiple controlled Toffoli gates into Clifford+T quantum circuits. Our approach is based on the multiple control Toffoli mapping algorithms proposed by Barenco et al., which are given T-depth optimized Clifford+T translations. Experiments show that our approach leads to a significant T-depth reduction of 54% on average.
引用
收藏
页码:150 / 155
页数:6
相关论文
共 17 条
[1]  
Abdessaied N, 2014, LECT NOTES COMPUT SC, V8507, P149, DOI 10.1007/978-3-319-08494-7_12
[2]   Polynomial-Time T-Depth Optimization of Clifford plus T Circuits Via Matroid Partitioning [J].
Amy, Matthew ;
Maslov, Dmitri ;
Mosca, Michele .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2014, 33 (10) :1476-1489
[3]   A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits [J].
Amy, Matthew ;
Maslov, Dmitri ;
Mosca, Michele ;
Roetteler, Martin .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2013, 32 (06) :818-830
[4]  
[Anonymous], J MULTIPLE VALUED LO
[5]  
[Anonymous], PHYS REV A
[6]   ELEMENTARY GATES FOR QUANTUM COMPUTATION [J].
BARENCO, A ;
BENNETT, CH ;
CLEVE, R ;
DIVINCENZO, DP ;
MARGOLUS, N ;
SHOR, P ;
SLEATOR, T ;
SMOLIN, JA ;
WEINFURTER, H .
PHYSICAL REVIEW A, 1995, 52 (05) :3457-3467
[7]  
Chuang I. N., 2000, Quantum Computation and Quantum Information
[8]   RAPID SOLUTION OF PROBLEMS BY QUANTUM COMPUTATION [J].
DEUTSCH, D ;
JOZSA, R .
PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1992, 439 (1907) :553-558
[9]   Improved quantum cost for n-bit Toffoli gates [J].
Maslov, D ;
Dueck, GW .
ELECTRONICS LETTERS, 2003, 39 (25) :1790-1791
[10]  
Maslov Dmitri, Reversible Logic Synthesis Benchmarks page