Optimized Circuit Cutting for QAOA Sampling Tasks

• URL: http://arxiv.org/abs/2507.06649v1
• Date: Wed, 09 Jul 2025 08:27:38 GMT
• Title: Optimized Circuit Cutting for QAOA Sampling Tasks
• Authors: Friedrich Wagner, Christian Ufrecht, Martin Braun, Daniel D. Scherer,
• Abstract summary: 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.
• Score: 0.09782246441301058
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Circuit cutting was originally designed to retrieve the expectation value of an observable with respect to a large quantum circuit by executing smaller circuit fragments. In this work, however, we demonstrate the application of circuit cutting to a pure sampling task. In particular, we sample solutions to an optimization problem from a trained QAOA circuit. Here, circuit cutting leads to a broadening and shift of the bitstring distribution towards suboptimal values compared to the uncut case. To reduce this effect, we minimize the number of required cuts via integer programming methods. On the other hand, cutting reduces the circuit size and thus the impact of noise. Our experiments on quantum hardware reveal that, for large circuits, the effect of noise reduction outweighs the derogative effects on the bitstring distribution. The study therefore provides evidence that circuit cutting combined with optimized cutting schemes can both scale problem size and mitigate noise for near-term quantum optimization.

Related papers

• Circuit cutting with classical side information [1.3791394805787949]
  We provide a formalization of general circuit cutting techniques utilizing side information through quantum instruments.<n>We find that in certain scenarios, side information does not yield any reduction in sampling overhead, whereas in others it is essential for circuit cutting to be feasible at all.
  arXiv  Detail & Related papers  (2025-03-28T12:43:34Z)
• A Hardware-Aware Gate Cutting Framework for Practical Quantum Circuit Knitting [0.9968037829925942]
  Circuit knitting emerges as a promising technique to overcome the limitation of the few physical qubits in near-term quantum hardware. We propose a hardware-aware framework aiming to advance the practicability of circuit knitting. We show that our framework reduces total subcircuits depth by up to 64% (48% on average) compared to the state-of-the-art approach.
  arXiv  Detail & Related papers  (2024-09-05T19:18:30Z)
• 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)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• QRCC: Evaluating Large Quantum Circuits on Small Quantum Computers through Integrated Qubit Reuse and Circuit Cutting [9.183705638709037]
  The size of quantum circuits that can be run with high fidelity is constrained by the limited quantity and quality of physical qubits.<n>QRCC exploits qubit reuse to find better cutting solutions to minimize the cut numbers and thus the post-processing overhead.<n>Our evaluation results show that on average we reduce the number of cuts by 29% and additional reduction when considering gate cuts.
  arXiv  Detail & Related papers  (2023-12-16T02:49:28Z)
• Cost Explosion for Efficient Reinforcement Learning Optimisation of Quantum Circuits [55.616364225463066]
  Reinforcement Learning (RL) is a recent approach for learning strategies to optimise quantum circuits by increasing the reward of an optimisation agent. Our goal is to improve the agent's optimization strategy, by including hints about how quantum circuits are optimized manually. We show that allowing cost explosions offers significant advantages for RL training, such as reaching optimum circuits.
  arXiv  Detail & Related papers  (2023-11-21T10:16:03Z)
• FragQC: An Efficient Quantum Error Reduction Technique using Quantum Circuit Fragmentation [4.2754140179767415]
  We present it FragQC, a software tool that cuts a quantum circuit into sub-circuits when its error probability exceeds a certain threshold. We achieve an increase of fidelity by 14.83% compared to direct execution without cutting the circuit, and 8.45% over the state-of-the-art ILP-based method.
  arXiv  Detail & Related papers  (2023-09-30T17:38:31Z)
• 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)
• 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)
• Doubly optimal parallel wire cutting without ancilla qubits [0.4394730767364254]
  A restriction in the quality and quantity of available qubits presents a substantial obstacle to the application of near-term and early fault-tolerant quantum computers. This paper studies the problem of decomposing the parallel $n$-qubit identity channel into a set of local operations and classical communication. We give an optimal wire-cutting method comprised of channels based on mutually unbiased bases, that achieves minimal overheads in both the sampling overhead and the number of channels.
  arXiv  Detail & Related papers  (2023-03-13T17:59:18Z)
• 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)
• On the realistic worst case analysis of quantum arithmetic circuits [69.43216268165402]
  We show that commonly held intuitions when designing quantum circuits can be misleading. We show that reducing the T-count can increase the total depth. We illustrate our method on addition and multiplication circuits using ripple-carry.
  arXiv  Detail & Related papers  (2021-01-12T21:36:16Z)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)

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.