Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:cs/0605002 · Chinese Physics

A hybrid quantum encoding algorithm of vector quantization for image compression

Chao-Yang Pang, Zheng-Wei Zhou, Guo Guang-Can

Published Nov 2, 2006• 22 citations
arXivHTMLPDF

Abstract

Many classical encoding algorithms of vector quantization (VQ) of image compression that can obtain global optimal solution have computational complexity O ( N ). A pure quantum VQ encoding algorithm with probability of success near 100% has been proposed, that performs operations 45 N 1/2 times approximately. In this paper, a hybrid quantum VQ encoding algorithm between the classical method and the quantum algorithm is presented. The number of its operations is less than N 1/2 for most images, and it is more efficient than the pure quantum algorithm.

DOI
10.1088/1009-1963/15/12/044

Related papers

Design of quantum VQ iteration and quantum VQ encoding algorithm taking O ( N 1/2 ) steps for data compression

Pang Chao-Yang, Zhou Zheng-Wei, chen xing +1 more

Vector quantization (VQ) is an important data compression method. The key of the encoding of VQ is to find the closest vector among N vectors for a feature vector. Many classical linear search algorithms take O(N) steps of distance computing between two vectors. The quantum VQ iteration and corresponding quantum VQ encoding algorithm that takes O(N1/2) steps are presented in this paper. The unitary operation of distance computing can be performed on a number of vectors simultaneously because the quantum state exists in a superposition of states. The quantum VQ iteration comprises three oracles, by contrast many quantum algorithms have only one oracle, such as Shor's factorization algorithm and Grover's algorithm. Entanglement state is generated and used, by contrast the state in Grover's algorithm is not an entanglement state. The quantum VQ iteration is a rotation over subspace, by contrast the Grover iteration is a rotation over global space. The quantum VQ iteration extends the Grover iteration to the more complex search that requires more oracles. The method of the quantum VQ iteration is universal.

Chinese Physics•Mar 1, 2006•15 citations

A Fast Quantum Image Compression Algorithm based on Taylor Expansion

Vu Tuan Hai, Huynh Ho Thi Mong Trinh, Pham Hoai Luan

With the increasing demand for storing images, traditional image compression methods face challenges in balancing the compressed size and image quality. However, the hybrid quantum-classical model can recover this weakness by using the advantage of qubits. In this study, we upgrade a quantum image compression algorithm within parameterized quantum circuits. Our approach encodes image data as unitary operator parameters and applies the quantum compilation algorithm to emulate the encryption process. By utilizing first-order Taylor expansion, we significantly reduce both the computational cost and loss, better than the previous version. Experimental results on benchmark images, including Lenna and Cameraman, show that our method achieves up to 86% reduction in the number of iterations while maintaining a lower compression loss, better for high-resolution images. The results confirm that the proposed algorithm provides an efficient and scalable image compression mechanism, making it a promising candidate for future image processing applications.

arXiv:2502.10684•International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)•May 20, 2025•3 citations

Quantum Approach to Image Data Encoding and Compression

Sathwik Reddy Majji, Avinash Chalumuri, B. S. B. S. Manoj

High-resolution images are being generated due to the rapid development of image sensors. Various image processing algorithms require images of reduced sizes, given the computational constraints. Hence, preprocessing the images to reduce their size is crucial for many applications. This letter proposes a novel approach to compress images using quantum computing. A comparative study on different standard data encoding techniques used in quantum computing is undertaken. We propose four quantum compression techniques by extending the unitary operations of amplitude embedding for compressing images. The proposed methods provide exponential scaling as amplitude embedding is used, where$2^{n}$classical data values are encoded into$n$qubits. Compression performance, visual evaluation, and objective evaluation are carried out to assess the proposed compression techniques. Our experimental results show that the crucial patterns in images are retained in the compressed images even at 75% compression. The compressed images can be used for postprocessing tasks using classical or quantum computing algorithms.

IEEE Sensors Letters•Jan 25, 2023•18 citations

Image compression using quantum wavelet transforms

Sri Harshavardhan Reddy Devarapalli, Harshdeep Jadhav, Jayasri Dontabhaktuni

