{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T20:54:11Z","timestamp":1782161651505,"version":"3.54.5"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032299208","type":"print"},{"value":"9783032299215","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-29921-5_4","type":"book-chapter","created":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T20:21:11Z","timestamp":1782159671000},"page":"48-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Not Your Usual FFT: QFT$$\\rightarrow $$FFT via\u00a0Classical Quantum-Circuit Simulation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0639-0639","authenticated-orcid":false,"given":"Stefano","family":"Markidis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9479-7393","authenticated-orcid":false,"given":"Gilbert","family":"Netzer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4901-1716","authenticated-orcid":false,"given":"Luca","family":"Pennati","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8574-2021","authenticated-orcid":false,"given":"Frej","family":"Larssen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4158-3583","authenticated-orcid":false,"given":"Ivy","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,23]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Alessio, S.M.: Digital signal processing and spectral analysis for scientists: concepts and applications, Springer (2015)","DOI":"10.1007\/978-3-319-25468-5"},{"key":"4_CR2","unstructured":"Asadi, A., et al.: Hybrid quantum programming with Pennylane lightning on HPC platforms. arXiv preprint arXiv:2403.02512 (2024)"},{"issue":"8","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-020-02776-5","volume":"19","author":"R Asaka","year":"2020","unstructured":"Asaka, R., Sakai, K., Yahagi, R.: Quantum circuit for the fast Fourier transform. Quantum Inf. Process. 19(8), 1\u201320 (2020). https:\/\/doi.org\/10.1007\/s11128-020-02776-5","journal-title":"Quantum Inf. Process."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Ayala, A., et al.: heFFTe: Highly efficient FFT for exascale. In: International Conference on Computational Science, pp. 262\u2013275. Springer (2020)","DOI":"10.1007\/978-3-030-50371-0_19"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Bayraktar, H., et al.: CuQuantum SDK: a high-performance library for accelerating quantum science. In: 2023 IEEE International Conference on Quantum Computing and Engineering (QCE). vol. 1, pp. 1050\u20131061. IEEE (2023)","DOI":"10.1109\/QCE57702.2023.00119"},{"key":"4_CR6","unstructured":"Berezutskii, A., et al.: Tensor networks for quantum computing. Nat. Rev. Phy. 1\u201313 (2025)"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2331","volume":"28","author":"D Camps","year":"2021","unstructured":"Camps, D., et al.: Quantum Fourier transform revisited. Numerical Linear Algebra Appl. 28(1), e2331 (2021)","journal-title":"Numerical Linear Algebra Appl."},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.4.040318","volume":"4","author":"J Chen","year":"2023","unstructured":"Chen, J., et al.: Quantum Fourier transform has small entanglement. PRX Quantum 4(4), 040318 (2023)","journal-title":"PRX Quantum"},{"key":"4_CR9","unstructured":"Coppersmith, D.: An approximate Fourier transform useful in quantum factoring. arXiv preprint quant-ph\/0201067 (2002)"},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/abaa2c","volume":"5","author":"PM Cruz","year":"2020","unstructured":"Cruz, P.M., et al.: Optimizing quantum phase estimation for the simulation of Hamiltonian eigenstates. Quantum Sci. Technol. 5(4), 044005 (2020)","journal-title":"Quantum Sci. Technol."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Ekert, A., Jozsa, R.: Quantum algorithms: entanglement\u2013enhanced information processing. Philosophical Trans. Roy. Soc. London. Series A: Math. Phy. Eng. Sci. 356(1743), 1769\u20131782 (1998)","DOI":"10.1098\/rsta.1998.0248"},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/JPROC.2004.840491","volume":"93","author":"F Franchetti","year":"2005","unstructured":"Franchetti, F., et al.: Efficient utilization of SIMD extensions. Proc. IEEE 93(2), 409\u2013425 (2005)","journal-title":"Proc. IEEE"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Franchetti, F., et al.: FFT program generation for shared memory: SMP and multicore. In: SC \u20192006: Proceedings of the 2006 ACM\/IEEE Conference on Supercomputing. ACM (2006)","DOI":"10.1109\/SC.2006.31"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Franchetti, F., Puschel, M.: Short vector code generation for the discrete Fourier transform. In: Proceedings International Parallel and Distributed Processing Symposium, pp. 10\u2013pp. IEEE (2003)","DOI":"10.1109\/IPDPS.2003.1213153"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Franchetti, F., P\u00fcschel, M.: FFT (fast Fourier transform). In: Encyclopedia of Parallel Computing, pp. 658\u2013671. Springer (2011)","DOI":"10.1007\/978-0-387-09766-4_243"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Frigo, M., Johnson, S.G.: FFTW: An adaptive software architecture for the FFT. In: Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP\u20191998 (Cat. No. 98CH36181). vol. 3, pp. 1381\u20131384. IEEE (1998)","DOI":"10.1109\/ICASSP.1998.681704"},{"key":"4_CR17","unstructured":"Gholami, A., et al.: AccFFT: a library for distributed-memory FFT on CPU and GPU architectures. arXiv preprint arXiv:1506.07933 (2015)"},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8505","volume":"5","author":"GG Guerreschi","year":"2020","unstructured":"Guerreschi, G.G., et al.: Intel quantum simulator: a cloud-ready high-performance simulator of quantum circuits. Quantum Sci. Technol. 5(3), 034007 (2020)","journal-title":"Quantum Sci. Technol."},{"issue":"5","key":"4_CR19","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/3571725","volume":"66","author":"T Hoefler","year":"2023","unstructured":"Hoefler, T., et al.: Disentangling hype from practicality: on realistically achieving quantum advantage. Commun. ACM 66(5), 82\u201387 (2023)","journal-title":"Commun. ACM"},{"key":"4_CR20","unstructured":"Isakov, S.V., et al.: Simulations of quantum circuits with approximate noise using qsim and Cirq. arXiv preprint arXiv:2111.02396 (2021)"},{"issue":"3","key":"4_CR21","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ad42ce","volume":"9","author":"N Jain","year":"2024","unstructured":"Jain, N., et al.: Quantum Fourier networks for solving parametric PDEs. Quantum Sci. Technol. 9(3), 035026 (2024)","journal-title":"Quantum Sci. Technol."},{"issue":"1","key":"4_CR22","doi-asserted-by":"publisher","first-page":"10736","DOI":"10.1038\/s41598-019-47174-9","volume":"9","author":"T Jones","year":"2019","unstructured":"Jones, T., et al.: QuEST and high performance simulation of quantum computers. Sci. Rep. 9(1), 10736 (2019)","journal-title":"Sci. Rep."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"K\u00f6pcke, B., et al.: Generating efficient FFT GPU code with lift. In: Proceedings of the 8th ACM SIGPLAN International Workshop on Functional High-Performance and Numerical Computing, pp. 1\u201313 (2019)","DOI":"10.1145\/3331553.3342613"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Li, B., et al.: TCFFT: a fast half-precision FFT library for NVIDIA tensor cores. In: 2021 IEEE International Conference on Cluster Computing (CLUSTER), pp. 1\u201311. IEEE (2021)","DOI":"10.1109\/Cluster48925.2021.00035"},{"key":"4_CR25","unstructured":"Lin, F.X.: Shor\u2019s algorithm and the quantum Fourier transform. McGill University (2014)"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Markidis, S.: What is quantum parallelism, anyhow? In: ISC High Performance 2024 Research Paper Proceedings (39th International Conference), pp. 1\u201312. Prometeus GmbH (2024)","DOI":"10.23919\/ISC.2024.10528926"},{"issue":"6","key":"4_CR27","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1109\/MCSE.2020.3023979","volume":"22","author":"DR Musk","year":"2020","unstructured":"Musk, D.R.: A comparison of quantum and traditional Fourier transform computations. Comput. Sci. Eng. 22(6), 103\u2013110 (2020)","journal-title":"Comput. Sci. Eng."},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1038\/s41534-020-0257-5","volume":"6","author":"Y Nam","year":"2020","unstructured":"Nam, Y., et al.: Approximate quantum Fourier transform with o (n log (n)) T gates. NPJ Quan. Inf. 6(1), 26 (2020)","journal-title":"NPJ Quan. Inf."},{"issue":"1","key":"4_CR29","first-page":"1","volume":"4","author":"T Nguyen","year":"2022","unstructured":"Nguyen, T., et al.: Tensor network quantum virtual machine for simulating quantum circuits at exascale. ACM Trans. Quan. Comput. 4(1), 1\u201321 (2022)","journal-title":"ACM Trans. Quan. Comput."},{"key":"4_CR30","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum computation and quantum information. Cambridge university press (2010)"},{"issue":"4","key":"4_CR31","doi-asserted-by":"publisher","first-page":"C192","DOI":"10.1137\/11082748X","volume":"34","author":"D Pekurovsky","year":"2012","unstructured":"Pekurovsky, D.: P3dfft: a framework for parallel computations of Fourier transforms in three dimensions. SIAM J. Sci. Comput. 34(4), C192\u2013C209 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"4_CR32","unstructured":"Rudiak-Gould, B.: The sum-over-histories formulation of quantum computing. arXiv preprint quant-ph\/0607151 (2006)"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Van Loan, C.: Computational frameworks for the fast Fourier transform. SIAM (1992)","DOI":"10.1137\/1.9781611970999"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Wang, E.: Intel math kernel library. In: High-Performance Computing on the Intel\u00ae Xeon Phi: How to Fully Exploit MIC Architectures, pp. 167\u2013188. Springer (2014)","DOI":"10.1007\/978-3-319-06486-4_7"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-29921-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T20:21:21Z","timestamp":1782159681000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-29921-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032299208","9783032299215"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-29921-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"23 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hamburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}