MPM-QIR: Measurement-Probability Matching for Quantum Image Representation and Compression via Variational Quantum Circuit

• URL: http://arxiv.org/abs/2601.03855v1
• Date: Wed, 07 Jan 2026 12:11:31 GMT
• Title: MPM-QIR: Measurement-Probability Matching for Quantum Image Representation and Compression via Variational Quantum Circuit
• Abstract summary: We present MPM-QIR, a variational-quantum-circuit (VQC) framework for classical image compression and representation.<n>The method aligns a generative VQC's measurement-probability distribution with normalized pixel intensities.<n>It learns positional information implicitly via an ordered mapping to the flattened pixel array.
• Score: 0.10874100424278171
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present MPM-QIR, a variational-quantum-circuit (VQC) framework for classical image compression and representation whose core objective is to achieve equal or better reconstruction quality at a lower Parameter Compression Ratio (PCR). The method aligns a generative VQC's measurement-probability distribution with normalized pixel intensities and learns positional information implicitly via an ordered mapping to the flattened pixel array, thus eliminating explicit coordinate qubits and tying compression efficiency directly to circuit (ansatz) complexity. A bidirectional convolutional architecture induces long-range entanglement at shallow depth, capturing global image correlations with fewer parameters. Under a unified protocol, the approach attains PSNR $\geq$ 30 dB with lower PCR across benchmarks: MNIST 31.80 dB / SSIM 0.81 at PCR 0.69, Fashion-MNIST 31.30 dB / 0.91 at PCR 0.83, and CIFAR-10 31.56 dB / 0.97 at PCR 0.84. Overall, this compression-first design improves parameter efficiency, validates VQCs as direct and effective generative models for classical image compression, and is amenable to two-stage pipelines with classical codecs and to extensions beyond 2D imagery.

Related papers

• Multi-scale Image Representation Compression [21.36894041974722]
  MIRC is an overfitted image in which every coded component is quantized and entropy coded under a single rate-distortion objective.<n>On the CLIC 2020 professional validation set, MIRC achieves a 10.5% BD-rate saving against VVC (VTM 22.0).<n>MIRC offers a family of configurations spanning 1.2 to 2.9 kMAC per pixel, so the decoding budget can be selected to match the deployment target.
  arXiv  Detail & Related papers  (2026-09-02T21:44:26Z)
• AQMP: Image compression through Adaptive Quadtree Refinement and Matching Pursuit with Hyperparameter Optimization [0.004839692374508868]
  We present AQMP, a novel image combining Adaptive Quadtree Refinement with Matching Pursuit.<n>Unlike conventional Matching Pursuit methods that operate on fixed-size sub-images, AQMP dynamically adapts block sizes to local image structure.<n> AQMP achieves up to $4times$ higher compression rates than JPEG at comparable SSIM values.
  arXiv  Detail & Related papers  (2026-05-09T22:07:35Z)
• Differentiable Vector Quantization for Rate-Distortion Optimization of Generative Image Compression [53.041405703471895]
  We propose RDVQ, a unified framework that enables end-to-end RD optimization for low-bitrate image compression.<n>We develop an autoregressive entropy model that supports accurate entropy modeling and test-time rate control.<n>Compared with RD2K-val, RDVQ reduces by up to 75.71% on DISTS and 37.63% on LPIPS on DIV2K-val.
  arXiv  Detail & Related papers  (2026-04-12T09:25:24Z)
• Quantum walk inspired JPEG compression of images [2.928053186719895]
  The proposed framework is evaluated on MNIST, CIFAR10, and ImageNet subsets, using Peak Signal to Noise Ratio (PSNR), Structural Similarity Index (SSIM), Bits Per Pixel (BPP), and error heatmap visual analysis as evaluation metrics.<n> Experimental results show average gains ranging from 3 to 6 dB PSNR, along with better structural preservation of edges, contours, and luminance transitions, without modifying decoder compatibility.
  arXiv  Detail & Related papers  (2026-02-12T05:40:33Z)
