Cutting circuits with multiple two-qubit unitaries

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.

Authors

Institutions

Publication Details

Journal
Quantum
Published
2025-02-18
DOI
https://doi.org/10.22331/q-2025-02-18-1634
Citations
8
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
19.85

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Cutting circuits with multiple two-qubit unitaries

David Sutter, Lukas Schmitt, Christophe Piveteau
8 citations
Quantum
Quantum Computing Algorithms and Architecture
19.85
article

Cutting circuits with multiple two-qubit unitaries

David Sutter, Lukas Schmitt, Christophe Piveteau
article en
8 citations

Abstract

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.

QuantumVol. 9
ETH Zurich (CH), Instituto de Física Teórica (ES), IBM Research - Zurich (CH)
National Science Foundation, National Centres of Competence in Research SwissMAP, Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
Openalex Percentile: Top 1%
Quantum Computing Algorithms and Architecture
19.85
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Cutting circuits with multiple two-qubit unitaries — David Sutter, Lukas Schmitt, et al. · Quantum (2025) | TGRS Research Map | TGRS