{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T16:04:22Z","timestamp":1780589062510,"version":"3.54.1"},"reference-count":17,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:00:00Z","timestamp":1739836800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"<jats:p>Quasiprobabilistic cutting techniques allow us to partition large quantum circuits into smaller subcircuits by replacing non-local gates with probabilistic mixtures of local gates. The cost of this method is a sampling overhead that scales exponentially in the number of cuts. It is crucial to determine the minimal cost for gate cutting and to understand whether allowing for classical communication between subcircuits can improve the sampling overhead. In this work, we derive a closed formula for the optimal sampling overhead for cutting an arbitrary number of two-qubit unitaries and provide the corresponding decomposition. We find that cutting several arbitrary two-qubit unitaries together is cheaper than cutting them individually and classical communication does not give any advantage.<\/jats:p>","DOI":"10.22331\/q-2025-02-18-1634","type":"journal-article","created":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T16:00:49Z","timestamp":1739894449000},"page":"1634","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":10,"title":["Cutting circuits with multiple two-qubit unitaries"],"prefix":"10.22331","volume":"9","author":[{"given":"Lukas","family":"Schmitt","sequence":"first","affiliation":[{"name":"Institute for Theoretical Physics, ETH ZurichIBM Quantum"},{"name":"IBM Research Europe \u2013 Zurich"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christophe","family":"Piveteau","sequence":"additional","affiliation":[{"name":"Institute for Theoretical Physics, ETH ZurichIBM Quantum"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Sutter","sequence":"additional","affiliation":[{"name":"IBM Research Europe \u2013 Zurich"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"9598","published-online":{"date-parts":[[2025,2,18]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"K. Mitarai and K. Fujii. Constructing a virtual two-qubit gate by sampling single-qubit operations. New Journal of Physics, 23(2):023021, 2021. DOI: 10.1088\/1367-2630\/abd7bc.","DOI":"10.1088\/1367-2630\/abd7bc"},{"key":"1","doi-asserted-by":"publisher","unstructured":"K. Mitarai and K. Fujii. Overhead for simulating a non-local channel with local channels by quasiprobability sampling. Quantum, 5:388, 2021. DOI: 10.22331\/q-2021-01-28-388.","DOI":"10.22331\/q-2021-01-28-388"},{"key":"2","doi-asserted-by":"publisher","unstructured":"C. Piveteau and D. Sutter. Circuit knitting with classical communication. IEEE Transactions on Information Theory, pages 1\u20131, 2023. DOI: 10.1109\/TIT.2023.3310797.","DOI":"10.1109\/TIT.2023.3310797"},{"key":"3","doi-asserted-by":"publisher","unstructured":"T. Peng, A. W. Harrow, M. Ozols, and X. Wu. Simulating large quantum circuits on a small quantum computer. Phys. Rev. Lett., 125:150504, 2020. DOI: 10.1103\/PhysRevLett.125.150504.","DOI":"10.1103\/PhysRevLett.125.150504"},{"key":"4","unstructured":"L. Brenner, C. Piveteau, and D. Sutter. Optimal wire cutting with classical communication, 2023. Available online: https:\/\/arxiv.org\/abs\/2302.03366."},{"key":"5","doi-asserted-by":"publisher","unstructured":"H. Harada, K. Wada, and N. Yamamoto. Doubly optimal parallel wire cutting without ancilla qubits. PRX Quantum, 5:040308, 2024. DOI: 10.1103\/PRXQuantum.5.040308.","DOI":"10.1103\/PRXQuantum.5.040308"},{"key":"6","unstructured":"E. Pednault. An alternative approach to optimal wire cutting without ancilla qubits, 2023. Available online: https:\/\/arxiv.org\/abs\/2303.08287."},{"key":"7","doi-asserted-by":"publisher","unstructured":"A. Lowe, M. Medvidovi\u0107, A. Hayes, L. J. O&apos;Riordan, T. R. Bromley, J. M. Arrazola, and N. Killoran. Fast quantum circuit cutting with randomized measurements. Quantum, 7:934, 2023. DOI: 10.22331\/q-2023-03-02-934.","DOI":"10.22331\/q-2023-03-02-934"},{"key":"8","doi-asserted-by":"publisher","unstructured":"K. Temme, S. Bravyi, and J. M. Gambetta. Error mitigation for short-depth quantum circuits. Phys. Rev. Lett., 119:180509, 2017. DOI: 10.1103\/PhysRevLett.119.180509.","DOI":"10.1103\/PhysRevLett.119.180509"},{"key":"9","doi-asserted-by":"publisher","unstructured":"S. Endo, S. C. Benjamin, and Y. Li. Practical quantum error mitigation for near-future applications. Phys. Rev. X, 8:031027, 2018. DOI: 10.1103\/PhysRevX.8.031027.","DOI":"10.1103\/PhysRevX.8.031027"},{"key":"10","doi-asserted-by":"publisher","unstructured":"C. Piveteau. Advanced methods for quasiprobabilistic quantum error mitigation. DOI: 10.3929\/ethz-b-000504508. Master thesis, ETH Zurich, September 2020.","DOI":"10.3929\/ethz-b-000504508"},{"key":"11","unstructured":"X. Zhao, L. Zhang, B. Zhao, and X. Wang. Power of quantum measurement in simulating unphysical operations, 2023. Available online: https:\/\/arxiv.org\/abs\/2309.09963."},{"key":"12","doi-asserted-by":"publisher","unstructured":"E. Chitambar, D. Leung, L. Man\u010dinska, M. Ozols, and A. Winter. Everything you always wanted to know about LOCC (but were afraid to ask). Communications in Mathematical Physics, 328(1):303\u2013326, 2014. DOI: 10.1007\/s00220-014-1953-9.","DOI":"10.1007\/s00220-014-1953-9"},{"key":"13","doi-asserted-by":"publisher","unstructured":"N. Khaneja and S. J. Glaser. Cartan decomposition of su(2n) and control of spin systems. Chemical Physics, 267(1):11\u201323, 2001. DOI: https:\/\/doi.org\/10.1016\/S0301-0104(01)00318-4.","DOI":"10.1016\/S0301-0104(01)00318-4"},{"key":"14","doi-asserted-by":"publisher","unstructured":"S. Bravyi, G. Smith, and J. A. Smolin. Trading classical and quantum computational resources. Phys. Rev. X, 6:021043, 2016. DOI: 10.1103\/PhysRevX.6.021043.","DOI":"10.1103\/PhysRevX.6.021043"},{"key":"15","doi-asserted-by":"publisher","unstructured":"C. Ufrecht, L. S. Herzog, D. D. Scherer, M. Periyasamy, S. Rietsch, A. Plinge, and C. Mutschler. Optimal joint cutting of two-qubit rotation gates. Phys. Rev. A, 109:052440, 2024. DOI: 10.1103\/PhysRevA.109.052440.","DOI":"10.1103\/PhysRevA.109.052440"},{"key":"16","doi-asserted-by":"publisher","unstructured":"A. W. Harrow and A. Lowe. Optimal quantum circuit cuts with application to clustered Hamiltonian simulation. PRX Quantum, 6:010316, 2025. DOI: 10.1103\/PRXQuantum.6.010316.","DOI":"10.1103\/PRXQuantum.6.010316"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2025-02-18-1634\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T16:00:57Z","timestamp":1739894457000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2025-02-18-1634\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,18]]},"references-count":17,"URL":"https:\/\/doi.org\/10.22331\/q-2025-02-18-1634","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,18]]},"article-number":"1634"}}