CutReg: A loss regularizer for enhancing the scalability of QML via adaptive circuit cutting

• URL: http://arxiv.org/abs/2506.14858v1
• Date: Tue, 17 Jun 2025 09:09:20 GMT
• Title: CutReg: A loss regularizer for enhancing the scalability of QML via adaptive circuit cutting
• Authors: Maniraman Periyasamy, Christian Ufrecht, Daniel D. Scherer, Wolfgang Mauerer,
• Abstract summary: This work introduces a novel regularization term into the QML optimization process, directly penalizing the overhead associated with sampling.<n> Specifically, it navigates the trade-off between minimizing the cutting overhead and maintaining the overall accuracy of the QML model, paving the way to study larger complex problems in pursuit of quantum advantage.
• Score: 2.5566599806228987
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Whether QML can offer a transformative advantage remains an open question. The severe constraints of NISQ hardware, particularly in circuit depth and connectivity, hinder both the validation of quantum advantage and the empirical investigation of major obstacles like barren plateaus. Circuit cutting techniques have emerged as a strategy to execute larger quantum circuits on smaller, less connected hardware by dividing them into subcircuits. However, this partitioning increases the number of samples needed to estimate the expectation value accurately through classical post-processing compared to estimating it directly from the full circuit. This work introduces a novel regularization term into the QML optimization process, directly penalizing the overhead associated with sampling. We demonstrate that this approach enables the optimizer to balance the advantages of gate cutting against the optimization of the typical ML cost function. Specifically, it navigates the trade-off between minimizing the cutting overhead and maintaining the overall accuracy of the QML model, paving the way to study larger complex problems in pursuit of quantum advantage.

Related papers

• MPQ-DMv2: Flexible Residual Mixed Precision Quantization for Low-Bit Diffusion Models with Temporal Distillation [74.34220141721231]
  We present MPQ-DMv2, an improved textbfMixed textbfPrecision textbfQuantization framework for extremely low-bit textbfDiffusion textbfModels.
  arXiv  Detail & Related papers  (2025-07-06T08:16:50Z)
• FIMA-Q: Post-Training Quantization for Vision Transformers by Fisher Information Matrix Approximation [55.12070409045766]
  Post-training quantization (PTQ) has stood out as a cost-effective and promising model compression paradigm in recent years.<n>Current PTQ methods for Vision Transformers (ViTs) still suffer from significant accuracy degradation, especially under low-bit quantization.
  arXiv  Detail & Related papers  (2025-06-13T07:57:38Z)
• Variational quantum algorithms with invariant probabilistic error cancellation on noisy quantum processors [13.51474348538291]
  We propose a novel noise-adaptable strategy that combines PEC with the quantum approximate optimization algorithm (QAOA)<n>We experimentally validated this technique on a superconducting quantum processor, cutting sampling cost by 90.1%.<n>These results open promising avenues for executing VQAs with large-scale, low-noise quantum circuits, paving the way for practical quantum computing advancements.
  arXiv  Detail & Related papers  (2025-06-08T08:25:47Z)
• Spatial and temporal circuit cutting with hypergraphic partitioning [0.0]
  This paper presents a hypergraph-based circuit cutting methodology suitable for both spatial and temporal scenarios.<n>By modeling quantum circuits as high-level hypergraphs, we apply partitionings such as Stoer-Wagner, Fiduccia-Mattheyses, and Kernighan-Lin.
  arXiv  Detail & Related papers  (2025-04-12T20:31:07Z)
• 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)
• MLQM: Machine Learning Approach for Accelerating Optimal Qubit Mapping [13.958125071955742]
  We propose a machine learning approach for accelerating optimal qubit mapping (MLQM)<n>First, the method proposes a global search space pruning scheme based on prior knowledge and machine learning.<n>Second, to address the limited availability of effective samples in the learning task, MLQM introduces a novel data augmentation and refinement scheme.
  arXiv  Detail & Related papers  (2024-12-04T11:49:09Z)
• AffineQuant: Affine Transformation Quantization for Large Language Models [58.45460102764]
  Post-Training Quantization (PTQ) has emerged as a subject of considerable interest due to its compression efficiency and cost-effectiveness in the context of training. Existing PTQ methods for Large-scale Language Models (LLMs) limit the optimization scope to scaling transformations between pre- and post-quantization weights. In this paper, we advocate for the direct optimization using equivalent Affine transformations in PTQ (AffineQuant)
  arXiv  Detail & Related papers  (2024-03-19T08:40:21Z)
• CBQ: Cross-Block Quantization for Large Language Models [66.82132832702895]
  Post-training quantization (PTQ) has played a key role in compressing large language models (LLMs) with ultra-low costs.<n>We propose CBQ, a cross-block reconstruction-based PTQ method for LLMs.<n> CBQ employs a cross-block dependency using a reconstruction scheme, establishing long-range dependencies across multiple blocks to minimize error accumulation.
  arXiv  Detail & Related papers  (2023-12-13T07:56:27Z)
• ISAAQ: Ising Machine Assisted Quantum Compiler [3.8137985834223502]
  We propose ISing mAchine Assisted Quantum compiler (ISAAQ) to perform qubit routing with Ising machines. ISAAQ accurately estimates the compilation costs by updating itself using previous compilation results. ISAAQ exploits a cost-reduction method that implements commutative logical Controlled-NOT (CNOT) gates with fewer physical CNOT gates.
  arXiv  Detail & Related papers  (2023-03-06T01:47:10Z)
• The Accuracy vs. Sampling Overhead Trade-off in Quantum Error Mitigation Using Monte Carlo-Based Channel Inversion [84.66087478797475]
  Quantum error mitigation (QEM) is a class of promising techniques for reducing the computational error of variational quantum algorithms. We consider a practical channel inversion strategy based on Monte Carlo sampling, which introduces additional computational error. We show that when the computational error is small compared to the dynamic range of the error-free results, it scales with the square root of the number of gates.
  arXiv  Detail & Related papers  (2022-01-20T00:05:01Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Characterizing the loss landscape of variational quantum circuits [77.34726150561087]
  We introduce a way to compute the Hessian of the loss function of VQCs. We show how this information can be interpreted and compared to classical neural networks.
  arXiv  Detail & Related papers  (2020-08-06T17:48:12Z)

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.