dral benchmarking. Phys. Rev. A, 92:
060302, Dec 2015. DOI: 10.1103/Phys-
RevA.92.060302. URL https://link.aps.
org/doi/10.1103/PhysRevA.92.060302.
[13] A. D. C´orcoles, Jay M. Gambetta, Jerry M.
Chow, John A. Smolin, Matthew Ware,
Joel Strand, B. L. T. Plourde, and
M. Steffen. Process verification of
two-qubit quantum gates by random-
ized benchmarking. Phys. Rev. A, 87:
030301, Mar 2013. DOI: 10.1103/Phys-
RevA.87.030301. URL https://link.aps.
org/doi/10.1103/PhysRevA.87.030301.
[14] Andrew W Cross, Easwar Magesan, Lev S
Bishop, John A Smolin, and Jay M Gam-
betta. Scalable randomised benchmark-
ing of non-clifford gates. npj Quan-
tum Information, 2(1), 2016. DOI:
10.1038/npjqi.2016.12. URL https://doi.
org/10.1038/npjqi.2016.12.
[15] Meuli G., Soeken M., and De Micheli G. Sat-
based {CNOT, T} quantum circuit synthe-
sis. Kari J., Ulidowski I. (eds) Reversible
Computation. RC 2018. Lecture Notes in
Computer Science, 11106, 2018. DOI:
10.1007/978-3-319-99498-7˙12.
[16] Shelly Garion, Naoki Kanazawa, Haggai
Landa, David C. McKay, Sarah Sheldon,
Andrew W. Cross, and Christopher J.
Wood. Experimental implementation of
non-clifford interleaved randomized bench-
marking with a controlled-s gate, 2020. URL
https://arxiv.org/abs/2007.08532.
[17] Andrew N. Glaudell, Neil J. Ross, and Ja-
cob M. Taylor. Optimal two-qubit circuits
for universal fault-tolerant quantum com-
putation, 2020. URL https://arxiv.org/
abs/2001.05997.
[18] David Gosset, Vadym Kliuchnikov, Michele
Mosca, and Vincent Russo. An algorithm
for the t-count. Quantum Info. Com-
put., 14(15–16):1261–1276, November 2014.
ISSN 1533-7146. URL https://dl.acm.
org/doi/10.5555/2685179.2685180.
[19] Daniel Gottesman and Isaac L. Chuang.
Demonstrating the viability of universal
quantum computation using teleportation
and single-qubit operations. Nature, 402:
390–393, 1999. ISSN 1476-4687. DOI:
10.1038/46503. URL https://doi.org/
10.1038/46503.
[20] Daniel Eric Gottesman. Stabilizer codes
and quantum error correction, 1997.
URL https://resolver.caltech.edu/
CaltechETD:etd-07162004-113028.
[21] Luke E Heyfron and Earl T Campbell. An
efficient quantum compiler that reduces t
count. Quantum Science and Technology, 4
(1):015004, sep 2018. DOI: 10.1088/2058-
9565/aad604. URL https://doi.org/10.
1088%2F2058-9565%2Faad604.
[22] Tomas Jochym-O’Connor, Aleksander Ku-
bica, and Theodore J. Yoder. Disjoint-
ness of stabilizer codes and limitations on
fault-tolerant logical gates. Phys. Rev. X,
8:021047, May 2018. DOI: 10.1103/Phys-
RevX.8.021047. URL https://link.aps.
org/doi/10.1103/PhysRevX.8.021047.
[23] E. Knill, D. Leibfried, R. Reichle, J. Brit-
ton, R. B. Blakestad, J. D. Jost, C. Langer,
R. Ozeri, S. Seidelin, and D. J. Wineland.
Randomized benchmarking of quantum
gates. Phys. Rev. A, 77:012307, Jan 2008.
DOI: 10.1103/PhysRevA.77.012307. URL
https://link.aps.org/doi/10.1103/
PhysRevA.77.012307.
[24] Easwar Magesan, J. M. Gambetta,
and Joseph Emerson. Scalable and
robust randomized benchmarking
of quantum processes. Phys. Rev.
Lett., 106:180504, May 2011. DOI:
10.1103/PhysRevLett.106.180504. URL
https://link.aps.org/doi/10.1103/
PhysRevLett.106.180504.
[25] Easwar Magesan, Jay M. Gambetta,
and Joseph Emerson. Characterizing
quantum gates via randomized benchmark-
ing. Phys. Rev. A, 85:042311, Apr 2012.
DOI: 10.1103/PhysRevA.85.042311. URL
https://link.aps.org/doi/10.1103/
PhysRevA.85.042311.
[26] Easwar Magesan, Jay M. Gambetta, B. R.
Johnson, Colm A. Ryan, Jerry M. Chow,
Seth T. Merkel, Marcus P. da Silva,
George A. Keefe, Mary B. Rothwell,
Thomas A. Ohki, Mark B. Ketchen,
and M. Steffen. Efficient measurement
of quantum gate error by interleaved
randomized benchmarking. Phys. Rev.
Lett., 109:080505, Aug 2012. DOI:
10.1103/PhysRevLett.109.080505. URL
Accepted in Quantum 2020-11-30, click title to verify. Published under CC-BY 4.0. 8