Quantum computing has emerged as a revolutionary paradigm in numerous fields owing to its basis in quantum mechanical concepts such as quantum entanglement and parallelism. This has potential in various applications including computer vision, particularly, image processing and compression. Applications that depend on largescale image data for storing, processing, and transmission have to rely on compression methods for real-time processing. While the classical methods based on discrete cosine transformations (DCT used in JPEG) and discrete wavelet transformations (DWT) perform image compression efficiently, they suffer from trade-off between loss-less compression and compression ratios. In the current work, we would like to explore the usefulness of implementing quantum wavelet transforms for image compression for better PSNR values and execution times. We compare the application of quantum Haar wavelet transform (QHWT) with different quantum encoding methods such as NASS and FRQI and find that NASS-encoded images on application of QHWT gives better PSNR values and shorter runtime with visibly closer details to the original images, showcasing potential for efficient and faster image compression methods.

Quantum Computing, Communication, and Simulation•Jan 24, 2025•5 citations

Hybrid Quantum Image Preparation via JPEG Compression

Emad Rezaei Fard Boosari

We present a hybrid classical-quantum image preparation scheme that reduces the quantum implementation cost of image loading for quantum pixel information encoding (QPIE). The proposed method, termed JPEG-assisted QPIE (JQPIE), loads only the quantized JPEG coefficients into a quantum register, leading to substantial reductions in \texttt{CX} gate count and circuit depth while preserving reconstruction quality comparable to classical JPEG compression. We develop two variants of the hybrid strategy. The first realizes the complete JPEG decompression pipeline coherently by implementing inverse quantization via a block-encoded unitary operator. The second, referred to as \emph{quantization-free JQPIE} (QF-JQPIE), omits quantization altogether, thereby avoiding the probabilistic nature of block-encoded quantization. Numerical simulations on standard benchmark image datasets (USC--SIPI and Kodak) demonstrate that both variants achieve significant constant-factor reductions in \texttt{CX} gate count and circuit depth relative to direct QPIE loading, while maintaining high reconstruction quality as measured by PSNR and SSIM.

quant-pharXiv:2602.06201•Feb 9, 2026•0 citations

Variational Quantum Neural Networks (VQNNS) in Image Classification

Meghashrita Das, Tirupati Bolisetti

Quantum machine learning has established as an interdisciplinary field to overcome limitations of classical machine learning and neural networks. This is a field of research which can prove that quantum computers are able to solve problems with complex correlations between inputs that can be hard for classical computers. This suggests that learning models made on quantum computers may be more powerful for applications, potentially faster computation and better generalization on less data. The objective of this paper is to investigate how training of quantum neural network (QNNs) can be done using quantum optimization algorithms for improving the performance and time complexity of QNNs. A classical neural network can be partially quantized to create a hybrid quantum-classical neural network which is used mainly in classification and image recognition. In this paper, a QNN structure is made where a variational parameterized circuit is incorporated as an input layer named as Variational Quantum Neural Network (VQNNs). We encode the cost function of QNNs onto relative phases of a superposition state in the Hilbert space of the network parameters. The parameters are tuned with an iterative quantum approximate optimisation (QAOA) mixer and problem hamiltonians. VQNNs is experimented with MNIST digit recognition (less complex) and crack image classification datasets (more complex) which converges the computation in lesser time than QNN with decent training accuracy.

