{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T15:32:34Z","timestamp":1769009554521,"version":"3.49.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T00:00:00Z","timestamp":1713398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T00:00:00Z","timestamp":1713398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["RS-2023-00256221"],"award-info":[{"award-number":["RS-2023-00256221"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["RS-2023-00256221"],"award-info":[{"award-number":["RS-2023-00256221"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Institute of Information & communications Technology Planning & Evaluation(IITP) of Korea","award":["No.2019-0-00033"],"award-info":[{"award-number":["No.2019-0-00033"]}]},{"name":"Institute of Information & communications Technology Planning & Evaluation(IITP) of Korea","award":["No.2019-0-00033"],"award-info":[{"award-number":["No.2019-0-00033"]}]},{"name":"Institute of Information & communications Technology Planning & Evaluation(IITP) of Korea","award":["No.2019-0-00033"],"award-info":[{"award-number":["No.2019-0-00033"]}]},{"name":"Institute of Information & communications Technology Planning & Evaluation(IITP) of Korea","award":["No.2019-0-00033"],"award-info":[{"award-number":["No.2019-0-00033"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>When implementing a quantum circuit for a desired reversible function, an attempt is made to design an accurate quantum circuit. Then, the quantum circuit is optimized based on a specific cost function, such as design cost, width (the number of qubits), depth, etc. In particular, if an in-place subcircuit itself can be optimized while maintaining its in-place property, it will be a very useful way to increase efficiency without changing the initial architecture of the entire quantum circuit. Furthermore, since its (clean) work qubits can easily be utilized in subsequent subroutines of the quantum circuit, it has an additional important advantage in terms of width. In this paper, for the first time to the best of our knowledge, we present a global Toffoli-depth reduction methodology for an in-place version reversible circuit in the case that the given input circuit is optimized with Toffoli-count. We mainly introduce a process to optimize the<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\chi $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>\u03c7<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>internal function block in SHA3-256 to explain our Toffoli-depth reduction approach preserving the in-place property, and hence, well-balanced five<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\chi $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>\u03c7<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>quantum circuits are induced in terms of its width and T-depth. And then, we apply these five<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\chi $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>\u03c7<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>circuits to design the entire SHA3-256 cryptosystem. One of the proposed SHA3-256 quantum circuits has a width of 1600 and a T-depth of 264, and this shows a result of 50% and 38.9% reduction compared to the previous circuit in terms of width and T-depth, respectively. Other versions of our SHA3-256 circuits just required 10\u201333 qubits per one T-depth compared to the previous results which require over 1800 qubits per T-depth, and so this means that our SHA3-256 circuits are well-balanced. Finally, we constructed Grover\u2019s algorithm circuit using each version that realized SHA3-256. When output circuits for the presented method were used, quantum volume values of Grover\u2019s algorithm circuits became 33 and 50<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\%$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mo>%<\/mml:mo><\/mml:math><\/jats:alternatives><\/jats:inline-formula>of the value when the input circuit was used.<\/jats:p>","DOI":"10.1007\/s11128-024-04365-2","type":"journal-article","created":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T14:01:48Z","timestamp":1713448908000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Toffoli-depth reduction method preserving in-place quantum circuits and its application to SHA3-256"],"prefix":"10.1007","volume":"23","author":[{"given":"Jongheon","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yousung","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"You-Seok","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boheung","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dooho","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,18]]},"reference":[{"issue":"1","key":"4365_CR1","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1007\/s10825-020-01620-4","volume":"20","author":"SM Shahidi","year":"2021","unstructured":"Shahidi, S.M., Etemadi Borujeni, S.: A new method for reversible circuit synthesis using a simulated annealing algorithm and don\u2019t-cares. J. Comput. Electron. 20(1), 718\u2013734 (2021)","journal-title":"J. Comput. Electron."},{"key":"4365_CR2","doi-asserted-by":"crossref","unstructured":"Fazel, K., Thornton, M.A., Rice, J.E.: ESOP-based Toffoli gate cascade generation. In: 2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, pp. 206\u2013 209. IEEE (2007)","DOI":"10.1109\/PACRIM.2007.4313212"},{"issue":"2","key":"4365_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3501334","volume":"3","author":"T H\u00e4ner","year":"2022","unstructured":"H\u00e4ner, T., Soeken, M.: Lowering the t-depth of quantum circuits via logic network optimization. ACM Trans. Quantum Comput. 3(2), 1\u201315 (2022)","journal-title":"ACM Trans. Quantum Comput."},{"key":"4365_CR4","doi-asserted-by":"crossref","unstructured":"Testa, E., Soeken, M., Amar\u00f9, L., De\u00a0Micheli, G.: Reducing the multiplicative complexity in logic networks for cryptography and security applications. In: 2019 56th ACM\/IEEE Design Automation Conference (DAC), pp. 1\u2013 6. IEEE (2019)","DOI":"10.1145\/3316781.3317893"},{"key":"4365_CR5","doi-asserted-by":"crossref","unstructured":"Testa, E., Soeken, M., Riener, H., Amaru, L., De\u00a0Micheli, G.: A logic synthesis toolbox for reducing the multiplicative complexity in logic networks. In: 2020 Design, Automation and Test in Europe Conference and Exhibition (DATE), pp. 568\u2013 573. IEEE (2020)","DOI":"10.23919\/DATE48585.2020.9116467"},{"issue":"1","key":"4365_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41534-021-00514-y","volume":"8","author":"G Meuli","year":"2022","unstructured":"Meuli, G., Soeken, M., De Micheli, G.: Xor-and-inverter graphs for quantum compilation. NPJ Quantum Inf. 8(1), 1\u201311 (2022)","journal-title":"NPJ Quantum Inf."},{"key":"4365_CR7","doi-asserted-by":"crossref","unstructured":"Meuli, G., Soeken, M., Roetteler, M., Bjorner, N., De\u00a0Micheli, G.: Reversible pebbling game for quantum memory management. In: 2019 Design, Automation and Test in Europe Conference and Exhibition (DATE), pp. 288\u2013 291. IEEE (2019)","DOI":"10.23919\/DATE.2019.8715092"},{"issue":"10","key":"4365_CR8","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(10), 1476\u20131489 (2014)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"1","key":"4365_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41534-018-0072-4","volume":"4","author":"Y Nam","year":"2018","unstructured":"Nam, Y., Ross, N.J., Su, Y., Childs, A.M., Maslov, D.: Automated optimization of large quantum circuits with continuous parameters. NPJ Quantum Inf. 4(1), 1\u201312 (2018)","journal-title":"NPJ Quantum Inf."},{"key":"4365_CR10","doi-asserted-by":"crossref","unstructured":"Lee, J., Lee, S., Lee, Y.-S., Choi, D.: T-depth reduction method for efficient SHA-256 quantum circuit construction. IET Inf. Secur. (2022)","DOI":"10.1007\/978-3-031-08896-4_20"},{"issue":"3","key":"4365_CR11","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1109\/TCAD.2007.911334","volume":"27","author":"D Maslov","year":"2008","unstructured":"Maslov, D., Dueck, G.W., Miller, D.M., Negrevergne, C.: Quantum circuit simplification and level compaction. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 27(3), 436\u2013444 (2008)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"2","key":"4365_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2431211.2431220","volume":"45","author":"M Saeedi","year":"2013","unstructured":"Saeedi, M., Markov, I.L.: Synthesis and optimization of reversible circuits-a survey. ACM Comput. Surv. (CSUR) 45(2), 1\u201334 (2013)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"6","key":"4365_CR13","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(6), 818\u2013830 (2013)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"5","key":"4365_CR14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.80.052312","volume":"80","author":"AG Fowler","year":"2009","unstructured":"Fowler, A.G., Stephens, A.M., Groszkowski, P.: High-threshold universal quantum computation on the surface code. Phys. Rev. A 80(5), 052312 (2009)","journal-title":"Phys. Rev. A"},{"issue":"12","key":"4365_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-018-2107-3","volume":"17","author":"P Kim","year":"2018","unstructured":"Kim, P., Han, D., Jeong, K.C.: Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2. Quantum Inf. Process. 17(12), 1\u201339 (2018)","journal-title":"Quantum Inf. Process."},{"key":"4365_CR16","unstructured":"Draper, T.G., Kutin, S.A., Rains, E.M., Svore, K.M.: A logarithmic-depth quantum carry-lookahead adder. quant-ph\/0406142 (2004)"},{"issue":"6","key":"4365_CR17","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(6), 710\u2013722 (2003)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"4365_CR18","doi-asserted-by":"crossref","unstructured":"Amy, M., Matteo, O.D., Gheorghiu, V., Mosca, M., Parent, A., Schanck, J.: Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3. In: International Conference on Selected Areas in Cryptography, pp. 317\u2013 337. Springer (2016)","DOI":"10.1007\/978-3-319-69453-5_18"},{"key":"4365_CR19","unstructured":"Lee, J.: A study on T-depth and Toffoli-depth reduction techniques for efficient quantum circuit designs and their applications to hash functions. http:\/\/www.dcollection.net\/handler\/ust\/200000651126 (2023)"},{"key":"4365_CR20","doi-asserted-by":"crossref","unstructured":"Jaques, S., Naehrig, M., Roetteler, M., Virdia, F.: Implementing Grover oracles for quantum key search on AES and LowMC. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 280\u2013 310. Springer (2020)","DOI":"10.1007\/978-3-030-45724-2_10"},{"key":"4365_CR21","doi-asserted-by":"crossref","unstructured":"Abdessaied, N., Amy, M., Soeken, M., Drechsler, R.: Technology mapping of reversible circuits to Clifford + T quantum circuits. In: 2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL), pp. 150\u2013 155. IEEE (2016)","DOI":"10.1109\/ISMVL.2016.33"},{"key":"4365_CR22","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Maslov, D., Dueck, G.W.: A transformation based algorithm for reversible logic synthesis. In: Proceedings 2003. Design Automation Conference (IEEE Cat. No. 03ch37451), pp. 318\u2013 323. IEEE (2003)","DOI":"10.1145\/775914.775915"},{"key":"4365_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jsc.2015.03.002","volume":"73","author":"M Soeken","year":"2016","unstructured":"Soeken, M., Tague, L., Dueck, G.W., Drechsler, R.: Ancilla-free synthesis of large reversible functions using binary decision diagrams. J. Symb. Comput. 73, 1\u201326 (2016)","journal-title":"J. Symb. Comput."},{"issue":"8","key":"4365_CR24","doi-asserted-by":"publisher","first-page":"2466","DOI":"10.1007\/s10773-018-3768-5","volume":"57","author":"W Zhu","year":"2018","unstructured":"Zhu, W., Li, Z., Zhang, G., Pan, S., Zhang, W.: A reversible logical circuit synthesis algorithm based on decomposition of cycle representations of permutations. Int. J. Theor. Phys. 57(8), 2466\u20132474 (2018)","journal-title":"Int. J. Theor. Phys."},{"key":"4365_CR25","doi-asserted-by":"crossref","unstructured":"Sasanian, Z., Saeedi, M., Sedighi, M., Zamani, M.S.: A cycle-based synthesis algorithm for reversible logic. In: 2009 Asia and South Pacific Design Automation Conference, pp. 745\u2013 750. IEEE (2009)","DOI":"10.1109\/ASPDAC.2009.4796569"},{"issue":"4","key":"4365_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1877745.1877747","volume":"6","author":"M Saeedi","year":"2010","unstructured":"Saeedi, M., Zamani, M.S., Sedighi, M., Sasanian, Z.: Reversible circuit synthesis using a cycle-based approach. ACM J. Emerg. Technol. Comput. Syst. (JETC) 6(4), 1\u201326 (2010)","journal-title":"ACM J. Emerg. Technol. Comput. Syst. (JETC)"},{"key":"4365_CR27","unstructured":"Yang, G., Xie, F., Song, X., Hung, W.N., Perkowski, M.A.: A constructive algorithm for reversible logic synthesis. In: 2006 IEEE International Conference on Evolutionary Computation, pp. 2416\u2013 2421. IEEE (2006)"},{"key":"4365_CR28","doi-asserted-by":"crossref","unstructured":"Yang, G., Song, X., Hung, W.N., Xie, F., Perkowski, M.A.: Group theory based synthesis of binary reversible circuits. In: International Conference on Theory and Applications of Models of Computation, pp. 365\u2013 374. Springer (2006)","DOI":"10.1007\/11750321_35"},{"key":"4365_CR29","doi-asserted-by":"publisher","first-page":"69","DOI":"10.9790\/0661-1466979","volume":"14","author":"M Osman","year":"2013","unstructured":"Osman, M., Younes, A., Fahmy, M.H.: Integration of irreversible gates in reversible circuits using NCT library. IOSR J. Comput. Eng 14, 69\u201379 (2013)","journal-title":"IOSR J. Comput. Eng"},{"key":"4365_CR30","volume-title":"A First Course in Abstract Algebra","author":"JB Fraleigh","year":"2003","unstructured":"Fraleigh, J.B.: A First Course in Abstract Algebra. Pearson Education India, Chennai (2003)"},{"key":"4365_CR31","doi-asserted-by":"crossref","unstructured":"Rahman, M.Z., Rice, J.E.: Templates for positive and negative control Toffoli networks. In: International Conference on Reversible Computation, pp. 125\u2013 136. Springer (2014)","DOI":"10.1007\/978-3-319-08494-7_10"},{"key":"4365_CR32","unstructured":"Maslov, D., Dueck, G.W., Miller, D.M.: Simplification of Toffoli networks via templates. In: 16th Symposium on Integrated Circuits and Systems Design, 2003. SBCCI 2003. Proceedings., pp. 53\u2013 58. IEEE (2003)"},{"key":"4365_CR33","doi-asserted-by":"crossref","unstructured":"Iwama, K., Kambayashi, Y., Yamashita, S.: Transformation rules for designing CNOT-based quantum circuits. In: Proceedings of the 39th Annual Design Automation Conference, pp. 419\u2013 424 (2002)","DOI":"10.1145\/513918.514026"},{"key":"4365_CR34","doi-asserted-by":"crossref","unstructured":"Maslov, D., Young, C., Miller, D.M., Dueck, G.W.: Quantum circuit simplification using templates. In: Design, Automation and Test in Europe, pp. 1208\u2013 1213. IEEE (2005)","DOI":"10.1109\/DATE.2005.249"},{"key":"4365_CR35","unstructured":"Maslov, D.: Reversible logic synthesis benchmarks page. 2011. http:\/\/webhome.cs.uvic.ca\/dmaslov (2020)"},{"key":"4365_CR36","doi-asserted-by":"crossref","unstructured":"Dworkin, M.J., et al.: SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. US Department of Commerce, National Institute of Standards and Technology (NIST) (2015)","DOI":"10.6028\/NIST.FIPS.202"},{"issue":"3","key":"4365_CR37","first-page":"282","volume":"8","author":"KN Patel","year":"2008","unstructured":"Patel, K.N., Markov, I.L., Hayes, J.P.: Optimal synthesis of linear reversible circuits. Quantum Inf. Comput. 8(3), 282\u2013294 (2008)","journal-title":"Quantum Inf. Comput."},{"key":"4365_CR38","doi-asserted-by":"crossref","unstructured":"Jiang, J., Sun, X., Teng, S.-H., Wu, B., Wu, K., Zhang, J.: Optimal space-depth trade-off of CNOT circuits in quantum logic synthesis. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 213\u2013229. SIAM (2020)","DOI":"10.1137\/1.9781611975994.13"},{"key":"4365_CR39","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Soeken, M., Drechsler, R.: Mapping NCV circuits to optimized Clifford + T circuits. In: International Conference on Reversible Computation, pp. 163\u2013175. Springer (2014)","DOI":"10.1007\/978-3-319-08494-7_13"},{"key":"4365_CR40","doi-asserted-by":"crossref","unstructured":"Niemann, P., Gupta, A., Drechsler, R.: T-depth optimization for fault-tolerant quantum circuits. In: 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL), pp. 108\u2013113. IEEE (2019)","DOI":"10.1109\/ISMVL.2019.00027"},{"issue":"10","key":"4365_CR41","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s11128-023-04142-7","volume":"22","author":"J Lee","year":"2023","unstructured":"Lee, J., Kang, Y., Lee, Y.-S., Chung, B., Choi, D.: MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits. Quantum Inf. Process. 22(10), 381 (2023)","journal-title":"Quantum Inf. Process."},{"key":"4365_CR42","unstructured":"Gidney, C.: Why is an oracle qubit necessary in Grover\u2019s algorithm? https:\/\/quantumcomputing.stackexchange.com\/questions\/2145\/why-is-an-oracle-qubit-necessary-in-grovers-algorithm (2018)"},{"issue":"8","key":"4365_CR43","doi-asserted-by":"publisher","first-page":"4771","DOI":"10.1109\/TIT.2019.2906374","volume":"65","author":"M Amy","year":"2019","unstructured":"Amy, M., Mosca, M.: T-count optimization and reed-muller codes. IEEE Trans. Inf. Theory 65(8), 4771\u20134784 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4365_CR44","doi-asserted-by":"crossref","unstructured":"Datta, K., Rathi, G., Sengupta, I., Rahaman, H.: Synthesis of reversible circuits using heuristic search method. In: 2012 25th International Conference on VLSI Design, pp. 328\u2013333. IEEE (2012)","DOI":"10.1109\/VLSID.2012.92"},{"issue":"5","key":"4365_CR45","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., Bennett, C.H., Cleve, R., DiVincenzo, D.P., Margolus, N., Shor, P., Sleator, T., Smolin, J.A., Weinfurter, H.: Elementary gates for quantum computation. Phys. Rev. A 52(5), 3457 (1995)","journal-title":"Phys. Rev. A"},{"key":"4365_CR46","doi-asserted-by":"crossref","unstructured":"Wille, R., Lye, A., Niemann, P.: Checking reversibility of Boolean functions. In: Reversible Computation: 8th International Conference, RC 2016, Bologna, Italy, July 7\u20138, 2016, Proceedings 8, pp. 322\u2013337. Springer (2016)","DOI":"10.1007\/978-3-319-40578-0_23"},{"issue":"2","key":"4365_CR47","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.68.022312","volume":"68","author":"R Raussendorf","year":"2003","unstructured":"Raussendorf, R., Browne, D.E., Briegel, H.J.: Measurement-based quantum computation on cluster states. Phys. Rev. A 68(2), 022312 (2003)","journal-title":"Phys. Rev. A"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04365-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-024-04365-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04365-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T15:20:16Z","timestamp":1731770416000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-024-04365-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,18]]},"references-count":47,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,4]]}},"alternative-id":["4365"],"URL":"https:\/\/doi.org\/10.1007\/s11128-024-04365-2","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,18]]},"assertion":[{"value":"25 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"153"}}