Joint Cutting for Hybrid Schrödinger-Feynman Simulation of Quantum Circuits
Despite the continuous advancements in size and robustness of real quantum devices, reliable large-scale quantum computers are not yet available. Hence, classical simulation of quantum algorithms remains crucial for testing new methods and estimating quantum advantage. Pushing classical simulation m...
Saved in:
| Published in: | 2025 62nd ACM/IEEE Design Automation Conference (DAC) pp. 1 - 7 |
|---|---|
| Main Authors: | , , , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
22.06.2025
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Despite the continuous advancements in size and robustness of real quantum devices, reliable large-scale quantum computers are not yet available. Hence, classical simulation of quantum algorithms remains crucial for testing new methods and estimating quantum advantage. Pushing classical simulation methods to their limit is essential, particularly due to their inherent exponential complexity. Besides the established Schrödinger-style full statevector simulation, so-called Hybrid Schrödinger-Feynman (HSF) approaches have shown promise to make simulations more efficient. HSF simulation employs the idea of "cutting" the circuit into smaller parts, reducing their execution times. This, however, comes at the cost of an exponential overhead in the number of cuts. Inspired by the domain of Quantum Circuit Cutting, we propose an HSF simulation method based on the idea of "joint cutting" to significantly reduce the aforementioned overhead. This means that, prior to the cutting procedure, gates are collected into "blocks" and all gates in a block are jointly cut instead of individually. We investigate how the proposed refinement can help decrease simulation times and highlight the remaining challenges. Experimental evaluations show that "joint cutting" can outperform the standard HSF simulation by up to a factor \approx 4000 \times and the Schrödinger-style simulation by a factor \approx 200 \times for suitable instances. The implementation is available at https://github.com/cda-tum/mqt-qsim-joint-cutting. |
|---|---|
| AbstractList | Despite the continuous advancements in size and robustness of real quantum devices, reliable large-scale quantum computers are not yet available. Hence, classical simulation of quantum algorithms remains crucial for testing new methods and estimating quantum advantage. Pushing classical simulation methods to their limit is essential, particularly due to their inherent exponential complexity. Besides the established Schrödinger-style full statevector simulation, so-called Hybrid Schrödinger-Feynman (HSF) approaches have shown promise to make simulations more efficient. HSF simulation employs the idea of "cutting" the circuit into smaller parts, reducing their execution times. This, however, comes at the cost of an exponential overhead in the number of cuts. Inspired by the domain of Quantum Circuit Cutting, we propose an HSF simulation method based on the idea of "joint cutting" to significantly reduce the aforementioned overhead. This means that, prior to the cutting procedure, gates are collected into "blocks" and all gates in a block are jointly cut instead of individually. We investigate how the proposed refinement can help decrease simulation times and highlight the remaining challenges. Experimental evaluations show that "joint cutting" can outperform the standard HSF simulation by up to a factor \approx 4000 \times and the Schrödinger-style simulation by a factor \approx 200 \times for suitable instances. The implementation is available at https://github.com/cda-tum/mqt-qsim-joint-cutting. |
| Author | Burgholzer, Lukas Ufrecht, Christian Wille, Robert Scherer, Daniel D. Herzog, Laura S. |
| Author_xml | – sequence: 1 givenname: Laura S. surname: Herzog fullname: Herzog, Laura S. organization: Technical University of Munich,Chair for Design Automation,Germany – sequence: 2 givenname: Lukas surname: Burgholzer fullname: Burgholzer, Lukas organization: Technical University of Munich,Chair for Design Automation,Germany – sequence: 3 givenname: Christian surname: Ufrecht fullname: Ufrecht, Christian organization: Fraunhofer Institute for Integrated Circuits IIS,Nuremberg,Germany – sequence: 4 givenname: Daniel D. surname: Scherer fullname: Scherer, Daniel D. organization: Fraunhofer Institute for Integrated Circuits IIS,Nuremberg,Germany – sequence: 5 givenname: Robert surname: Wille fullname: Wille, Robert organization: Technical University of Munich,Chair for Design Automation,Germany |
| BookMark | eNo1j01KAzEYQCPoQmtvIJILTP2SbzJNlmW0VhkQqa5LfjXQyUiaWczFvIAXs1BdPXiLB--KnKcheUJuGSwYA3V3v2oblLVacODiqBgil8szMldLJRGZAIRaXpLueYip0HYsJaYPGoZMN5PJ0dGt_cw_3-5ofa7Wfkq9TnQb-3GvSxwSHQJ9HXUqY0_bmO0Yy-GaXAS9P_j5H2fkff3w1m6q7uXxqV11lWZLVSqrnbVBOKOaGhvnWAjOQMMhOAbeKtDKaQBhpAEnkfsmcOUUxzoIIzTijNycutF7v_vKsdd52v1P4i8Mwk3j |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/DAC63849.2025.11133287 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Xplore IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library (IEL) (UW System Shared) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9798331503048 |
| EndPage | 7 |
| ExternalDocumentID | 11133287 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IH CBEJK RIE RIO |
| ID | FETCH-LOGICAL-a179t-cadccf5db96436dd1ffdb0620fd10ec90a9da005b8b0d832e6f29d9234f5b5a33 |
| IEDL.DBID | RIE |
| IngestDate | Wed Oct 01 07:05:15 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a179t-cadccf5db96436dd1ffdb0620fd10ec90a9da005b8b0d832e6f29d9234f5b5a33 |
| PageCount | 7 |
| ParticipantIDs | ieee_primary_11133287 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-June-22 |
| PublicationDateYYYYMMDD | 2025-06-22 |
| PublicationDate_xml | – month: 06 year: 2025 text: 2025-June-22 day: 22 |
| PublicationDecade | 2020 |
| PublicationTitle | 2025 62nd ACM/IEEE Design Automation Conference (DAC) |
| PublicationTitleAbbrev | DAC |
| PublicationYear | 2025 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 2.2952647 |
| Snippet | Despite the continuous advancements in size and robustness of real quantum devices, reliable large-scale quantum computers are not yet available. Hence,... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | circuit cutting classical simulation Design automation hybrid Schrödinger-Feynman joint cutting Logic gates Quantum advantage Quantum algorithm Quantum circuit quantum computing Qubit Robustness Shape Testing |
| Title | Joint Cutting for Hybrid Schrödinger-Feynman Simulation of Quantum Circuits |
| URI | https://ieeexplore.ieee.org/document/11133287 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LSgMxFA1WXLhSseKbLNymzWQyr6WMliJSKlXoruRxg7PojExnhP6YP-CPmaRTxYULdyEEEk5yySG55x6EbmJlaS5wSZjlRIQnAERmYUxAURPKQBolpDebSCaTdD7Ppp1Y3WthAMAnn8HANf1fvq5U657Khs4WPbQUv4d6SRJvxFqd6jeg2fDuNreniTv5CYsG28G_bFP8rTE6-Od8h6j_o7_D0--b5QjtQHmMHh-qomxw3vpMZWzJJh6vnd4Kz9Rr_fmhNw90I1iXS1HiWbHsnLlwZfBTaxFslzgvatUWzaqPXkb3z_mYdF4IRNiQaYgSWikTaenqZ8VaB8ZoSWNGjQ4oqIyKTAsbUTKVVNsohdiwTFv2xk0kIxGGJ2i3rEo4RZgndvkqlcC44AA8NYFOE4sZBVdOkJ6hvoNi8bYpd7HYonD-R_8F2neAu_wpxi7RblO3cIX21HtTrOprv0lfcA2XIQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LSgMxFA1aBV2pWPFtFm6nzWQyr6WMlqq1VFqhu5LHDc6iMzKdEfpj_oA_ZjKdKi5cuAshkHCSSw7JPfcgdB1IQ3OBCYcaTuSwEMARsRc4IIn2hCu05KI2mwiHw2g6jUeNWL3WwgBAnXwGHdus__JVLiv7VNa1tuieofibaMtnjJKVXKvR_bok7t7eJOY8MStAoX5nPfyXcUp9b_T2_jnjPmr_KPDw6PtuOUAbkB2iwUOeZiVOqjpXGRu6iftLq7jCY_lafH6o1RNdD5bZnGd4nM4bby6ca_xcGQyrOU7SQlZpuWijl97dJOk7jRuCw03QlI7kSkrtK2EraAVKuVorQQJKtHIJyJjwWHETUyISRJk4hUDTWBn-xrQvfO55R6iV5RkcI8xCs3wZCaCMMwAWaVdFocGMgC0oSE5Q20Ixe1sVvJitUTj9o_8K7fQnT4PZ4H74eIZ2Lfg2m4rSc9Qqiwou0LZ8L9NFcVlv2Bd6vppo |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2025+62nd+ACM%2FIEEE+Design+Automation+Conference+%28DAC%29&rft.atitle=Joint+Cutting+for+Hybrid+Schr%C3%B6dinger-Feynman+Simulation+of+Quantum+Circuits&rft.au=Herzog%2C+Laura+S.&rft.au=Burgholzer%2C+Lukas&rft.au=Ufrecht%2C+Christian&rft.au=Scherer%2C+Daniel+D.&rft.date=2025-06-22&rft.pub=IEEE&rft.spage=1&rft.epage=7&rft_id=info:doi/10.1109%2FDAC63849.2025.11133287&rft.externalDocID=11133287 |