arXiv:2303.05860•Mar 10, 2023•6 citations
Many classical encoding algorithms of vector quantization (VQ) of image compression that can obtain global optimal solution have computational complexity O ( N ). A pure quantum VQ encoding algorithm with probability of success near 100% has been proposed, that performs operations 45 N 1/2 times approximately. In this paper, a hybrid quantum VQ encoding algorithm between the classical method and the quantum algorithm is presented. The number of its operations is less than N 1/2 for most images, and it is more efficient than the pure quantum algorithm.
Vector quantization (VQ) is an important data compression method. The key of the encoding of VQ is to find the closest vector among N vectors for a feature vector. Many classical linear search algorithms take O(N) steps of distance computing between two vectors. The quantum VQ iteration and corresponding quantum VQ encoding algorithm that takes O(N1/2) steps are presented in this paper. The unitary operation of distance computing can be performed on a number of vectors simultaneously because the quantum state exists in a superposition of states. The quantum VQ iteration comprises three oracles, by contrast many quantum algorithms have only one oracle, such as Shor's factorization algorithm and Grover's algorithm. Entanglement state is generated and used, by contrast the state in Grover's algorithm is not an entanglement state. The quantum VQ iteration is a rotation over subspace, by contrast the Grover iteration is a rotation over global space. The quantum VQ iteration extends the Grover iteration to the more complex search that requires more oracles. The method of the quantum VQ iteration is universal.
With the increasing demand for storing images, traditional image compression methods face challenges in balancing the compressed size and image quality. However, the hybrid quantum-classical model can recover this weakness by using the advantage of qubits. In this study, we upgrade a quantum image compression algorithm within parameterized quantum circuits. Our approach encodes image data as unitary operator parameters and applies the quantum compilation algorithm to emulate the encryption process. By utilizing first-order Taylor expansion, we significantly reduce both the computational cost and loss, better than the previous version. Experimental results on benchmark images, including Lenna and Cameraman, show that our method achieves up to 86% reduction in the number of iterations while maintaining a lower compression loss, better for high-resolution images. The results confirm that the proposed algorithm provides an efficient and scalable image compression mechanism, making it a promising candidate for future image processing applications.
High-resolution images are being generated due to the rapid development of image sensors. Various image processing algorithms require images of reduced sizes, given the computational constraints. Hence, preprocessing the images to reduce their size is crucial for many applications. This letter proposes a novel approach to compress images using quantum computing. A comparative study on different standard data encoding techniques used in quantum computing is undertaken. We propose four quantum compression techniques by extending the unitary operations of amplitude embedding for compressing images. The proposed methods provide exponential scaling as amplitude embedding is used, where2n2^{n}2nclassical data values are encoded intonnnqubits. Compression performance, visual evaluation, and objective evaluation are carried out to assess the proposed compression techniques. Our experimental results show that the crucial patterns in images are retained in the compressed images even at 75% compression. The compressed images can be used for postprocessing tasks using classical or quantum computing algorithms.
Quantum computing has emerged as a revolutionary paradigm in numerous fields owing to its basis in quantum mechanical concepts such as quantum entanglement and parallelism. This has potential in various applications including computer vision, particularly, image processing and compression. Applications that depend on largescale image data for storing, processing, and transmission have to rely on compression methods for real-time processing. While the classical methods based on discrete cosine transformations (DCT used in JPEG) and discrete wavelet transformations (DWT) perform image compression efficiently, they suffer from trade-off between loss-less compression and compression ratios. In the current work, we would like to explore the usefulness of implementing quantum wavelet transforms for image compression for better PSNR values and execution times. We compare the application of quantum Haar wavelet transform (QHWT) with different quantum encoding methods such as NASS and FRQI and find that NASS-encoded images on application of QHWT gives better PSNR values and shorter runtime with visibly closer details to the original images, showcasing potential for efficient and faster image compression methods.
We present a hybrid classical-quantum image preparation scheme that reduces the quantum implementation cost of image loading for quantum pixel information encoding (QPIE). The proposed method, termed JPEG-assisted QPIE (JQPIE), loads only the quantized JPEG coefficients into a quantum register, leading to substantial reductions in \texttt{CX} gate count and circuit depth while preserving reconstruction quality comparable to classical JPEG compression. We develop two variants of the hybrid strategy. The first realizes the complete JPEG decompression pipeline coherently by implementing inverse quantization via a block-encoded unitary operator. The second, referred to as \emph{quantization-free JQPIE} (QF-JQPIE), omits quantization altogether, thereby avoiding the probabilistic nature of block-encoded quantization. Numerical simulations on standard benchmark image datasets (USC--SIPI and Kodak) demonstrate that both variants achieve significant constant-factor reductions in \texttt{CX} gate count and circuit depth relative to direct QPIE loading, while maintaining high reconstruction quality as measured by PSNR and SSIM.
Quantum machine learning has established as an interdisciplinary field to overcome limitations of classical machine learning and neural networks. This is a field of research which can prove that quantum computers are able to solve problems with complex correlations between inputs that can be hard for classical computers. This suggests that learning models made on quantum computers may be more powerful for applications, potentially faster computation and better generalization on less data. The objective of this paper is to investigate how training of quantum neural network (QNNs) can be done using quantum optimization algorithms for improving the performance and time complexity of QNNs. A classical neural network can be partially quantized to create a hybrid quantum-classical neural network which is used mainly in classification and image recognition. In this paper, a QNN structure is made where a variational parameterized circuit is incorporated as an input layer named as Variational Quantum Neural Network (VQNNs). We encode the cost function of QNNs onto relative phases of a superposition state in the Hilbert space of the network parameters. The parameters are tuned with an iterative quantum approximate optimisation (QAOA) mixer and problem hamiltonians. VQNNs is experimented with MNIST digit recognition (less complex) and crack image classification datasets (more complex) which converges the computation in lesser time than QNN with decent training accuracy.