Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum

Quantifying Performance of Wire-Based Quantum Circuit Cutting with Entanglements

Shiplu Sarker, Wenyang Qian, Soham Pal, Robert Basili, Mary Mehrnoosh Eshaghian‐Wilner, Ashfaq Khokhar, Glenn R. Luecke, James P. Vary

Published May 27, 2024• 2 citations
Publisher

Abstract

Circuit cutting is a promising technique for mapping a quantum circuit requiring many qubits to a series of circuits requiring fewer qubits. At the cost of a longer runtime, such a strategy can reduce qubit requirements and mitigate noise in currently available Noisy Intermediate-Scale Quantum (NISQ) devices where noise scales poorly with greater levels of entanglement. In this work, we investigate the performance of wire-based circuit cutting in cases of different levels of entanglement and forms of noise. As a broadly applicable starting point, we focus on cutting Hamiltonian-inspired quantum circuits with various entanglement strategies and circuit depths. We provide model calculations of these circuits before and after cutting, both in the ideal case and in the presence of noise, using quantum simulators with quantum noise models. We present a numerical analysis of the performance of circuit cutting using various metrics for comparing ideal and noisy model calculations. Our results indicate that the efficacy of circuit cutting is sensitive to the level of entanglements and is affected differently by incoherent quantum noises.

DOI
10.1109/ipdpsw63119.2024.00178

Related papers

Evaluating Quantum Wire Cutting for QAOA: Performance Benchmarks in Ideal and Noisy Environments

Michel Meulen, Niels M. P. Neumann, Jasper Verbree

Current quantum computers suffer from a limited number of qubits and high error rates, limiting practical applicability. Different techniques exist to mitigate these effects and run larger algorithms. In this work, we analyze one of these techniques called quantum circuit cutting. With circuit cutting, a quantum circuit is decomposed into smaller sub-circuits, each of which can be run on smaller quantum hardware. We compare the performance of quantum circuit cutting with different cutting strategies, and then apply circuit cutting to a QAOA algorithm. Using simulations, we first show that Randomized Clifford measurements outperform both Pauli and random unitary measurements. Second, we show that circuit cutting has trouble providing correct answers in noisy settings, especially as the number of circuits increases.

quant-pharXiv:2602.03482•Communications in computer and information science•Feb 4, 2026•1 citation

Reducing Maximum Subcircuits Depth in Quantum Circuit Cutting

Milad Eslaminia, Sébastien Le Beux

Noisy intermediate-scale quantum (NISQ) devices with limited qubit count and connectivity limit the scale of quantum circuits that can be executed. Circuit cutting methods simulate larger quantum computers by decomposing large circuits into small subcircuits that can be executed on NISQ hardware. Existing circuit cutting methods only consider the qubit count of the target hardware for finding the locations of cuts on the circuits. This can result in deeper subcircuits after mapping on the hardware. Fidelity decays exponentially with circuit depth and diminishes the quality of execution. We propose a circuit-cutting framework that reduces variance in the depth of subcircuits after mapping to the hardware. Our method formulates the initial circuit cutting as a multi-objective optimization problem based on an evolutionary search method with the number of cuts and the maximum depth of individual routed subcircuits as fitness objectives. This method is implemented as an extension to the existing Qiskit Circuit Cutting Addon, which allows for integration in existing flows. Our approach achieves reductions in routed subcircuit depth of up to 9.9% across benchmark circuits compared with baseline methods.

IEEE Transactions on Quantum Engineering•Jan 1, 2026•0 citations

Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices

Marvin Bechtold, Johanna Barzen, Frank Leymann +4 more

