|
|
|
|
References
|
|
| |
| 1. |
D. Gottesman, Stabilizer codes and quantum error correction, Ph. D. Thesis, California Institute of Technology, Pasadena, CA, 1997, arXiv: quant-ph/9705052 |
| 2. |
D. Gottesman, The Heisenberg representation of quantum computers, arXiv: quant-ph/9807006 |
| 3. |
M. A. Nielsen, I. L. Chuang, Quantum Computation and Quantum Communication, Cambridge Univ. Press, Cambridge, 2000  |
| 4. |
S. Bravyi, A. Kitaev, “Universal quantum computation with ideal Clifford gates and noisy ancillas”, Phys. Rev. A, 71:2 (2005), 022316, 14 pp.   |
| 5. |
V. Veitch, S. A. H. Mousavian, D. Gottesman, J. Emerson, “The resource theory of stabilizer quantum computation”, New J. Phys., 16:1 (2014), 013009, 32 pp. |
| 6. |
D. Gottesman, I. L. Chuang, “Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations”, Nature, 402:6760 (1999), 390–393 |
| 7. |
D. M. Appleby, “Symmetric informationally complete-positive operator valued measures and the extended Clifford group”, J. Math. Phys., 46:5 (2005), 052107, 29 pp., arXiv: quant-ph/0412001 |
| 8. |
B. Zeng, X. Chen, I. L. Chuang, “Semi-Clifford operations, structure of $\mathscr{C}_k$ hierarchy, and gate complexity for fault-tolerant quantum computation”, Phys. Rev. A, 77:4 (2008), 042313, 12 pp. |
| 9. |
S. Beigi, P. W. Shor, “$\mathcal C_3$, semi-Clifford and generalized semi-Clifford operations”, Quantum Inf. Comput., 10:1–2 (2010), 41–59, arXiv: 0810.5108 |
| 10. |
H. Zhu, “SIC POVMs and Clifford groups in prime dimensions”, J. Phys. A: Math. Theor., 43:30 (2010), 305305, 24 pp. |
| 11. |
M. Howard, J. Vala, “Qudit versions of the qubit $\pi/8$ gate”, Phys. Rev. A, 86:2 (2012), 022316, 10 pp. |
| 12. |
Y. Nakata, M. Murao, “Diagonal quantum circuits: Their computational power and applications”, Eur. Phys. J. Plus, 129:7 (2014), 152, 14 pp. |
| 13. |
I. Bengtsson, K. Blanchfield, E. Campbell, M. Howard, “Order 3 symmetry in the Clifford hierarchy”, J. Phys. A: Math. Theor., 47:45 (2014), 455302, 13 pp. |
| 14. |
S. X. Cui, D. Gottesman, A. Krishna, “Diagonal gates in the Clifford hierarchy”, Phys. Rev. A, 95:1 (2017), 012329, 7 pp. |
| 15. |
H. Zhu, “Multiqubit Clifford groups are unitary 3-designs”, Phys. Rev. A, 96:6 (2017), 062336, 7 pp. |
| 16. |
J. Hu, Q. Liang, R. Calderbank, Climbing the diagonal Clifford hierarchy, arXiv: 2110.11923 |
| 17. |
J. Hu, Q. Liang, R. Calderbank, “Designing the quantum channels induced by diagonal gates”, Quantum, 6 (2022), 802, 36 pp., arXiv: 2109.13481 |
| 18. |
J. T. Anderson, “On groups in the qubit Clifford hierarchy”, Quantum, 8 (2024), 1370, 33 pp., arXiv: 2212.05398 |
| 19. |
M. Frembs, S. Roberts, E. T. Campbell, S. D. Bartlett, “Hierarchies of resources for measurement-based quantum computation”, New J. Phys., 25:1 (2023), 013002, 24 pp. |
| 20. |
I. Chen, N. de Silva, Characterising semi-Clifford gates using algebraic sets, arXiv: 2309.15184 |
| 21. |
E. T. Campbell, H. Anwar, D. E. Browne, “Magic-state distillation in all prime dimensions using quantum Reed–Muller codes”, Phys. Rev. X, 2:4 (2012), 041021, 20 pp. |
| 22. |
B. Giles, P. Selinger, “Exact synthesis of multiqubit Clifford${}+T$ circuits”, Phys. Rev. A, 87:3 (2013), 032332, 7 pp. |
| 23. |
E. T. Campbell, “Enhanced fault-tolerant quantum computing in $d$-level systems”, Phys. Rev. Lett., 113:23 (2014), 230501, 5 pp. |
| 24. |
D. Gosset, V. Kliuchnikov, M. Mosca, V. Russo, “An algorithm for the $T$-count”, Quantum Inf. Comput., 14:15–16 (2014), 1261–1276, arXiv: 1308.4134 |
| 25. |
N. J. Ross, P. Selinger, “Optimal ancilla-free Clifford${}+T$ approximation of $z$-rotations”, Quantum Inf. Comput., 16:11–12 (2016), 901–953 |
| 26. |
M. Howard, E. Campbell, “Application of a resource theory for magic states to fault-tolerant quantum computing”, Phys. Rev. Lett., 118:9 (2017), 090501, 6 pp., arXiv: 1609.07488 |
| 27. |
S. Prakash, A. Jain, B. Kapur, S. Seth, “Normal form for single-qutrit Clifford${}+T$ operators and synthesis of single-qutrit gates”, Phys. Rev. A, 98:3 (2018), 032304, 9 pp. |
| 28. |
A. N. Glaudell, N. J. Ross, J. M. Taylor, “Canonical forms for single-qutrit Clifford${}+T$ operatorts”, Ann. Phys., 406 (2019), 54–70 |
| 29. |
B. Giles, P. Selinger, Remarks on Matsumoto and Amano's normal form for single-qubit Clifford${}+T$ operators, arXiv: 1312.6584 |
| 30. |
M. Amy, M. Mosca, “$T$-count optimization and Reed–Muller codes”, IEEE Trans. Inf. Theory, 65:8 (2019), 4771–4784 |
| 31. |
L. E. Heyfron, E. Campbell, A quantum compiler for qudits of prime dimension greater than 3, arXiv: 1902.05634 |
| 32. |
N. Rengaswamy, R. Calderbank, M. Newman, H. D. Pfister, “On optimality of CSS codes for transversal $T$”, IEEE J. Sel. Areas Inf. Theor., 1:2 (2020), 499–514 |
| 33. |
Y. Wang, Z. Hu, B. C. Sanders, S. Kais, “Qudits and high-dimensional quantum computing”, Front. Phys., 8 (2020), 589504, 24 pp. |
| 34. |
S. Prakash, A. R. Kalra, A. Jain, “A normal form for single-qudit Clifford${}+T$ operators”, Quantum Inf. Process., 20:10 (2021), 341, 26 pp. |
| 35. |
A. N. Glaudell, N. J. Ross, J. van de Wetering, L. Yeh, “Qutrit metaplectic gates are a subset of Clifford${}+T$,”, 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022) (Urbana Champaign, IL, USA, 11–15 July, 2022), Leibniz International Proceedings in Informatics, 232, eds. F. Le Gall, T. Morimae, Schloss Dagstuhl, Dagstuhl, Germany, 2022, 12, 15 pp. |
| 36. |
F. Labib, “Stabilizer rank and higher-order Fourier analysis”, Quantum, 6 (2022), 645, 16 pp. |
| 37. |
M. Ringbauer, M. Meth, L. Postler, R. Stricker, R. Blatt, P. Schindler, T. Monz, “A universal qudit quantum processor with trapped ions”, Nature Phys., 18:9 (2022), 1053–1057 |
| 38. |
J. Jiang, X. Wang, “Lower bound for the $T$-count via unitary stabilizer nullity”, Phys. Rev. Appl., 19:3 (2023), 034052, 19 pp. |
| 39. |
X. Li, S. Luo, “Optimal diagonal qutrit gates for creating Wigner negativity”, Phys. Lett. A, 460 (2023), 128620, 10 pp. |
| 40. |
X. Li, S. Luo, “Optimality of $T$-gate for generating magic resource”, Commun. Theor. Phys., 75:4 (2023), 045101, 9 pp. |
| 41. |
V. Kliuchnikov, K. Lauter, R. Minko, A. Paetznick, C. Petit, “Shorter quantum circuits via single-qubit gate approximation”, Quantum, 7 (2023), 1208, 87 pp. |
| 42. |
A. Lubotsky, R. Phillips, P. Sarnak, “Hecke operators and distributing points on the sphere I”, Commun. Pure Appl. Math., 39:S1 (1986), S149–S186 ; “Hecke operators and distributing points on $S^2$. II”, 40:4 (1987), 401–420 |
| 43. |
A. W. Harrow, B. Recht, I. L. Chuang, “Efficient discrete approximations of quantum gates”, J. Math. Phys., 43:9 (2002), 4445–4451 |
| 44. |
A. Bocharov, Y. Gurevich, K. M. Svore, “Efficient decomposition of single-qubit gates into $V$ basis circuits”, Phys. Rev. A, 88:1 (2013), 012313, 13 pp. |
| 45. |
N. J. Ross, Optimal ancilla-free Clifford${}+V$ approximation of $z$-rotations, arXiv: 1409.4355 |
| 46. |
A. Bocharov, “A note on optimality of quantum circuits over metaplectic basis”, Quantum Inf. Comput., 18:1–2 (2018), 1–17 |
| 47. |
S. Forest, D. Gosset, V. Kliuchnikov, D. McKinnon, “Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets”, J. Math. Phys., 56:8 (2015), 082201, 26 pp. |
| 48. |
R. B. Griffiths, C.-S. Niu, “Semiclassical Fourier transform for quantum computation”, Phys. Rev. Lett., 76:17 (1996), 3228–3231 |
| 49. |
N. Wiebe, V. Kliuchnikov, “Floating point representations in quantum circuit synthesis”, New J. Phys., 15:9 (2013), 093041, 25 pp. |
| 50. |
H. Goto, “Resource requirements for a fault-tolerant quantum Fourier transform”, Phys. Rev. A, 90:5 (2014), 052318, 7 pp. |
| 51. |
J. Schwinger, “Unitary operator bases”, Proc. Nat. Acad. Sci. USA, 46:4 (1960), 570–579 |
| 52. |
S. Mac Lane, G. Birkhoff, Algebra, Chelsea, New York, 1988 |
