Probability distribution reconstruction using circuit cutting applied to a variational classifier

• URL: http://arxiv.org/abs/2510.03077v1
• Date: Fri, 03 Oct 2025 15:04:34 GMT
• Title: Probability distribution reconstruction using circuit cutting applied to a variational classifier
• Authors: Niels M. P. Neumann, Carlos M. R. Rocha, Jasper Verbree, Marc van Vliet,
• Abstract summary: Insufficient quantum resources often are the problem when running quantum algorithms.<n>New techniques can aid in using smaller quantum computers to run larger quantum algorithms.<n>This work explores the potential of circuit cutting techniques precisely in this regime of many interactions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Significant efforts are being spent on building a quantum computer. At the same time, developments in quantum software are rapidly progressing. Insufficient quantum resources often are the problem when running quantum algorithms. New techniques can aid in using smaller quantum computers to run larger quantum algorithms. One of these techniques is circuit cutting. With this method, a circuit is broken into multiple pieces, each of which is run on quantum hardware independently and then recombined to obtain the overall answer. These circuit cutting techniques require additional circuit evaluations, which can form a bottleneck for algorithms requiring many interactions. This work explores the potential of circuit cutting techniques precisely in this regime of many interactions. We consider two different models, a standard method based on expectation values, and a novel method based on probability distribution reconstruction. Next, we compare two different training methods we call train-then-cut and cut-then-train and show that in practice, cut-then-train still produces good results. This observation brings closer the practical applicability of circuit cutting techniques, as a train-then-cut strategy is often infeasible. We conclude by implementing a cut and uncut circuit and find that circuit cutting helps achieve higher fidelity results.

Related papers

• 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)
• Understanding the Scalability of Circuit Cutting Techniques for Practical Quantum Applications [1.2553583315791608]
  Circuit cutting allows quantum circuits larger than the available hardware to be executed.<n>Cutting techniques split circuits into smaller subcircuits, run them on the hardware, and recombine results through classical post-processing.<n>We examine whether current circuit cutting techniques are practical for orchestrating executions on fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2024-11-25T23:16:27Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• 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)
• 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)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Reduce&chop: Shallow circuits for deeper problems [1.3108652488669736]
  State-of-the-art quantum computers can only reliably execute circuits with limited qubit numbers and computational depth. This work investigates to what extent we can mimic the performance of a deeper quantum computation by repeatedly using a shallower device.
  arXiv  Detail & Related papers  (2022-12-22T16:55:24Z)
• Approximate Quantum Circuit Cutting [4.3186101474291325]
  Current and imminent quantum hardware lacks reliability and applicability due to noise and limited qubit counts. Quantum circuit cutting -- a technique dividing large quantum circuits into smaller subcircuits with sizes appropriate for the limited quantum resource at hand -- is used to mitigate these problems. This article introduces the notion of approximate circuit reconstruction.
  arXiv  Detail & Related papers  (2022-12-02T16:04:52Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• 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)
• 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.