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

Scientific Reports

Advanced quantum image representation and compression using a DCT-EFRQI approach

Md Ershadul Haque, Manoranjan Paul, Anwaar Ulhaq, Tanmoy Debnath

Published Mar 13, 2023• 33 citations
Publisher

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.

DOI
10.1038/s41598-023-30575-2

Related papers

Advanced quantum image representation and compression using a DCTEFRQI approach

Md Ershadul Haque, Manoranjan Paul, Anwar Ulhoq +1 more

Abstract In recent years, quantum image processing got a lot of attention in the field of image processing due to the opportunity to place huge image data in quantum Hilbert space. Hilbert space or Euclidean space has infinite dimensions to locate and process the image data faster. Moreover, several types of research show that the computational time of the quantum process is faster than classical computers. Encoding and compressing the image in the quantum domain is still a challenging issue. From the literature survey, we have proposed a DCT-EFRQI (Direct Cosine Transform Efficient Flexible Representation of Quantum Image) algorithm to represent and compress gray image efficiently which save computational time and minimize the complexity of preparation. This work aims to represent and compress various gray image sizes in quantum computers using the DCT (Discrete Cosine Transform) and EFRQI (Efficient Flexible Representation of Quantum Image) approaches together. The Quirk simulation tool is used to design the corresponding quantum image circuit. Due to the limitation of qubits, a total of 16 numbers of qubits is used to represent the coefficient and its position of the grayscale image. Among those, 8 number of qubits are used to map the coefficient values and the rest are used to generate the corresponding coefficient XY-coordinate position. 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 PSNR(Peak Signal to Noise Ratio), and bit rate.

•Oct 14, 2022•0 citations

Advance quantum image representation and compression using DCTEFRQI approach

Md Ershadul Haque, Manoranjon Paul, Anwaar Ulhaq +1 more

In recent year, quantum image processing got a lot of attention in the field of image processing due to opportunity to place huge image data in quantum Hilbert space. Hilbert space or Euclidean space has infinite dimension to locate and process the image data faster. Moreover, several researches show that, the computational time of quantum process is faster than classical computer. By encoding and compressing the image in quantum domain is still challenging issue. From literature survey, we have proposed a DCTEFRQI (Direct Cosine Transform Efficient Flexible Representation of Quantum Image) algorithm to represent and compress gray image efficiently which save computational time and minimize the complexity of preparation. 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. Quirk simulation tool is used to design corresponding quantum image circuit. Due to limitation of qubit, total 16 numbers of qubit are used to represent the gray scale image among those 8 are used to map the coefficient values and the rest 8 are used to generate the corresponding coefficient position. Theoretical analysis and experimental result show that, proposed DCTEFRQI scheme provides better representation and compression compare to DCT-GQIR, DWT-GQIR and DWT-EFRQI in terms of PSNR(Peak Signal to Noise Ratio) and bit rate..

arXiv:2208.14277•Aug 30, 2022•1 citation

Block-Wise Compression Of The Quantum Gray-Scale Image Using Lossy Preparation Approach

Md Ershadul Haque, Manoranjan Paul

Quantum computing draws huge attention due to the multidimensional information processing capability of the processor at the same time. The main idea of quantum imaging is to represent pixel intensities and their state using standard quantum circuits. For a medium or larger size image, the state label circuit takes more qubits as well as requires a huge connection leading to circuit complexity. In this work, a block-wise lossy SCMNEQR (state connection modification novel enhanced quantum representation) approach has been proposed to address more qubit connection issues. The average computation time decreased by 99.66% and 7.39% compared to the JPEG and DCT-EFRQI approaches respectively. The experimental results show that it outperforms the DCT-EFRQI (discrete cosine transform- efficient flexible representation of the quantum image) approach in terms of both representation and compression due to the use of block-wise division of transfer coefficient and state label alongside a novel reset gate.

IEEE International Conference on Multimedia and Expo (ICME)•Jul 15, 2024•2 citations

Block-wise quantum grayscale image representation and compression scheme using state connection

Md Ershadul Haque, Manoranjan Paul, Anwaar Ulhaq +1 more

