Decomposition of Multi-Qubit Gates for Circuit Cutting
Summarize this article with:
Quantum Physics arXiv:2603.26278 (quant-ph) [Submitted on 27 Mar 2026] Title:Decomposition of Multi-Qubit Gates for Circuit Cutting Authors:Ryota Tamura, Tomoya Kashimata, Yohei Hamakawa, Kosuke Tatsumura, Hiroshi Imai View a PDF of the paper titled Decomposition of Multi-Qubit Gates for Circuit Cutting, by Ryota Tamura and 4 other authors View PDF HTML (experimental) Abstract:A large-scale quantum circuit can be partitioned into multiple subcircuits through circuit cutting, where each subcircuit is executed multiple times and the expectation value of the original circuit is reconstructed by classical post-processing from their measurement (sampling) results. In this process, appropriate cut locations are identified after the user-designed quantum circuit, including multi-qubit gates that act on three or more qubits, has been decomposed into single-qubit gates and two-qubit gates such as the CNOT gate. Here, we present a method for reducing the sampling overhead, which refers to the increase in the number of samples required due to the cutting process, by modifying the decomposition strategy of multi-qubit gates. Using MCX and CCCX gates as representatives of multi-qubit gates, we demonstrate that the proposed decomposition method, which introduces a small number of ancilla qubits according to the identified cut locations, effectively decreases the sampling overhead. Comments: Subjects: Quantum Physics (quant-ph); Emerging Technologies (cs.ET) Cite as: arXiv:2603.26278 [quant-ph] (or arXiv:2603.26278v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2603.26278 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Ryota Tamura [view email] [v1] Fri, 27 Mar 2026 10:45:12 UTC (1,767 KB) Full-text links: Access Paper: View a PDF of the paper titled Decomposition of Multi-Qubit Gates for Circuit Cutting, by Ryota Tamura and 4 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-03 Change to browse by: cs cs.ET References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)