Decomposition of Multi-Qubit Gates for Circuit Cutting

arXiv:2603.2627858.2h-index: 5
AI Analysis

This work addresses a bottleneck in scalable quantum computing for researchers and engineers by offering an incremental improvement to reduce resource costs in circuit cutting.

The paper tackles the problem of high sampling overhead in quantum circuit cutting by proposing a modified decomposition strategy for multi-qubit gates, demonstrating that it effectively reduces the overhead using MCX and CCCX gates as examples.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes