Journal article

Cost-optimal single-qubit gate synthesis in the Clifford hierarchy

Gary J Mooney, Charles D Hill, Lloyd CL Hollenbere

QUANTUM | VEREIN FORDERUNG OPEN ACCESS PUBLIZIERENS QUANTENWISSENSCHAF | Published : 2021

Abstract

For universal quantum computation, a major challenge to overcome for practical implementation is the large amount of resources required for fault-tolerant quantum information processing. An important aspect is implementing arbitrary unitary operators built from logical gates within the quantum error correction code. A synthesis algorithm can be used to approximate any unitary gate up to arbitrary precision by assembling sequences of logical gates chosen from a small set of universal gates that are fault-tolerantly performable while encoded in a quantum error-correction code. However, current procedures do not yet support individual assignment of base gate costs and many do not support extend..

View full abstract

Grants

Funding Acknowledgements

This work was supported by the University of Melbourne through the establishment of an IBM Q Network Hub at the University. CDH is supported by a research grant from the Laby Foundation. We would like to thank Earl Campbell and Kae Nemoto for valuable discussions. We would also like to thank the referee for suggesting the Z-rotation catalyst circuit approach for estimating gate costs.