Quantum computing draws huge attention due to its faster computational capability compared to classical computing to represent and compress the classical image data into the quantum domain. The main idea of quantum domain representation is to convert pixel intensities and their coordinates i.e. state label preparation using quantum bits i.e. Qubits. For a bigger size image, the state label preparation takes more Qubits. To address more Qubits issues, a novel SCMNEQR (State Connection Modification Novel Enhanced Quantum Representation) approach has been proposed that uses fewer qubits to map the arbitrary size of the grayscale image using block-wise state label preparation. The proposed SCMNEQR approach introduces the state connection using a reset gate rather than repeating the use of the Toffoli gate used in the existing approach. The experimental results show that the proposed approach outperforms the existing methods in terms of compression.

arXiv:2212.09222•Dec 19, 2022•1 citation

A New Way to Represent an Image in the Quantum Circuit for Compression and Representation Perspective

Md Ershadul Haque, Faranak Tohidi, Anwaar Ulhaq

Quantum image processing has recently received much attention due to the opportunity to place image data in quantum mechanics systems. The literature survey has shown that the complexity of preparing image data raises the question of how and in what efficient way a medium- and high-size image is represented inside the quantum domain, which is still a big question. Quantum properties such as entanglement, superposition, and parallelism make the quantum system faster and more robust. Qubit is the central basic unit that maps the image data in the quantum processor, which propagates from left to right. The number of qubits and their connection determine the efficiency of the circuit architecture. This chapter aims to investigate the performance of the transformed coefficient-based quantum image representation and compression approaches in terms of the required number of gates and PSNR values. Moreover, the challenges and prospects of quantum image compression and processing will be discussed as a future research direction.

IGI Global eBooks•May 1, 2025•0 citations

Simulation of Quantum Discrete Cosine Transform for Grayscale Image Compression Using Qiskit

Felix Montalfu, Seham Al Abdul Wahid, Farah Mohammadi +1 more

The Discrete Cosine Transform (DCT) is an integral part of classical image compression, which becomes the basis of the JPEG standard. With advances in quantum computing, there is growing interest in exploring quantum analogues of classical algorithms for such transforms. This paper presents a simulation of the Quantum Discrete Cosine Transform (QDCT) using the Qiskit Python library, applied to standard grayscale images segmented into 8x8 and 4x4 blocks. The QDCT algorithm is formulated as a unitary operator and evaluated using state-vector simulation. Due to the current constraints of quantum hardware and challenges in circuit synthesis, this study focused on simulation results, as direct quantum circuit measurement leads to amplitude collapse and unusable output. The performance of QDCT is quantitative compared to classical DCT using Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Index (SSIM), and compression ratio metrics. The result of this study reveals the feasibility and current limitations of QDCT-based image compression while providing a reproducible benchmark for future quantum image processing research. This study offers a realistic assessment of the potential and technical limitations of QDCT in the context of emerging quantum technologies.

IEEE Access•Jan 1, 2025•3 citations
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.
Abstract In recent years, quantum image processing got a lot of attention in the field of image processing due to the opportunity to place huge image data in quantum Hilbert space. Hilbert space or Euclidean space has infinite dimensions to locate and process the image data faster. Moreover, several types of research show that the computational time of the quantum process is faster than classical computers. Encoding and compressing the image in the quantum domain is still a challenging issue. From the literature survey, we have proposed a DCT-EFRQI (Direct Cosine Transform Efficient Flexible Representation of Quantum Image) algorithm to represent and compress gray image efficiently which save computational time and minimize the complexity of preparation. This work aims to represent and compress various gray image sizes in quantum computers using the DCT (Discrete Cosine Transform) and EFRQI (Efficient Flexible Representation of Quantum Image) approaches together. The Quirk simulation tool is used to design the corresponding quantum image circuit. Due to the limitation of qubits, a total of 16 numbers of qubits is used to represent the coefficient and its position of the grayscale image. Among those, 8 number of qubits are used to map the coefficient values and the rest are used to generate the corresponding coefficient XY-coordinate position. 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 PSNR(Peak Signal to Noise Ratio), and bit rate.
In recent year, quantum image processing got a lot of attention in the field of image processing due to opportunity to place huge image data in quantum Hilbert space. Hilbert space or Euclidean space has infinite dimension to locate and process the image data faster. Moreover, several researches show that, the computational time of quantum process is faster than classical computer. By encoding and compressing the image in quantum domain is still challenging issue. From literature survey, we have proposed a DCTEFRQI (Direct Cosine Transform Efficient Flexible Representation of Quantum Image) algorithm to represent and compress gray image efficiently which save computational time and minimize the complexity of preparation. 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. Quirk simulation tool is used to design corresponding quantum image circuit. Due to limitation of qubit, total 16 numbers of qubit are used to represent the gray scale image among those 8 are used to map the coefficient values and the rest 8 are used to generate the corresponding coefficient position. Theoretical analysis and experimental result show that, proposed DCTEFRQI scheme provides better representation and compression compare to DCT-GQIR, DWT-GQIR and DWT-EFRQI in terms of PSNR(Peak Signal to Noise Ratio) and bit rate..
Quantum computing draws huge attention due to the multidimensional information processing capability of the processor at the same time. The main idea of quantum imaging is to represent pixel intensities and their state using standard quantum circuits. For a medium or larger size image, the state label circuit takes more qubits as well as requires a huge connection leading to circuit complexity. In this work, a block-wise lossy SCMNEQR (state connection modification novel enhanced quantum representation) approach has been proposed to address more qubit connection issues. The average computation time decreased by 99.66% and 7.39% compared to the JPEG and DCT-EFRQI approaches respectively. The experimental results show that it outperforms the DCT-EFRQI (discrete cosine transform- efficient flexible representation of the quantum image) approach in terms of both representation and compression due to the use of block-wise division of transfer coefficient and state label alongside a novel reset gate.
Quantum computing draws huge attention due to its faster computational capability compared to classical computing to represent and compress the classical image data into the quantum domain. The main idea of quantum domain representation is to convert pixel intensities and their coordinates i.e. state label preparation using quantum bits i.e. Qubits. For a bigger size image, the state label preparation takes more Qubits. To address more Qubits issues, a novel SCMNEQR (State Connection Modification Novel Enhanced Quantum Representation) approach has been proposed that uses fewer qubits to map the arbitrary size of the grayscale image using block-wise state label preparation. The proposed SCMNEQR approach introduces the state connection using a reset gate rather than repeating the use of the Toffoli gate used in the existing approach. The experimental results show that the proposed approach outperforms the existing methods in terms of compression.
Quantum image processing has recently received much attention due to the opportunity to place image data in quantum mechanics systems. The literature survey has shown that the complexity of preparing image data raises the question of how and in what efficient way a medium- and high-size image is represented inside the quantum domain, which is still a big question. Quantum properties such as entanglement, superposition, and parallelism make the quantum system faster and more robust. Qubit is the central basic unit that maps the image data in the quantum processor, which propagates from left to right. The number of qubits and their connection determine the efficiency of the circuit architecture. This chapter aims to investigate the performance of the transformed coefficient-based quantum image representation and compression approaches in terms of the required number of gates and PSNR values. Moreover, the challenges and prospects of quantum image compression and processing will be discussed as a future research direction.
The Discrete Cosine Transform (DCT) is an integral part of classical image compression, which becomes the basis of the JPEG standard. With advances in quantum computing, there is growing interest in exploring quantum analogues of classical algorithms for such transforms. This paper presents a simulation of the Quantum Discrete Cosine Transform (QDCT) using the Qiskit Python library, applied to standard grayscale images segmented into 8x8 and 4x4 blocks. The QDCT algorithm is formulated as a unitary operator and evaluated using state-vector simulation. Due to the current constraints of quantum hardware and challenges in circuit synthesis, this study focused on simulation results, as direct quantum circuit measurement leads to amplitude collapse and unusable output. The performance of QDCT is quantitative compared to classical DCT using Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Index (SSIM), and compression ratio metrics. The result of this study reveals the feasibility and current limitations of QDCT-based image compression while providing a reproducible benchmark for future quantum image processing research. This study offers a realistic assessment of the potential and technical limitations of QDCT in the context of emerging quantum technologies.