{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T23:02:14Z","timestamp":1771455734636,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031620751","type":"print"},{"value":"9783031620768","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-62076-8_15","type":"book-chapter","created":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T09:02:35Z","timestamp":1716886955000},"page":"238-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Exact Synthesis of\u00a0Multiqubit Clifford-Cyclotomic Circuits"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3514-420X","authenticated-orcid":false,"given":"Matthew","family":"Amy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9824-5804","authenticated-orcid":false,"given":"Andrew N.","family":"Glaudell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1420-5938","authenticated-orcid":false,"given":"Shaun","family":"Kelso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8603-2955","authenticated-orcid":false,"given":"William","family":"Maxwell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8413-9872","authenticated-orcid":false,"given":"Samuel S.","family":"Mendelson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0941-4333","authenticated-orcid":false,"given":"Neil J.","family":"Ross","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,29]]},"reference":[{"key":"15_CR1","unstructured":"Aharonov, D.: A simple proof that Toffoli and Hadamard are quantum universal (2003). arXiv preprint quant-ph\/0301040"},{"key":"15_CR2","unstructured":"Amy, M., Crawford, M., Glaudell, A.N., Macasieb, M.L., Mendelson, S.S., Ross, N.J.: Catalytic embeddings of quantum circuits (2023). arXiv preprint 2305.07720"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Amy, M., Glaudell, A.N., Li, S.M., Ross, N.J.: Improved synthesis of Toffoli-Hadamard circuits. In: Reversible Computation: 15th International Conference, RC 2023, Proceedings, pp. 169\u2013209 (2023)","DOI":"10.1007\/978-3-031-38100-3_12"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"252","DOI":"10.22331\/q-2020-04-06-252","volume":"4","author":"M Amy","year":"2020","unstructured":"Amy, M., Glaudell, A.N., Ross, N.J.: Number-theoretic characterizations of some restricted Clifford+$$T$$ circuits. Quantum 4, 252 (2020)","journal-title":"Quantum"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Beverland, M., Campbell, E.T., Howard, M., Kliuchnikov, V.: Lower bounds on the non-Clifford resources for quantum computations. Quantum Sci. Technol. 5 (2019)","DOI":"10.1088\/2058-9565\/ab8963"},{"issue":"4","key":"15_CR6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.91.042315","volume":"91","author":"G Duclos-Cianci","year":"2015","unstructured":"Duclos-Cianci, G., Poulin, D.: Reducing the quantum-computing overhead with complex gate distillation. Phys. Rev. A 91(4), 042315 (2015)","journal-title":"Phys. Rev. A"},{"issue":"8","key":"15_CR7","doi-asserted-by":"publisher","DOI":"10.1063\/1.4927100","volume":"56","author":"S Forest","year":"2015","unstructured":"Forest, S., Gosset, D., Kliuchnikov, V., McKinnon, D.: Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets. J. Math. Phys. 56(8), 082201 (2015)","journal-title":"J. Math. Phys."},{"issue":"3","key":"15_CR8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.032332","volume":"87","author":"B Giles","year":"2013","unstructured":"Giles, B., Selinger, P.: Exact synthesis of multiqubit Clifford+$$T$$ circuits. Phys. Rev. A 87(3), 032332 (2013)","journal-title":"Phys. Rev. A"},{"issue":"6760","key":"15_CR9","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1038\/46503","volume":"402","author":"D Gottesman","year":"1999","unstructured":"Gottesman, D., Chuang, I.L.: Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Nature 402(6760), 390\u2013393 (1999)","journal-title":"Nature"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"651","DOI":"10.4153\/S0008439520000727","volume":"64","author":"C Ingalls","year":"2021","unstructured":"Ingalls, C., Jordan, B.W., Keeton, A., Logan, A., Zaytman, Y.: The Clifford-cyclotomic group and Euler-Poincar\u00e9 characteristics. Can. Math. Bull. 64(3), 651\u2013666 (2021)","journal-title":"Can. Math. Bull."},{"key":"15_CR11","unstructured":"Kay, A.: Tutorial on the Quantikz package (2018). arXiv preprint 1809.03842"},{"key":"15_CR12","unstructured":"Kliuchnikov, V.: Synthesis of unitaries with Clifford+$$T$$ circuits (2013). arXiv preprint 1306.3200"},{"key":"15_CR13","unstructured":"Kliuchnikov, V., Lauter, K., Minko, R., Paetznick, A., Petit, C.: Shorter quantum circuits (2022). arXiv preprint 2203.10064"},{"issue":"7\u20138","key":"15_CR14","first-page":"607","volume":"13","author":"V Kliuchnikov","year":"2013","unstructured":"Kliuchnikov, V., Maslov, D., Mosca, M.: Fast and efficient exact synthesis of single-qubit unitaries generated by Clifford and $$T$$ gates. Quantum Inf. Comput. 13(7\u20138), 607\u2013630 (2013)","journal-title":"Quantum Inf. Comput."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Niemann, P., Wille, R., Drechsler, R.: Improved synthesis of Clifford+$$T$$ quantum functionality. In: 2018 Design, Automation & Test in Europe Conference & Exhibition, DATE 2018, Proceedings, pp. 597\u2013600 (2018)","DOI":"10.23919\/DATE.2018.8342078"},{"issue":"11\u201312","key":"15_CR16","first-page":"901","volume":"16","author":"NJ Ross","year":"2016","unstructured":"Ross, N.J., Selinger, P.: Optimal ancilla-free Clifford+$$T$$ approximation of $$z$$-rotations. Quantum Inf. Comput. 16(11\u201312), 901\u2013953 (2016)","journal-title":"Quantum Inf. Comput."},{"key":"15_CR17","unstructured":"Russell, T.: The exact synthesis of 1- and 2-qubit Clifford+$$T$$ circuits (2014). arXiv preprint 14086202"},{"key":"15_CR18","unstructured":"Sarnak, P.: Letter to Scott Aaronson and Andy Pollington on the Solavay-Kitaev theorem (2015). https:\/\/publications.ias.edu\/sarnak\/paper\/2637"},{"issue":"5","key":"15_CR19","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"15_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1934-7","volume-title":"Introduction to Cyclotomic Fields","author":"LC Washington","year":"1982","unstructured":"Washington, L.C.: Introduction to Cyclotomic Fields. Springer, New York, NY (1982). https:\/\/doi.org\/10.1007\/978-1-4612-1934-7"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-62076-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T09:04:57Z","timestamp":1716887097000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62076-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031620751","9783031620768"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62076-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MA was supported by the Canada Research Chairs program. MA and NJR were supported by the Natural Sciences and Engineering Research Council of Canada (NSERC). SK was supported by ONR, whose sponsorship and continuing guidance of the ILIR program has made this research possible. These efforts were funded under ONR award N0001423WX00070. SK, SSM, and WM were supported by Naval Innovative Science and Engineering funding. WM was supported by the U.S. Department of Energy, Office of Science, National Quantum Information Science Research Centers, Quantum Systems Accelerator.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"RC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reversible Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toru\u0144","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rc2024.mat.umk.pl\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}