Quantum 2025 – scientific programme
Parts | Days | Selection | Search | Updates | Downloads | Help
MON: Monday Contributed Sessions
MON 18: Quantum Algorithms
MON 18.4: Talk
Monday, September 8, 2025, 17:15–17:30, ZHG007
Bridging wire and gate cutting with ZX-calculus — •Marco Schumann1,2, Tobias Stollenwerk1, and Alessandro Ciani1 — 1Forschungszentrum Jülich GmbH, Peter Grünberg Institute, Quantum Computing Analytics (PGI-12), 52425 Jülich, Germany — 2Theor. Physics, Saarland University, 66123 Saarbrücken, Germany
Wire cuts and gate cuts allow one to reduce the required number of qubits for evaluating expectation values of the output states of quantum circuits. This comes at the price of a sampling overhead. While throughout the literature, wire and gate cutting are mostly seen as two independent methods for circuit cutting, our contribution in this work [1] is to establish a connection between them. We find that, since in ZX-calculus only connectivity matters, many known gate cuts can be obtained by cutting wires in these gates. Furthermore, we obtain a decomposition of the multi-qubit controlled-Z gate with decreased sampling overhead. Our work gives new ways of thinking about circuit cutting that can be particularly valuable for finding decompositions of large unitary gates. Besides, it sheds light on the question of why exploiting classical communication decreases the sampling overhead of a wire cut but does not do so for certain gate decompositions. In particular, using wire cuts with classical communication, we obtain gate decompositions that do not require classical communication.
[1] M. Schumann, T. Stollenwerk, A. Ciani, Bridging wire and gate cutting with ZX-calculus (2025). arXiv: 2503.11494.
[2] C. Ufrecht et al., Cutting multi-control quantum gates with zx calculus, Quantum 7, 1147 (2023).
Keywords: Quantum computing; Circuit cutting; ZX-calculus