Abstract Noisy intermediate-scale quantum (NISQ) devices are restricted by their limited number of qubits and their short decoherence times. An approach addressing these problems is quantum circuit cutting. It decomposes the execution of a large quantum circuit into the execution of multiple smaller quantum circuits with additional classical postprocessing. Since these smaller quantum circuits require fewer qubits and gates, they are more suitable for NISQ devices. To investigate the effect of quantum circuit cutting in a quantum algorithm targeting NISQ devices, we design two experiments using the quantum approximate optimization algorithm (QAOA) for the Maximum Cut (MaxCut) problem and conduct them on state-of-the-art superconducting devices. Our first experiment studies the influence of circuit cutting on the objective function of QAOA, and the second evaluates the quality of results obtained by the whole algorithm with circuit cutting. The results show that circuit cutting can reduce the effects of noise in QAOA, and therefore, the algorithm yields better solutions on NISQ devices.

arXiv:2302.01792•Quantum Science and Technology•Aug 31, 2023•45 citations

Cutting a Wire with Non-Maximally Entangled States

Marvin Bechtold, Johanna Barzen, Frank Leymann +1 more

Distributed quantum computing supports combining the computational power of multiple quantum devices to overcome the limitations of individual devices. Circuit cutting techniques enable the distribution of quantum computations via classical communication. These techniques involve partitioning a quantum circuit into smaller subcircuits, each containing fewer qubits. The original circuit's outcome can be replicated by executing these sub circuits on separate devices and combining their results. However, the number of circuit executions required to achieve a fixed result accuracy with circuit cutting grows exponentially with the number of cuts, posing significant costs. In contrast, quantum teleportation allows the distribution of quantum computations without an exponential increase in circuit executions. Nevertheless, each teleportation requires a pre-shared pair of maximally entangled qubits for transmitting a quantum state, and non-maximally entangled qubits cannot be used for this purpose. Addressing this, our work explores utilizing non-maximally entangled qubit pairs in wire cutting, a specific form of circuit cutting, to mitigate the associated costs. The cost of this cutting procedure reduces with the increasing degree of entanglement in the pre-shared qubit pairs. We derive the optimal sampling overhead in this context and present a wire cutting technique employing pure non-maximally entangled states that achieves this optimal sampling overhead. Hence, this offers a continuum between existing wire cutting and quantum teleportation.

arXiv:2403.09690•IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum•May 27, 2024•10 citations

A Comparative Study of Quantum Circuit Mapping Techniques for NISQ Devices

You-Seok Lee, Jongheon Lee, Yousung Kang

Noisy Intermediate-Scale Quantum (NISQ) computers impose severe architectural constraints that prevent direct execution of logical quantum circuits. As a result, quantum circuit mapping—transforming ideal circuits into hardware-compatible forms—has become a critical task in quantum software toolchains. This paper presents a comparative study of key mapping techniques, focusing on circuit depth, SWAP gate overhead, and fidelity awareness. Through a case analysis on a 5-qubit Quantum Fourier Transform (QFT) circuit, we demonstrate the performance trade-offs of several prominent mapping strategies, including naive greedy routing, Qiskit’s SABRE, and CQC’s t|ket>. Our findings reveal that mapping technique selection has a profound impact on circuit quality and feasibility on real NISQ hardware.

International Conference on Information and Communication Technology Convergence (ICTC)•Oct 14, 2025•1 citation

Entanglement Dynamics in Noisy Intermediate-Scale Quantum Systems

Dr. Ruman Singh

