Enhanced Quantum Circuit Cutting Framework for Sampling Overhead Reduction

• URL: http://arxiv.org/abs/2412.17704v2
• Date: Wed, 25 Dec 2024 02:26:58 GMT
• Title: Enhanced Quantum Circuit Cutting Framework for Sampling Overhead Reduction
• Authors: Po-Hung Chen, Dah-Wei Chiou, Jie-Hong Roland Jiang,
• Abstract summary: 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.
• Score: 25.01488143369413
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The recent quantum circuit cutting technique enables simulating large quantum circuits on distributed smaller devices, significantly extending the capabilities of current noisy intermediate-scale quantum (NISQ) hardware. However, this method incurs substantial classical postprocessing and additional quantum resource demands, as both postprocessing complexity and sampling overhead scale exponentially with the number of cuts introduced. In this work, we propose an enhanced circuit cutting framework ShotQC with effective sampling overhead reduction. It effectively reduces sampling overhead through two key optimizations: shot distribution and cut parameterization. The former employs an adaptive Monte Carlo method to dynamically allocate more quantum resources to subcircuit configurations that contribute more to variance in the final outcome. The latter leverages additional degrees of freedom in postprocessing to further suppress variance. By integrating these optimization methods, ShotQC achieves significant reductions in sampling overhead without increasing classical postprocessing complexity, as demonstrated on a range of benchmark circuits.

Related papers

• 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. 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)
• Efficient Circuit Cutting and Scheduling in a Multi-Node Quantum System with Dynamic EPR Pairs [15.310062531983672]
  sol is implemented using Qiskit and evaluated on both real quantum hardware and various emulators. EC2S achieves significant improvements in fidelity, up to 16.7%, and reduces system-wide expenditure by up to 99.5%.
  arXiv  Detail & Related papers  (2024-12-24T23:59:54Z)
• PassionSR: Post-Training Quantization with Adaptive Scale in One-Step Diffusion based Image Super-Resolution [95.98801201266099]
  Diffusion-based image super-resolution (SR) models have shown superior performance at the cost of multiple denoising steps.<n>We propose a novel post-training quantization approach with adaptive scale in one-step diffusion (OSD) image SR, PassionSR.<n>Our PassionSR achieves significant advantages over recent leading low-bit quantization methods for image SR.
  arXiv  Detail & Related papers  (2024-11-26T04:49:42Z)
• Quantum-Classical Computing via Tensor Networks [0.6086160084025234]
  We introduce qTPU, a framework for scalable hybrid quantum-classical processing using tensor networks. By leveraging our hybrid quantum circuit contraction method, we represent circuit execution as the contraction of a hybrid tensor network (h-TN) The qTPU compiler automates efficient h-TN generation, optimizing the balance between estimated error and postprocessing overhead.
  arXiv  Detail & Related papers  (2024-10-19T11:57:05Z)
• Scaling and assigning resources on ion trap QCCD architectures [0.0]
  Ion trap technologies have earned significant attention as potential candidates for quantum information processing. We propose a novel approach for initial qubit placement, demonstrating enhancements of up to 50% compared to prior methods.
  arXiv  Detail & Related papers  (2024-08-01T01:35:55Z)
• 2DQuant: Low-bit Post-Training Quantization for Image Super-Resolution [83.09117439860607]
  Low-bit quantization has become widespread for compressing image super-resolution (SR) models for edge deployment. It is notorious that low-bit quantization degrades the accuracy of SR models compared to their full-precision (FP) counterparts. We present a dual-stage low-bit post-training quantization (PTQ) method for image super-resolution, namely 2DQuant, which achieves efficient and accurate SR under low-bit quantization.
  arXiv  Detail & Related papers  (2024-06-10T06:06:11Z)
• 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. We propose CBQ, a cross-block reconstruction-based PTQ method for LLMs. 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)
• 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)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• 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)
• 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)
• 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)
• Gradient-descent quantum process tomography by learning Kraus operators [63.69764116066747]
  We perform quantum process tomography (QPT) for both discrete- and continuous-variable quantum systems. We use a constrained gradient-descent (GD) approach on the so-called Stiefel manifold during optimization to obtain the Kraus operators. The GD-QPT matches the performance of both compressed-sensing (CS) and projected least-squares (PLS) QPT in benchmarks with two-qubit random processes.
  arXiv  Detail & Related papers  (2022-08-01T12:48:48Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Fully Quantized Image Super-Resolution Networks [81.75002888152159]
  We propose a Fully Quantized image Super-Resolution framework (FQSR) to jointly optimize efficiency and accuracy. We apply our quantization scheme on multiple mainstream super-resolution architectures, including SRResNet, SRGAN and EDSR. Our FQSR using low bits quantization can achieve on par performance compared with the full-precision counterparts on five benchmark datasets.
  arXiv  Detail & Related papers  (2020-11-29T03:53:49Z)

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.