• MRT: Learning Compact Representations with Mixed RWKV-Transformer for Extreme Image Compression [31.446201901838958]
  We propose a novel Mixed RWKV-Transformer (MRT) architecture that encodes images into more compact 1-D latent representations.<n>MRT partitions each image into fixed-size windows, utilizing RWKV modules to capture global dependencies across windows and Transformer blocks to model local within each window.<n>To further enhance compression efficiency, we introduce a dedicated RWKV Compression Model (RCM)
  arXiv  Detail & Related papers  (2025-11-10T05:23:00Z)
• Compressing Large Language Models with PCA Without Performance Loss [0.0]
  We show that Principal Component Analysis enables extreme compression of neural models without sacrificing performance.<n>A one-layer classifier trained on PCA-compressed polar MNIST achieves over 98 percent accuracy using only 840 parameters.<n>A two-layer transformer trained on 70-dimensional PCA-reduced MiniLM embeddings reaches 76.62 percent accuracy on the 20 Newsgroups dataset.
  arXiv  Detail & Related papers  (2025-08-06T10:47:22Z)
• Higher fidelity perceptual image and video compression with a latent conditioned residual denoising diffusion model [55.2480439325792]
  We propose a hybrid compression scheme optimized for perceptual quality, extending the approach of the CDC model with a decoder network.<n>We achieve up to +2dB PSNR fidelity improvements while maintaining comparable LPIPS and FID perceptual scores when compared with CDC.
  arXiv  Detail & Related papers  (2025-05-19T14:13:14Z)
• FD-LSCIC: Frequency Decomposition-based Learned Screen Content Image Compression [67.34466255300339]
  This paper addresses three key challenges in SC image compression: learning compact latent features, adapting quantization step sizes, and the lack of large SC datasets.<n>We introduce an adaptive quantization module that learns scaled uniform noise for each frequency component, enabling flexible control over quantization granularity.<n>We construct a large SC image compression dataset (SDU-SCICD10K), which includes over 10,000 images spanning basic SC images, computer-rendered images, and mixed NS and SC images from both PC and mobile platforms.
  arXiv  Detail & Related papers  (2025-02-21T03:15:16Z)
• Compact Implicit Neural Representations for Plane Wave Images [5.87226666953377]
  Plane-Wave (PW) imaging produces artifacts and shadows that vary with insonification angles. We propose a novel approach using Implicit Neural Representations (INRs) to compactly encode multi-planar sequences.
  arXiv  Detail & Related papers  (2024-09-17T17:18:57Z)
• Quantization-aware Matrix Factorization for Low Bit Rate Image Compression [8.009813033356478]
  Lossy image compression is essential for efficient transmission and storage.<n>We introduce a quantization-aware matrix factorization (QMF) to develop a novel lossy image compression method.<n>Our method consistently outperforms JPEG at low bit rates below 0.25 bits per pixel (bpp) and remains comparable at higher bit rates.
  arXiv  Detail & Related papers  (2024-08-22T19:08:08Z)
• 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)
• Progressive Learning with Visual Prompt Tuning for Variable-Rate Image Compression [60.689646881479064]
  We propose a progressive learning paradigm for transformer-based variable-rate image compression. Inspired by visual prompt tuning, we use LPM to extract prompts for input images and hidden features at the encoder side and decoder side, respectively. Our model outperforms all current variable image methods in terms of rate-distortion performance and approaches the state-of-the-art fixed image compression methods trained from scratch.
  arXiv  Detail & Related papers  (2023-11-23T08:29:32Z)
• Implicit Neural Representations for Image Compression [103.78615661013623]
  Implicit Neural Representations (INRs) have gained attention as a novel and effective representation for various data types. We propose the first comprehensive compression pipeline based on INRs including quantization, quantization-aware retraining and entropy coding. We find that our approach to source compression with INRs vastly outperforms similar prior work.
  arXiv  Detail & Related papers  (2021-12-08T13:02:53Z)
• Training with Quantization Noise for Extreme Model Compression [57.51832088938618]
  We tackle the problem of producing compact models, maximizing their accuracy for a given model size. A standard solution is to train networks with Quantization Aware Training, where the weights are quantized during training and the gradients approximated with the Straight-Through Estimator. In this paper, we extend this approach to work beyond int8 fixed-point quantization with extreme compression methods.
  arXiv  Detail & Related papers  (2020-04-15T20:10:53Z)

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.