The advent of noisy intermediate-scale quantum (NISQ) devices has not only opened up new possibilities to studying quantum computational benefits, but it has also presented new challenges associated with noise and short coherence times. Entanglement is one of the inherent resources that can be used to perform quantum computation and implement the performance and reliability of quantum algorithms. This paper looks at entanglement dynamics in NISQ machines subjected to natural noises. The study focuses on the problem of examining the role of various noise channels in the creation, dynamics, and decay of the entanglement during quantum operations, such as depolarizing, amplitude damping, and phase damping. The study is based on theoretical modeling and numerical simulations of multi-qubit quantum circuits to determine the stability of entangled states with respect to circuit depth and intensity of noise. Concurrence and von Neumann entropy are examples of entanglement measures that are used to characterize correlations between qubits as well as to trace the dynamics of these correlations across computational interactions. The results show that noise has major impacts on entanglement distribution, which tends to cause rapid decays in highly entangled states with increase in circuit complexity. The findings, however, also show that there are some circuit architectures and error-mitigation schemes that can somewhat sustain entanglement with moderate levels of noise. The paper also emphasizes the relevance of minimalizing sequence of gates, and reduced circuit depth in an effort to preserve useful entanglement in present-day quantum hardware. These observations help in understanding the behaviour of quantum correlations better in real world quantum devices and provide a way of developing more resilient quantum algorithms that would work on NISQ systems. In general, the article offers a systematic view on entanglement behavior in disordered quantum systems and highlights its value in the development of quantum computing applications in the near term.

