Novel quantum circuit for image compression utilizing modified Toffoli gate and quantized transformed coefficient alongside a novel reset gate

• URL: http://arxiv.org/abs/2502.17815v1
• Date: Tue, 25 Feb 2025 03:41:28 GMT
• Title: Novel quantum circuit for image compression utilizing modified Toffoli gate and quantized transformed coefficient alongside a novel reset gate
• Authors: Ershadul Haque, Manoranjan Paul,
• Abstract summary: We introduce a modified Toffoli gate state connection using a quantized transform coefficient preparation process.<n>This innovative strategy streamlines circuit complexity by modifying state connection from the state connection information.<n>Our findings reveal that it requires an impressive 44.21 percent fewer gates than existing techniques.
• Score: 8.402306681413087
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum image computing has emerged as a groundbreaking field, revolutionizing how we store and process data at speeds incomparable to classical methods. Nevertheless, as image sizes expand, so does the complexity of qubit connections, posing significant challenges in the efficient representation and compression of quantum images. In response, we introduce a modified Toffoli gate state connection using a quantized transform coefficient preparation process. This innovative strategy streamlines circuit complexity by modifying state connection from the state connection information. In our operational control gates, only input 1 impacts the output, allowing us to modify the state connection and dramatically enhance the efficiency of the proposed circuit. As a result, the proposed approach significantly reduces the number of gates required for both image compression and representation. Our findings reveal that it requires an impressive 44.21 percent fewer gates than existing techniques, such as the Direct Cosine Transform Efficient Flexible Representation of Quantum Images (DCTEFRQI), all while maintaining a consistent peak signal-to-noise ratio (PSNR). For an image block size of 2^Sx2^Sy with q gray levels, the complexity of our approach can be succinctly expressed as, O[3q+log2Sx+log2Sy+2q(log2Sx+log2Sy)]. Here, Sx and Sy represent the X and Y positional control gates while q indicates the non-zero transform coefficients. Moreover, experimental evaluations strongly demonstrate that it excels in both compressing and representing quantum images compared to the DCTEFRQI approach, particularly excelling in the essential metrics of gate requirements and PSNR performance. Embrace the future of quantum imaging with our innovative solution, where efficiency meets excellence.

Related papers

• HQViT: Hybrid Quantum Vision Transformer for Image Classification [48.72766405978677]
  We propose a Hybrid Quantum Vision Transformer (HQViT) to accelerate model training while enhancing model performance. HQViT introduces whole-image processing with amplitude encoding to better preserve global image information without additional positional encoding. Experiments across various computer vision datasets demonstrate that HQViT outperforms existing models, achieving a maximum improvement of up to $10.9%$ (on the MNIST 10-classification task) over the state of the art.
  arXiv  Detail & Related papers  (2025-04-03T16:13:34Z)
• 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)
• Gate Optimization of NEQR Quantum Circuits via PPRM Transformation [0.0]
  This work aims to compress the quantum circuits of the Novel Enhanced Quantum Representation scheme. The proposed transformation is estimated to reduce the exponential complexity from $O(2m)$ to $O(1.5m)$, with a compression ratio approaching 100%. For linear complexity, the transformation is estimated to halve the run-time, with a compression ratio approaching 52%.
  arXiv  Detail & Related papers  (2024-09-22T23:40:40Z)
• 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)
• A quantum segmentation algorithm based on local adaptive threshold for NEQR image [7.798738743268923]
  The complexity of our algorithm can be reduced to $O(n2+q)$, which is an exponential speedup compared to the classic counterparts. The experiment is conducted on IBM Q to show the feasibility of our algorithm in the noisy intermediate-scale quantum (NISQ) era.
  arXiv  Detail & Related papers  (2023-10-02T04:01:42Z)
• Efficient quantum image representation and compression circuit using zero-discarded state preparation approach [9.653976364051564]
  A novel zero-discarded state connection novel enhance quantum representation (ZSCNEQR) is introduced to reduce complexity further. The proposed method requires 11.76% less qubits compared to the recent existing method.
  arXiv  Detail & Related papers  (2023-06-22T02:18:56Z)
• A novel state connection strategy for quantum computing to represent and compress digital images [10.20554144865699]
  We propose a new SCMFRQI (state connection modification FRQI) approach for further reducing the required bits. Unlike other existing methods, we compress images using block-level for further reduction of required qubits. The experimental results confirm that the proposed method outperforms the existing methods in terms of both image representation and compression points of view.
  arXiv  Detail & Related papers  (2022-12-14T08:10:40Z)
• Advance quantum image representation and compression using DCTEFRQI approach [0.5735035463793007]
  We have proposed a DCTEFRQI (Direct Cosine Transform Efficient Flexible Representation of Quantum Image) algorithm to represent and compress gray image efficiently. The objective of this work is to represent and compress various gray image size in quantum computer using DCT(Discrete Cosine Transform) and EFRQI (Efficient Flexible Representation of Quantum Image) approach together.
  arXiv  Detail & Related papers  (2022-08-30T13:54:09Z)
• Dynamic Dual Trainable Bounds for Ultra-low Precision Super-Resolution Networks [82.18396309806577]
  We propose a novel activation quantizer, referred to as Dynamic Dual Trainable Bounds (DDTB) Our DDTB exhibits significant performance improvements in ultra-low precision. For example, our DDTB achieves a 0.70dB PSNR increase on Urban100 benchmark when quantizing EDSR to 2-bit and scaling up output images to x4.
  arXiv  Detail & Related papers  (2022-03-08T04:26:18Z)
• Improved FRQI on superconducting processors and its restrictions in the NISQ era [62.997667081978825]
  We study the feasibility of the Flexible Representation of Quantum Images (FRQI) We also check experimentally what is the limit in the current noisy intermediate-scale quantum era. We propose a method for simplifying the circuits needed for the FRQI.
  arXiv  Detail & Related papers  (2021-10-29T10:42:43Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)

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.