Low overhead circuit cutting with operator backpropagation

• URL: http://arxiv.org/abs/2510.19467v1
• Date: Wed, 22 Oct 2025 11:00:37 GMT
• Title: Low overhead circuit cutting with operator backpropagation
• Abstract summary: We introduce an optimized approach for minimizing noise in quantum circuits using operator backpropagation (OBP) combined with circuit cutting.<n>Results show a 3x and 10x decrease in resource requirements for Variational Quantum Eigensolver and Hamiltonian simulation circuits respectively.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Current quantum computers suffer from noise due to lack of error correction. Several techniques to mitigate the effect of noise have been studied, in particular to extract the expectation value of observables. One such technique, circuit cutting, partitions large circuits into smaller, less noisy subcircuits, but the exponential increase in the number of circuit executions limits its scalability. Another method, operator backpropagation (OBP) reduces circuit depth by classically simulating parts of it, yet often escalates the number of circuit executions by some factor due to additional non-commuting terms in the updated observable. This paper introduces an optimized approach for minimizing noise in quantum circuits using operator backpropagation (OBP) combined with circuit cutting. We demonstrate that the strategic use of OBP with circuit cutting can mitigate the execution overhead. By employing simulated annealing, our proposed method identifies the optimal backpropagation parameter for specific circuits and observables, maximizing resource reduction in cutting. Results show a 3x and 10x decrease in resource requirements for Variational Quantum Eigensolver and Hamiltonian simulation circuits respectively, while maintaining or even enhancing accuracy. This approach also yields similar savings for other circuits from the Benchpress database and various observable weights, providing an efficient method to lower circuit cutting overhead without compromising performance.

Related papers

• The Gain-Engineered Transmon [68.89136228609398]
  We introduce and experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit.<n>Our results open a path towards using this system as a simple building-block for hardware-efficient quantum error detection and correction schemes.
  arXiv  Detail & Related papers  (2026-08-26T17:00:42Z)
• Bona: Automatic Management of Dirty Ancilla Borrowing in Quantum Circuits [2.114493240103586]
  bona is the first scheduler for dirty-qubit borrowing built on a novel depth-aware algorithm.<n>We show that bona reduces nearly 99% of dirty ancillas on average with controlled depth overhead.
  arXiv  Detail & Related papers  (2026-08-09T15:28:10Z)
• Evaluating Quantum Wire Cutting for QAOA: Performance Benchmarks in Ideal and Noisy Environments [0.0]
  We analyze one of these techniques called quantum circuit cutting.<n>With circuit cutting, a quantum circuit is decomposed into smaller sub-circuits, each of which can be run on smaller quantum hardware.<n>We show that circuit cutting has trouble providing correct answers in noisy settings, especially as the number of circuits increases.
  arXiv  Detail & Related papers  (2026-02-03T12:57:19Z)
• Optimized Circuit Cutting for QAOA Sampling Tasks [0.09782246441301058]
  We demonstrate the application of circuit cutting to a pure sampling task.<n>In particular, we sample solutions to an optimization problem from a trained QAOA circuit.<n>Experiments on quantum hardware reveal that, for large circuits, the effect of noise reduction outweighs the derogative effects on the bitstring distribution.
  arXiv  Detail & Related papers  (2025-07-09T08:27:38Z)
• Optimizing Quantum Circuits via ZX Diagrams using Reinforcement Learning and Graph Neural Networks [38.499527873574436]
  We introduce a framework based on ZX calculus, graph-neural networks and reinforcement learning for quantum circuit optimization.<n>By combining reinforcement learning and tree search, our method addresses the challenge of selecting optimal sequences of ZX calculus rewrite rules.<n>We demonstrate our method's competetiveness with state-of-the-art circuit generalizations and capabilities on large sets of diverse random circuits.
  arXiv  Detail & Related papers  (2025-04-04T13:19:08Z)
• Enhanced Quantum Circuit Cutting Framework for Sampling Overhead Reduction [25.01488143369413]
  ShotQC is an enhanced circuit cutting framework with effective sampling overhead reduction.<n>It achieves significant reductions in sampling overhead without increasing classical postprocessing complexity.
  arXiv  Detail & Related papers  (2024-12-23T16:34:57Z)
• Linear Circuit Synthesis using Weighted Steiner Trees [45.11082946405984]
  CNOT circuits are a common building block of general quantum circuits. This article presents state-of-the-art algorithms for optimizing the number of CNOT gates. A simulated evaluation shows that the suggested is almost always beneficial and reduces the number of CNOT gates by up to 10%.
  arXiv  Detail & Related papers  (2024-08-07T19:51:22Z)
• Finding Transformer Circuits with Edge Pruning [71.12127707678961]
  We propose Edge Pruning as an effective and scalable solution to automated circuit discovery.<n>Our method finds circuits in GPT-2 that use less than half the number of edges compared to circuits found by previous methods.<n>Thanks to its efficiency, we scale Edge Pruning to CodeLlama-13B, a model over 100x the scale that prior methods operate on.
  arXiv  Detail & Related papers  (2024-06-24T16:40:54Z)
• 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)
• A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method [39.671915199737846]
  We introduce a multiple-circuit algorithm for a quantum lattice Boltzmann method (QLBM) solve of the incompressible Navier--Stokes equations.<n>The presented method is validated and demonstrated for 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• 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)
• Classical simulations of noisy variational quantum circuits [0.0]
  Noisely affects quantum computations so that they not only become less accurate but also easier to simulate classically as systems scale up. We construct a classical simulation algorithm, LOWESA, for estimating expectation values of noisy parameterised quantum circuits.
  arXiv  Detail & Related papers  (2023-06-08T17:52:30Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices [36.32934805738396]
  Noisy Intermediate-Scale Quantum (NISQ) devices are restricted by their limited number of qubits and their short decoherence times. quantum circuit cutting decomposes the execution of a large quantum circuit into the execution of multiple smaller quantum circuits.
  arXiv  Detail & Related papers  (2023-02-03T15:02:28Z)
• Rotation-inspired circuit cut optimization [7.562843347215286]
  Recent works have demonstrated that large quantum circuits can be cut and decomposed into smaller clusters of quantum circuits. We propose Rotation-Inspired Circuit Cut Optimization (RICCO), an alternative method which reduces the post-processing overhead of circuit cutting. We demonstrate practical application of RICCO to VQE by classically simulating a small instance of VQE and comparing it to one of the existing circuit-cutting methods.
  arXiv  Detail & Related papers  (2022-11-14T13:57:22Z)
• Reducing the Depth of Linear Reversible Quantum Circuits [0.0]
  In quantum computing the decoherence time of the qubits determines the computation time available. We propose a practical formulation of a divide and conquer algorithm that produces quantum circuits that are twice as shallow as those produced by existing algorithms. Overall, we manage to consistently reduce the total depth of a class of reversible functions, with up to 92% savings in an ancilla-free case and up to 99% when ancillary qubits are available.
  arXiv  Detail & Related papers  (2022-01-17T12:36:32Z)

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.