International Journal of Integrated Research and Practice•Jan 15, 2026•0 citations
Circuit cutting is a promising technique for mapping a quantum circuit requiring many qubits to a series of circuits requiring fewer qubits. At the cost of a longer runtime, such a strategy can reduce qubit requirements and mitigate noise in currently available Noisy Intermediate-Scale Quantum (NISQ) devices where noise scales poorly with greater levels of entanglement. In this work, we investigate the performance of wire-based circuit cutting in cases of different levels of entanglement and forms of noise. As a broadly applicable starting point, we focus on cutting Hamiltonian-inspired quantum circuits with various entanglement strategies and circuit depths. We provide model calculations of these circuits before and after cutting, both in the ideal case and in the presence of noise, using quantum simulators with quantum noise models. We present a numerical analysis of the performance of circuit cutting using various metrics for comparing ideal and noisy model calculations. Our results indicate that the efficacy of circuit cutting is sensitive to the level of entanglements and is affected differently by incoherent quantum noises.
Current quantum computers suffer from a limited number of qubits and high error rates, limiting practical applicability. Different techniques exist to mitigate these effects and run larger algorithms. In this work, we analyze one of these techniques called quantum circuit cutting. With circuit cutting, a quantum circuit is decomposed into smaller sub-circuits, each of which can be run on smaller quantum hardware. We compare the performance of quantum circuit cutting with different cutting strategies, and then apply circuit cutting to a QAOA algorithm. Using simulations, we first show that Randomized Clifford measurements outperform both Pauli and random unitary measurements. Second, we show that circuit cutting has trouble providing correct answers in noisy settings, especially as the number of circuits increases.
Noisy intermediate-scale quantum (NISQ) devices with limited qubit count and connectivity limit the scale of quantum circuits that can be executed. Circuit cutting methods simulate larger quantum computers by decomposing large circuits into small subcircuits that can be executed on NISQ hardware. Existing circuit cutting methods only consider the qubit count of the target hardware for finding the locations of cuts on the circuits. This can result in deeper subcircuits after mapping on the hardware. Fidelity decays exponentially with circuit depth and diminishes the quality of execution. We propose a circuit-cutting framework that reduces variance in the depth of subcircuits after mapping to the hardware. Our method formulates the initial circuit cutting as a multi-objective optimization problem based on an evolutionary search method with the number of cuts and the maximum depth of individual routed subcircuits as fitness objectives. This method is implemented as an extension to the existing Qiskit Circuit Cutting Addon, which allows for integration in existing flows. Our approach achieves reductions in routed subcircuit depth of up to 9.9% across benchmark circuits compared with baseline methods.
Abstract Noisy intermediate-scale quantum (NISQ) devices are restricted by their limited number of qubits and their short decoherence times. An approach addressing these problems is quantum circuit cutting. It decomposes the execution of a large quantum circuit into the execution of multiple smaller quantum circuits with additional classical postprocessing. Since these smaller quantum circuits require fewer qubits and gates, they are more suitable for NISQ devices. To investigate the effect of quantum circuit cutting in a quantum algorithm targeting NISQ devices, we design two experiments using the quantum approximate optimization algorithm (QAOA) for the Maximum Cut (MaxCut) problem and conduct them on state-of-the-art superconducting devices. Our first experiment studies the influence of circuit cutting on the objective function of QAOA, and the second evaluates the quality of results obtained by the whole algorithm with circuit cutting. The results show that circuit cutting can reduce the effects of noise in QAOA, and therefore, the algorithm yields better solutions on NISQ devices.
Distributed quantum computing supports combining the computational power of multiple quantum devices to overcome the limitations of individual devices. Circuit cutting techniques enable the distribution of quantum computations via classical communication. These techniques involve partitioning a quantum circuit into smaller subcircuits, each containing fewer qubits. The original circuit's outcome can be replicated by executing these sub circuits on separate devices and combining their results. However, the number of circuit executions required to achieve a fixed result accuracy with circuit cutting grows exponentially with the number of cuts, posing significant costs. In contrast, quantum teleportation allows the distribution of quantum computations without an exponential increase in circuit executions. Nevertheless, each teleportation requires a pre-shared pair of maximally entangled qubits for transmitting a quantum state, and non-maximally entangled qubits cannot be used for this purpose. Addressing this, our work explores utilizing non-maximally entangled qubit pairs in wire cutting, a specific form of circuit cutting, to mitigate the associated costs. The cost of this cutting procedure reduces with the increasing degree of entanglement in the pre-shared qubit pairs. We derive the optimal sampling overhead in this context and present a wire cutting technique employing pure non-maximally entangled states that achieves this optimal sampling overhead. Hence, this offers a continuum between existing wire cutting and quantum teleportation.
Noisy Intermediate-Scale Quantum (NISQ) computers impose severe architectural constraints that prevent direct execution of logical quantum circuits. As a result, quantum circuit mapping—transforming ideal circuits into hardware-compatible forms—has become a critical task in quantum software toolchains. This paper presents a comparative study of key mapping techniques, focusing on circuit depth, SWAP gate overhead, and fidelity awareness. Through a case analysis on a 5-qubit Quantum Fourier Transform (QFT) circuit, we demonstrate the performance trade-offs of several prominent mapping strategies, including naive greedy routing, Qiskit’s SABRE, and CQC’s t|ket>. Our findings reveal that mapping technique selection has a profound impact on circuit quality and feasibility on real NISQ hardware.
The advent of noisy intermediate-scale quantum (NISQ) devices has not only opened up new possibilities to studying quantum computational benefits, but it has also presented new challenges associated with noise and short coherence times. Entanglement is one of the inherent resources that can be used to perform quantum computation and implement the performance and reliability of quantum algorithms. This paper looks at entanglement dynamics in NISQ machines subjected to natural noises. The study focuses on the problem of examining the role of various noise channels in the creation, dynamics, and decay of the entanglement during quantum operations, such as depolarizing, amplitude damping, and phase damping. The study is based on theoretical modeling and numerical simulations of multi-qubit quantum circuits to determine the stability of entangled states with respect to circuit depth and intensity of noise. Concurrence and von Neumann entropy are examples of entanglement measures that are used to characterize correlations between qubits as well as to trace the dynamics of these correlations across computational interactions. The results show that noise has major impacts on entanglement distribution, which tends to cause rapid decays in highly entangled states with increase in circuit complexity. The findings, however, also show that there are some circuit architectures and error-mitigation schemes that can somewhat sustain entanglement with moderate levels of noise. The paper also emphasizes the relevance of minimalizing sequence of gates, and reduced circuit depth in an effort to preserve useful entanglement in present-day quantum hardware. These observations help in understanding the behaviour of quantum correlations better in real world quantum devices and provide a way of developing more resilient quantum algorithms that would work on NISQ systems. In general, the article offers a systematic view on entanglement behavior in disordered quantum systems and highlights its value in the development of quantum computing applications in the near term.