Number-Theoretic Characterizations of Some Restricted Clifford

被引:18
作者
Amy, Matthew [1 ]
Glaudell, Andrew N. [2 ,3 ,4 ]
Ross, Neil J. [1 ]
机构
[1] Dalhousie Univ, Dept Math & Stat, Halifax, NS, Canada
[2] Univ Maryland, Inst Adv Comp Studies, College Pk, MD 20742 USA
[3] Univ Maryland, Joint Ctr Quantum Informat & Comp Sci, College Pk, MD 20742 USA
[4] Univ Maryland, Joint Quantum Inst, College Pk, MD 20742 USA
关键词
APPROXIMATION; OPTIMIZATION; UNITARIES; ALGORITHM;
D O I
10.22331/q-2020-04-06-252
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Kliuchnikov, Maslov, and Mosca proved in 2012 that a 2 x 2 unitary matrix V can be exactly represented by a single-qubit Clifford + T circuit if and only if the entries of V belong to the ring Z[1/root 2, i]. Later that year, Giles and Selinger showed that the same restriction applies to matrices that can be exactly represented by a multi-qubit Clifford + T circuit. These number-theoretic characterizations shed new light upon the structure of Clifford + T circuits and led to remarkable developments in the field of quantum compiling. In the present paper, we provide number-theoretic characterizations for certain restricted Clifford + T circuits by considering unitary matrices over subrings of Z[1/root 2, i]. We focus on the subrings Z[1./2], Z[1/root 2], Z[1/i root 2], and Z[1/2, i], and we prove that unitary matrices with entries in these rings correspond to circuits over well-known universal gate sets. In each case, the desired gate set is obtained by extending the set of classical reversible gates {X, CX, CCX} with an analogue of the Hadarnard gate and an optional phase gate.
引用
收藏
页数:23
相关论文
共 39 条
[1]  
Aaronson Scott., 2017, 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), V67, p23:1, DOI DOI 10.4230/LIPICS.ITCS.2017.23
[2]  
Aharonov D, 2003, ARXIVQUANTPH0301040
[3]   A Finite Presentation of CNOT-Dihedral Operators [J].
Amy, Matthew ;
Chen, Jianxin ;
Ross, Neil J. .
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2018, (266) :84-97
[4]   T-Count Optimization and Reed-Muller Codes [J].
Amy, Matthew ;
Mosca, Michele .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (08) :4771-4784
[5]   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
[6]   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
[7]  
Artin M., 2011, Algebra
[8]   ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity [J].
Backens, Miriam ;
Kissinger, Aleks .
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2019, (287) :23-42
[9]   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
[10]  
Bian X., 2019, COMMUNICATION