Decomposition of Multi-Qubit Gates for Circuit Cutting

• URL: http://arxiv.org/abs/2603.26278v1
• Date: Fri, 27 Mar 2026 10:45:12 GMT
• Title: Decomposition of Multi-Qubit Gates for Circuit Cutting
• Abstract summary: 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.<n>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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Mitigating crosstalk errors for simultaneous single-qubit gates on a superconducting quantum processor [59.06950309601253]
  Single-qubit gates on superconducting quantum processors are typically implemented using microwave pulses applied through dedicated control lines.<n>These microwave pulses may also drive other qubits due to crosstalk arising from capacitive coupling and wavefunction overlap.<n>Crosstalk and frequency crowding increase errors during simultaneous single-qubit operations relative to isolated gates.
  arXiv  Detail & Related papers  (2026-03-11T17:47:32Z)
• Accelerating Transpilation in Quantum Machine Learning with Haiqu's Rivet-transpiler [45.88028371034407]
  We develop the Rivet transpiler, which accelerates transpilation by reusing previously transpiled circuits.<n>We demonstrate up to 600% improvement in transpilation time for quantum layerwise learning.
  arXiv  Detail & Related papers  (2025-08-29T06:00:29Z)
• Multilevel Circuit Optimization in Quantum Compilers: A Case Study [0.6954287924634025]
  We explore multilevel circuit optimization (MLCO), where we deploy multiple gate sets and progressively lower the source circuit through the gate sets to the target circuit.<n>We demonstrate its effectiveness, using as a case study the source circuit for Hamiltonian simulation to solve a partial differential equation.<n>MLCO makes visible higher-level circuit structures, providing us with insights about how to simplify the circuits and how to decompose the gates.
  arXiv  Detail & Related papers  (2025-05-14T12:19:17Z)
• Bridging wire and gate cutting with ZX-calculus [45.200826131319815]
  We show how decompositions of ideal, global unitaries can be obtained diagrammatically using ZX-calculus expanding.<n>We obtain improved decompositions for multi-qubit controlled-Z (MCZ) gates with $1$-norm equal to $3$ for any number of qubits and any partition.
  arXiv  Detail & Related papers  (2025-03-14T15:20:47Z)
• Optimization Driven Quantum Circuit Reduction [20.697821016522358]
  We propose three different transpilation approaches to substantially reduce circuit lengths without affecting functionality.<n>The first variant is based on a search scheme, and the other variants are driven by a database retrieval scheme and a machine learning based decision support.<n>We show that our proposed methods generate short quantum circuits for restricted gate sets, superior to the typical results obtained by using different qiskit optimization levels.
  arXiv  Detail & Related papers  (2025-02-20T16:41:10Z)
• Efficient Circuit Wire Cutting Based on Commuting Groups [8.60732674633629]
  Current quantum devices face challenges when dealing with large circuits due to error rates as circuit size and the number of qubits increase. circuit wire-cutting technique addresses this issue by breaking down a large circuit into smaller, more manageable subcircuits. Inspired by ancilla-assisted quantum process tomography and the MUBs-based grouping technique for simultaneous measurement, we propose a new approach that can reduce subcircuit running overhead.
  arXiv  Detail & Related papers  (2024-10-27T02:40:00Z)
• Multi-qubit Lattice Surgery Scheduling [3.7126786554865774]
  A quantum circuit can be transpiled into a sequence of solely non-Clifford multi-qubit gates. We show that the transpilation significantly reduces the circuit length on the set of circuits tested. The resulting circuit of multi-qubit gates has a further reduction in the expected circuit execution time compared to serial execution.
  arXiv  Detail & Related papers  (2024-05-27T22:41:41Z)
• Cutting a Wire with Non-Maximally Entangled States [39.79428554301806]
  Circuit cutting techniques enable the distribution of quantum computations via classical communication. Quantum teleportation allows the distribution of quantum computations without an exponential increase in circuit executions. We present a wire cutting technique employing pure non-maximally entangled states that achieves this optimal sampling overhead.
  arXiv  Detail & Related papers  (2024-02-13T14:12:06Z)
• Linear decomposition of approximate multi-controlled single qubit gates [0.8520624117635328]
  We provide a method for compiling approximate multi-controlled single qubit gates into quantum circuits without ancilla qubits. The total number of elementary gates to decompose an n-qubit multi-controlled gate is proportional to 32n.
  arXiv  Detail & Related papers  (2023-10-23T14:23:08Z)
• Circuit Cutting with Non-Maximally Entangled States [59.11160990637615]
  Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices. circuit cutting techniques enable the distribution of quantum computations through classical communication. Quantum teleportation allows the distribution of quantum computations without an exponential increase in shots. We propose a novel circuit cutting technique that leverages non-maximally entangled qubit pairs.
  arXiv  Detail & Related papers  (2023-06-21T08:03:34Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.