License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TQC.2020.11
URN: urn:nbn:de:0030-drops-120705
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12070/
Go to the corresponding LIPIcs Volume Portal

de Beaudrap, Niel ; Bian, Xiaoning ; Wang, Quanlong

Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities

pdf-format:
LIPIcs-TQC-2020-11.pdf (0.7 MB)

Abstract

In fault-tolerant quantum computing systems, realising (approximately) universal quantum computation is usually described in terms of realising Clifford+T operations, which is to say a circuit of CNOT, Hadamard, and π/2-phase rotations, together with T operations (π/4-phase rotations). For many error correcting codes, fault-tolerant realisations of Clifford operations are significantly less resource-intensive than those of T gates, which motivates finding ways to realise the same transformation involving T-count (the number of T gates involved) which is as low as possible. Investigations into this problem [Matthew Amy et al., 2013; Gosset et al., 2014; Matthew Amy et al., 2014; Matthew Amy et al., 2018; Earl T. Campbell and Mark Howard, 2017; Matthew Amy and Michele Mosca, 2019] has led to observations that this problem is closely related to NP-hard tensor decomposition problems [Luke E. Heyfron and Earl T. Campbell, 2018] and is tantamount to the difficult problem of decoding exponentially long Reed-Muller codes [Matthew Amy and Michele Mosca, 2019]. This problem then presents itself as one for which must be content in practise with approximate optimisation, in which one develops an array of tactics to be deployed through some pragmatic strategy. In this vein, we describe techniques to reduce the T-count, based on the effective application of "spider nest identities": easily recognised products of parity-phase operations which are equivalent to the identity operation. We demonstrate the effectiveness of such techniques by obtaining improvements in the T-counts of a number of circuits, in run-times which are typically less than the time required to make a fresh cup of coffee.

BibTeX - Entry

@InProceedings{debeaudrap_et_al:LIPIcs:2020:12070,
  author =	{Niel de Beaudrap and Xiaoning Bian and Quanlong Wang},
  title =	{{Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities}},
  booktitle =	{15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
  pages =	{11:1--11:23},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-146-7},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{158},
  editor =	{Steven T. Flammia},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12070},
  URN =		{urn:nbn:de:0030-drops-120705},
  doi =		{10.4230/LIPIcs.TQC.2020.11},
  annote =	{Keywords: T-count, Parity-phase operations, Phase gadgets, Clifford hierarchy, ZX calculus}
}

Keywords: T-count, Parity-phase operations, Phase gadgets, Clifford hierarchy, ZX calculus
Collection: 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)
Issue Date: 2020
Date of publication: 08.06.2020
Supplementary Material: The software which produced our results may be found on GitHub, at https://github.com/njross/optimizer, commit 46b8ce0873ff09bf54cf704080b7daa252c48eba.

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI