Related Experiment Video
Updated: Aug 7, 2025

Quantifying Intermembrane Distances with Serial Image Dilations
Published on: September 28, 2018
Advanced quantum image representation and compression using a DCT-EFRQI approach
Md Ershadul Haque1, Manoranjan Paul2, Anwaar Ulhaq2
1School of Computing Mathematics and Engineering, Charles Sturt University, Bathurst, NSW, 2795, Australia. mhaque@csu.edu.au.
Abstract:
In recent years, quantum image computing draws a lot of attention due to storing and processing image data faster compared to classical computers. A number of approaches have been proposed to represent the quantum image inside a quantum computer. Representing and compressing medium and big-size images inside the quantum computer is still challenging. To address this issue, we have proposed a block-wise DCT-EFRQI (Direct Cosine Transform Efficient Flexible Representation of Quantum Image) approach to represent and compress the gray-scale image efficiently to save computational time and reduce the quantum bits (qubits) for the state preparation. In this work, we have demonstrated the capability of block-wise DCT and DWT transformation inside the quantum domain to investigate their relative performances. The Quirk simulation tool is used to design the corresponding quantum image circuit. In the proposed DCT-EFRQI approach, a total of 17 qubits are used to represent the coefficients, the connection between coefficients and state (i.e., auxiliary), and their position for representing and compressing grayscale images inside a quantum computer. Among those, 8 qubits are used to map the coefficient values and the rest are used to generate the corresponding coefficient XY-coordinate position including one auxiliary qubit. Theoretical analysis and experimental results show that the proposed DCT-EFRQI scheme provides better representation and compression compared to DCT-GQIR, DWT-GQIR, and DWT-EFRQI in terms of rate-distortion performance.
Related Concept Videos
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Discrete Fourier Transform
Relation of DFT to z-Transform
To understand how the DFT works, it's helpful to consider the z-transform, which is a method for representing discrete sequences in the complex frequency domain. The z-transform involves summing the...
Discrete-Time Fourier Series
For a discrete-time periodic signal x[n]...
Discrete-time Fourier transform
One of the notable...
Downsampling
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...

