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.

Highlights

  • Kliuchnikov, Maslov, and Mosca showed in [26] that a 2-dimensional unitary matrix V can be e√xactly represented by a single-qubit Clifford+T circuit if and only if the entries of V belong to the ring Z[1/ 2, i]

  • Our goal is to address both of these limitations by considering restrictions of the Clifford+T gate set which are universal for quantum com√puting

  • We provided number-theoretic characterizations for several classes of restricted but universal Clifford+T circuits, focusing on integral, real, imaginary, and Gaussian circuits

Read more

Summary

Introduction

Kliuchnikov, Maslov, and Mosca showed in [26] that a 2-dimensional unitary matrix V can be e√xactly represented by a single-qubit Clifford+T circuit if and only if the entries of V belong to the ring Z[1/ 2, i]. This result gives a number-theoretic characterization of single-qubit Clifford+T circuits. Our goal is to address both of these limitations by considering restrictions of the Clifford+T gate set which are universal for quantum com√puting To this end, we study√circuits c√orresponding to unitary matrices over proper subrings of Z[1/ 2, i], focusing on Z[1/2], Z[1/ 2], Z[1/i 2], and Z[1/2, i].

Overview
Rings and Matrices
Matrices
Circuits
The D case
5.11. V is a
Conclusion
A Ancilla-Free Circuit Constructions
ZXF X ZXF X
F2 X F6
ZXF X ZXF
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.