{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:18:42Z","timestamp":1757618322899,"version":"3.44.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T00:00:00Z","timestamp":1750636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T00:00:00Z","timestamp":1750636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Fault-tolerant quantum computation enables reliable quantum computation but incurs a significant overhead from both time and resource perspectives. To reduce computation time, Austin G. Fowler proposed time-optimal quantum computation by constructing a quantum circuit for a fault-tolerant <jats:italic>T<\/jats:italic> gate without probabilistic <jats:italic>S<\/jats:italic> gate correction. In this work, we introduce a resource-compact quantum circuit that significantly reduces resource requirements by more than 60% for a fault-tolerant <jats:italic>T<\/jats:italic> gate without probabilistic <jats:italic>S<\/jats:italic> gate correction. Consequently, we present a quantum circuit that minimizes resource utilization for time-optimal quantum computation, demonstrating efficient time-optimal quantum computation. Additionally, we describe an efficient form involving initialization, <jats:italic>CNOT<\/jats:italic>s, and measurements, laying the foundation for the development of an efficient compiler for fault-tolerant quantum computation.<\/jats:p>","DOI":"10.1007\/s11128-025-04797-4","type":"journal-article","created":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T01:42:43Z","timestamp":1750642963000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Resource-compact time-optimal quantum computation"],"prefix":"10.1007","volume":"24","author":[{"given":"Taewan","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyunghyun","family":"Baek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongsoo","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeongho","family":"Bang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,23]]},"reference":[{"key":"4797_CR1","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Fault-tolerant quantum computation. In: Proceedings of 37th Conference on Foundations of Computer Science, pp. 56\u201365. IEEE (1996)","DOI":"10.1109\/SFCS.1996.548464"},{"key":"4797_CR2","doi-asserted-by":"crossref","unstructured":"Aharonov, D., Ben-Or, M.: Fault-tolerant quantum computation with constant error. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 176\u2013188 (1997)","DOI":"10.1145\/258533.258579"},{"key":"4797_CR3","doi-asserted-by":"crossref","unstructured":"Gottesman, D.: An introduction to quantum error correction and fault-tolerant quantum computation. Quantum Information Science and Its Contributions to Mathematics. In: Proceedings of Symposia in Applied Mathematics, vol. 68, pp. 13\u201358 (2010)","DOI":"10.1090\/psapm\/068\/2762145"},{"key":"4797_CR4","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1109\/TCAD.2003.811448","volume":"22","author":"VV Shende","year":"2003","unstructured":"Shende, V.V., Prasad, A.K., Markov, I.L., Hayes, J.P.: Synthesis of reversible logic circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22, 710\u2013722 (2003)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"4797_CR5","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TCAD.2013.2244643","volume":"32","author":"M Amy","year":"2013","unstructured":"Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32, 818\u2013830 (2013)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"4797_CR6","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, 901 (2016)","journal-title":"Quantum Inf. Comput."},{"key":"4797_CR7","doi-asserted-by":"publisher","first-page":"5445","DOI":"10.1038\/s41598-018-23764-x","volume":"8","author":"T Kim","year":"2018","unstructured":"Kim, T., Choi, B.-S.: Efficient decomposition methods for controlled-$${R}_{n}$$ using a single ancillary qubit. Sci. Rep. 8, 5445 (2018)","journal-title":"Sci. Rep."},{"key":"4797_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1038\/s41534-022-00651-y","volume":"8","author":"V Gheorghiu","year":"2022","unstructured":"Gheorghiu, V., Mosca, M., Mukhopadhyay, P.: $${T}$$-count and $${T}$$-depth of any multi-qubit unitary. npj Quantum Inf. 8, 141 (2022)","journal-title":"npj Quantum Inf."},{"key":"4797_CR9","unstructured":"Fowler, A.G.: Time-optimal quantum computation. arXiv:1210.4626 (2012)"},{"key":"4797_CR10","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.2.010103","volume":"2","author":"R Babbush","year":"2021","unstructured":"Babbush, R., McClean, J.R., Newman, M., Gidney, C., Boixo, S., Neven, H.: Focus beyond quadratic speedups for error-corrected quantum advantage. PRX Quantum 2, 010103 (2021)","journal-title":"PRX Quantum"},{"key":"4797_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.3.010331","volume":"3","author":"C Chamberland","year":"2022","unstructured":"Chamberland, C., Campbell, E.T.: Universal quantum computing with twist-free and temporally encoded lattice surgery. PRX Quantum 3, 010331 (2022)","journal-title":"PRX Quantum"},{"key":"4797_CR12","volume":"10","author":"M Hanks","year":"2020","unstructured":"Hanks, M., Estarellas, M.P., Munro, W.J., Nemoto, K.: Effective compression of quantum braided circuits aided by ZX-calculus. Phys. Rev. X 10, 041030 (2020)","journal-title":"Phys. Rev. X"},{"key":"4797_CR13","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1109\/TCAD.2014.2341953","volume":"33","author":"M Amy","year":"2014","unstructured":"Amy, M., Maslov, D., Mosca, M.: Polynomial-time $${T}$$-depth optimization of Clifford+$${T}$$ circuits via matroid partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33, 1476\u20131489 (2014)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"4797_CR14","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.22331\/q-2024-02-22-1264","volume":"8","author":"WJ Huggins","year":"2024","unstructured":"Huggins, W.J., McClean, J.R.: Accelerating quantum algorithms with precomputation. Quantum 8, 1264 (2024)","journal-title":"Quantum"},{"key":"4797_CR15","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aa66eb","volume":"2","author":"A Paler","year":"2017","unstructured":"Paler, A., Polian, I., Nemoto, K., Devitt, S.J.: Fault-tolerant high level quantum circuits: form, compilation and description. Quantum Sci. Tech. 2, 025003 (2017)","journal-title":"Quantum Sci. Tech."},{"key":"4797_CR16","volume-title":"Quantum Comput. Quantum Inf.","author":"M Nielsen","year":"2000","unstructured":"Nielsen, M., Chuang, I.: Quantum Comput. Quantum Inf. Cambridge University Press, Cambridge (2000)"},{"key":"4797_CR17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.022316","volume":"71","author":"S Bravyi","year":"2005","unstructured":"Bravyi, S., Kitaev, A.: Universal quantum computation with ideal Clifford gates and noisy ancillas. Phys. Rev. A 71, 022316 (2005)","journal-title":"Phys. Rev. A"},{"key":"4797_CR18","doi-asserted-by":"crossref","unstructured":"Paler, A., Polian, I., Nemoto, K., Devitt, S.J.: A regular representation of quantum circuits. Reversible Computation, Lecture Notes in Computer Science (LNCS) Krivine, Jean and Stefani, Jean-Bernard, vol. 9138, pp. 139\u2013154 (2015)","DOI":"10.1007\/978-3-319-20860-2_9"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04797-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-04797-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04797-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T22:00:49Z","timestamp":1757196049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-04797-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,23]]},"references-count":18,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2025,7]]}},"alternative-id":["4797"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-04797-4","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2025,6,23]]},"assertion":[{"value":"16 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"193"}}