Niel de Beaudrap (Department of Computer Science, University of Oxford ) |
Xiaoning Bian (Department of Mathematics and Statistics, Dalhousie University) |
Quanlong Wang (Department of Computer Science, University of Oxford; Cambridge Quantum Computing Ltd.) |

To approximate arbitrary unitary transformations on one or more qubits, one must perform transformations which are outside of the Clifford group. The gate most commonly considered for this purpose is the T = diag(1, exp(i π/4)) gate. As T gates are computationally expensive to perform fault-tolerantly in the most promising error-correction technologies, minimising the "T-count" (the number of T gates) required to realise a given unitary in a Clifford+T circuit is of great interest. We describe techniques to find circuits with reduced T-count in unitary circuits, which develop on the ideas of Heyfron and Campbell [arXiv:1712.01557] with the help of the ZX calculus. Following [arXiv:1712.01557], we reduce the problem to that of minimising the T count of a CNOT+T circuit. The ZX calculus motivates a further reduction to simplifying a product of commuting "π/4-parity-phase" operations: diagonal unitary transformations which induce a relative phase of exp(i π/4) depending on the outcome of a parity computation on the standard basis (which motivated Kissinger and van de Wetering [1903.10477] to introduce "phase gadgets"). For a number of standard benchmark circuits, we show that these techniques — in some cases supplemented by the TODD subroutine of Heyfron and Campbell [arXiv:1712.01557] — yield T-counts comparable to or better than the best previously known results. |

Published: 1st May 2020.

ArXived at: https://dx.doi.org/10.4204/EPTCS.318.9 | bibtex | |

Comments and questions to: eptcs@eptcs.org |

For website issues: webmaster@eptcs.org |