Mark Howard; Earl T. Campbell · 2017 · Physical Review Letters
Paper
Motivated by their necessity for most fault-tolerant quantum computation schemes, we formulate a resource theory for magic states. First, we show that robustness of magic is a well-behaved magic monotone that operationally quantifies the classical simulation overhead for a Gottesman-Knill-type scheme using ancillary magic states. Our framework subsequently finds immediate application in the task of synthesizing non-Clifford gates using magic states. When magic states are interspersed with Clifford gates, Pauli measurements, and stabilizer ancillas-the most general synthesis scenario-then the class of synthesizable unitaries is hard to characterize. Our techniques can place nontrivial lower bounds on the number of magic states required for implementing a given target unitary. Guided by these results, we have found new and optimal examples of such synthesis.
Analysis
This paper develops a resource theory for magic states to quantify their role in fault-tolerant quantum computation and optimize the synthesis of non-Clifford gates.
Discovery
V. G. Matsos; C. H. Valahu; M. J. Millican; T. Navickas; X. C. Kolesnikow; M. J. Biercuk; T. R. Tan
Tom Peham; Ludwig Schmid; Lucas Berent; Markus Müller; Robert Wille
Bence Hetényi; James R. Wootton
Hayato Goto
Amara Katabarwa; Katerina Gratsea; Athena Caesura; Peter D. Johnson
Paul V. Klimov; Andreas Bengtsson; Chris Quintana; Alexandre Bourassa; Sabrina Hong; A. Dunsworth; Kevin J. Satzinger; William P. Livingston; Volodymyr Sivak; Murphy Yuezhen Niu; Trond I. Andersen; Yaxing Zhang; Desmond Chik; Zijun Chen; Charles Neill; Catherine Erickson; Alejandro Grajales Dau; A. Megrant; P. Roushan; Alexander N. Korotkov; J. Kelly; Vadim Smelyanskiy; Yu Chen; Hartmut Neven
Source record