Number-Theoretic Characterizations of Some Restricted Clifford+T Circuits

Author:

Amy Matthew1ORCID,Glaudell Andrew N.23,Ross Neil J.1ORCID

Affiliation:

1. Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, Canada

2. Institute for Advanced Computer Studies and Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, MD, USA

3. Joint Quantum Institute, University of Maryland, College Park, MD, USA

Abstract

Kliuchnikov, Maslov, and Mosca proved in 2012 that a 2×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/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/2,i]. We focus on the subrings Z[1/2], Z[1/2], Z[1/i2], 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 Hadamard gate and an optional phase gate.

Publisher

Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften

Subject

Physics and Astronomy (miscellaneous),Atomic and Molecular Physics, and Optics

Cited by 20 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A Sound and Complete Equational Theory for 3-Qubit Toffoli-Hadamard Circuits;Electronic Proceedings in Theoretical Computer Science;2024-08-12

2. Exact Synthesis of Multiqutrit Clifford-Cyclotomic Circuits;Electronic Proceedings in Theoretical Computer Science;2024-08-12

3. CS-count-optimal quantum circuits for arbitrary multi-qubit unitaries;Scientific Reports;2024-06-17

4. Synthesis of V-count-optimal quantum circuits for multiqubit unitaries;Physical Review A;2024-05-14

5. With a Few Square Roots, Quantum Computing Is as Easy as Pi;Proceedings of the ACM on Programming Languages;2024-01-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3