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

Electronics

An Overview of Quantum Circuit Design Focusing on Compression and Representation

Md Ershadul Haque, Manoranjan Paul, Faranak Tohidi, Anwaar Ulhaq

Published Dec 27, 2024• 4 citations
Publisher

Abstract

Quantum image computing has attracted attention due to its vast storage capacity and faster image data processing, leveraging unique properties such as parallelism, superposition, and entanglement, surpassing classical computers. Although classical computing power has grown substantially over the last decade, its rate of improvement has slowed, struggling to meet the demands of massive datasets. Several approaches have emerged for encoding and compressing classical images on quantum processors. However, a significant limitation is the complexity of preparing the quantum state, which translates pixel coordinates into corresponding quantum circuits. Current approaches for representing large-scale images require higher quantum resources, such as qubits and connection gates, presenting significant hurdles. This article aims to overview the pixel intensity and state preparation circuits requiring fewer quantum resources and explore effective compression techniques for medium and high-resolution images. It also conducts a comprehensive study of quantum image representation and compression techniques, categorizing methods by grayscale and color image types and evaluating their strengths and weaknesses. Moreover, the efficacy of each model’s compression can guide future research toward efficient circuit designs for medium- to high-resolution images. Furthermore, it is a valuable reference for advancing quantum image processing research by providing a systematic framework for evaluating quantum image compression and representation algorithms.

DOI
10.3390/electronics14010072

Related papers

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

Quantum Image Compression: Fundamentals, Algorithms, and Advances

Sowmik Kanti Deb, W. David Pan

Quantum computing has emerged as a transformative paradigm, with revolutionary potential in numerous fields, including quantum image processing and compression. Applications that depend on large scale image data could benefit greatly from parallelism and quantum entanglement, which would allow images to be encoded and decoded with unprecedented efficiency and data reduction capability. This paper provides a comprehensive overview of the rapidly evolving field of quantum image compression, including its foundational principles, methods, challenges, and potential uses. The paper will also feature a thorough exploration of the fundamental concepts of quantum qubits as image pixels, quantum gates as image transformation tools, quantum image representation, as well as basic quantum compression operations. Our survey shows that work is still sparse on the practical implementation of quantum image compression algorithms on physical quantum computers. Thus, further research is needed in order to attain the full advantage and potential of quantum image compression algorithms on large-scale fault-tolerant quantum computers.

Computers•Jul 25, 2024•33 citations

Efficient image representation and compression for quantum computing by exploiting correlations within qubits and connections

Md Ershadul Haque

In recent years, quantum image computing has gained significant attention due to its ability to provide more data storage and process faster than classical computation. These are possible due to the unique properties of quantum mechanism of parallelism, superposition, and entanglement. Compressing and representing classical image data in the quantum domain, as well as state label preparation complexity, is still a challenging issue. The existing techniques typically directly connect the pixel values and their corresponding state label connection without exploring quantum bits i.e. qubits and connection pattern correlation. As a result, the required number of quantum resources, such as gates and qubits to implement quantum circuits, is quite high. This thesis proposes several novel approaches by exploiting correlations within qubits/connections in the state preparation within pixel domain and transform domain. The existing quantum methods need qubits, and quantum gates to represent both pixel intensity and their corresponding position i.e. state preparation information. To reduce the number of qubits and gates required for state preparation, transformation and quantization are applied to the image data. This is because the transformed coefficients are concentrated in a smaller region compared to the pixel domain, allowing the number of state-preparation qubits to be significantly lower. Theoretical analysis and experimental results show that it provides better compression and representation than existing approaches. To represent the quantized transformed coefficient using the existing quantum representing approach, two control gates are needed, one for opening and another for closing the connection to locate each quantized transformed state value. Due to the repetitive use of the same control gates to locate each quantized state connection, a significant number of quantum resources are still required. Furthermore, resetting the output effect of each quantized transformed coefficient state connection on the qubit introduces redundancy in control gate usage and increases circuit complexity. To address state complexity challenges of the quantized transform coefficient approach, a novel reset gate is introduced that can perform the same task for closing the connection of state position. It modifies the closing state connection that nullifies the previous quantized transformed coefficient state connection effect on the next one, eliminating the need for repetitive use of control gates. Although using the reset gate instead of control gate, the proposed approach improves the compression performance, still, this approach requires higher quantum resources to locate the state position of the quantized transformed coefficient alongside. To address this, a novel control gate state connection approach is proposed. It modifies the quantized transformed coefficient connections by discarding ‘0’ values in the state preparation stage, since only input ‘1’ influences the output. This approach significantly reduces the circuit complexity. The experimental results confirm its superior performance in quantum image compression and representation. The required number of qubits for representing large magnitude of coefficient is sometimes higher for high quality images. To address this, a non-zero state connection of pixel values circuit is proposed on top of the block truncation coding compression approach. This approach is easy to implement, cost-effective, and memory-efficient and requires fewer qubits compared to the transformed-based approach. However, this approach requires more connections to complete the whole image circuit. Recently, an autoencoder-based approach has been used to compress quantum images. The main limitation of the autoencoder approach is that it is only applicable to small-scale images with unclear state compression mechanisms. To overcome this limitation, a parameterized position-aware lossy quantum autoencoder is proposed by utilizing the least significant bit (LSB) as a control qubit for optimized state-label information management. We have used a block-based position-aware LSB control qubit approach to improve further compression efficiency. Comparative analysis shows that it outperforms the existing quantum autoencoder approach in terms of gate efficiency as well as image quality.

•Dec 10, 2025•0 citations

A Survey on Quantum Image Representations: Opportunities, Challenges, and Future Directions in Quantum AI and Machine Learning

Vrushali Nikam, Shirish S. Sane

Quantum Image Representation (QIR) has become a key component of Quantum Image Processing (QIP), enabling the encoding and manipulation of visual data within quantum computing environments.Its integration with Quantum Artificial Intelligence (QAI) and Quantum Machine Learning (QML) has attracted significant research interest due to the potential advantages of quantum parallelism and compact data representation.This survey reviews major QIR techniques, analyzes their encoding strategies and computational characteristics, and examines their opportunities, challenges, and future relevance in quantum AI and machine learning applications.A systematic review of 70 peer-reviewed journal and conference publications published between 1992 and 2025 was conducted.The selected studies were evaluated based on encoding mechanisms, qubit requirements, circuit complexity, retrieval capability, scalability, and suitability for quantum image processing and learning tasks.The review covers prominent QIR models, including FRQI, NEQR, MCQI, QPIE, GQIR, QRMW, and tensor-network-based representations.Comparative analysis reveals important trade-offs between qubit efficiency, encoding complexity, retrieval accuracy, and scalability.Amplitude-based approaches provide compact image encoding but suffer from probabilistic retrieval, whereas basis-state representations offer deterministic recovery at the expense of increased circuit complexity.QIR demonstrates significant potential in image classification, feature extraction, image compression, and hybrid quantum-classical learning frameworks.QIR provides a promising foundation for next-generation quantum-enhanced visual intelligence systems.However, practical implementation remains constrained by state preparation overhead, noise, decoherence, limited qubit availability, and the lack of standardized evaluation frameworks.Future research should focus on scalable encoding methods, fault-tolerant quantum architectures, benchmarking standards, and deeper integration with advanced QML models to accelerate the development of practical quantum image analytics.

International Multidisciplinary Knowledge Exchange Journal•Mar 31, 2026•0 citations

Quantum Quantumization for Image Processing

Jincheng Zhang

This paper explores the application of quantum quantumization for image processing, aiming to improve image compression ratios and quality. The core concept involves transforming images into quantum quantumized information, leveraging the unique properties of quantum computing to perform image processing operations. This approach facilitates both image compression and enhancement. We propose a novel framework utilizing quantum techniques to represent and manipulate image data, offering potential advantages over classical methods, particularly for high-resolution images and complex scenes. The theoretical underpinnings of this work are detailed, focusing on the mathematical formulations involved in the quantum encoding, processing, and decoding stages. We demonstrate the feasibility of this approach and suggest future research directions.

•Aug 29, 2026•0 citations

Quantum image representation and processing: advances and novel approaches

Artyom M. Grigoryan, Alexis A. Gomez, Sos S. Agaian

This work focuses into the emerging field of quantum image representation, which is a key for processing grayscale and color images on quantum computing platforms. We explore foundational methods like the qubit lattice model, the flexible representation for quantum images, the novel enhanced quantum representation, and the generalized quantum image representation, and categorize them into state-based, amplitude-based, and quaternion-based representations - the latter offering holistic color processing. A novel discrete signal representation mapping data on the unit circle will be introduced to simplify the Fourier transform concepts in quantum systems. We will examine crucial quantum operations, including quantum gradients, multiplication, square roots, Fourier transform, and filtering. Challenges in implementing the circular convolution on quantum hardware will be addressed with practical examples such as quantum low-pass and high-pass filters and 3-qubit convolution circuits. Additionally, we will discuss ongoing research into quantum algorithms inspired by classical transform processing, including the Fourier transforms, that leverage quantum states’ unique properties to achieve efficient encoding, transformation, and decoding of images.

Multimodal Image Exploitation and Learning•Jun 9, 2026•0 citations
Quantum image computing has attracted attention due to its vast storage capacity and faster image data processing, leveraging unique properties such as parallelism, superposition, and entanglement, surpassing classical computers. Although classical computing power has grown substantially over the last decade, its rate of improvement has slowed, struggling to meet the demands of massive datasets. Several approaches have emerged for encoding and compressing classical images on quantum processors. However, a significant limitation is the complexity of preparing the quantum state, which translates pixel coordinates into corresponding quantum circuits. Current approaches for representing large-scale images require higher quantum resources, such as qubits and connection gates, presenting significant hurdles. This article aims to overview the pixel intensity and state preparation circuits requiring fewer quantum resources and explore effective compression techniques for medium and high-resolution images. It also conducts a comprehensive study of quantum image representation and compression techniques, categorizing methods by grayscale and color image types and evaluating their strengths and weaknesses. Moreover, the efficacy of each model’s compression can guide future research toward efficient circuit designs for medium- to high-resolution images. Furthermore, it is a valuable reference for advancing quantum image processing research by providing a systematic framework for evaluating quantum image compression and representation algorithms.
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.
Quantum computing has emerged as a transformative paradigm, with revolutionary potential in numerous fields, including quantum image processing and compression. Applications that depend on large scale image data could benefit greatly from parallelism and quantum entanglement, which would allow images to be encoded and decoded with unprecedented efficiency and data reduction capability. This paper provides a comprehensive overview of the rapidly evolving field of quantum image compression, including its foundational principles, methods, challenges, and potential uses. The paper will also feature a thorough exploration of the fundamental concepts of quantum qubits as image pixels, quantum gates as image transformation tools, quantum image representation, as well as basic quantum compression operations. Our survey shows that work is still sparse on the practical implementation of quantum image compression algorithms on physical quantum computers. Thus, further research is needed in order to attain the full advantage and potential of quantum image compression algorithms on large-scale fault-tolerant quantum computers.
In recent years, quantum image computing has gained significant attention due to its ability to provide more data storage and process faster than classical computation. These are possible due to the unique properties of quantum mechanism of parallelism, superposition, and entanglement. Compressing and representing classical image data in the quantum domain, as well as state label preparation complexity, is still a challenging issue. The existing techniques typically directly connect the pixel values and their corresponding state label connection without exploring quantum bits i.e. qubits and connection pattern correlation. As a result, the required number of quantum resources, such as gates and qubits to implement quantum circuits, is quite high. This thesis proposes several novel approaches by exploiting correlations within qubits/connections in the state preparation within pixel domain and transform domain. The existing quantum methods need qubits, and quantum gates to represent both pixel intensity and their corresponding position i.e. state preparation information. To reduce the number of qubits and gates required for state preparation, transformation and quantization are applied to the image data. This is because the transformed coefficients are concentrated in a smaller region compared to the pixel domain, allowing the number of state-preparation qubits to be significantly lower. Theoretical analysis and experimental results show that it provides better compression and representation than existing approaches. To represent the quantized transformed coefficient using the existing quantum representing approach, two control gates are needed, one for opening and another for closing the connection to locate each quantized transformed state value. Due to the repetitive use of the same control gates to locate each quantized state connection, a significant number of quantum resources are still required. Furthermore, resetting the output effect of each quantized transformed coefficient state connection on the qubit introduces redundancy in control gate usage and increases circuit complexity. To address state complexity challenges of the quantized transform coefficient approach, a novel reset gate is introduced that can perform the same task for closing the connection of state position. It modifies the closing state connection that nullifies the previous quantized transformed coefficient state connection effect on the next one, eliminating the need for repetitive use of control gates. Although using the reset gate instead of control gate, the proposed approach improves the compression performance, still, this approach requires higher quantum resources to locate the state position of the quantized transformed coefficient alongside. To address this, a novel control gate state connection approach is proposed. It modifies the quantized transformed coefficient connections by discarding ‘0’ values in the state preparation stage, since only input ‘1’ influences the output. This approach significantly reduces the circuit complexity. The experimental results confirm its superior performance in quantum image compression and representation. The required number of qubits for representing large magnitude of coefficient is sometimes higher for high quality images. To address this, a non-zero state connection of pixel values circuit is proposed on top of the block truncation coding compression approach. This approach is easy to implement, cost-effective, and memory-efficient and requires fewer qubits compared to the transformed-based approach. However, this approach requires more connections to complete the whole image circuit. Recently, an autoencoder-based approach has been used to compress quantum images. The main limitation of the autoencoder approach is that it is only applicable to small-scale images with unclear state compression mechanisms. To overcome this limitation, a parameterized position-aware lossy quantum autoencoder is proposed by utilizing the least significant bit (LSB) as a control qubit for optimized state-label information management. We have used a block-based position-aware LSB control qubit approach to improve further compression efficiency. Comparative analysis shows that it outperforms the existing quantum autoencoder approach in terms of gate efficiency as well as image quality.
Quantum Image Representation (QIR) has become a key component of Quantum Image Processing (QIP), enabling the encoding and manipulation of visual data within quantum computing environments.Its integration with Quantum Artificial Intelligence (QAI) and Quantum Machine Learning (QML) has attracted significant research interest due to the potential advantages of quantum parallelism and compact data representation.This survey reviews major QIR techniques, analyzes their encoding strategies and computational characteristics, and examines their opportunities, challenges, and future relevance in quantum AI and machine learning applications.A systematic review of 70 peer-reviewed journal and conference publications published between 1992 and 2025 was conducted.The selected studies were evaluated based on encoding mechanisms, qubit requirements, circuit complexity, retrieval capability, scalability, and suitability for quantum image processing and learning tasks.The review covers prominent QIR models, including FRQI, NEQR, MCQI, QPIE, GQIR, QRMW, and tensor-network-based representations.Comparative analysis reveals important trade-offs between qubit efficiency, encoding complexity, retrieval accuracy, and scalability.Amplitude-based approaches provide compact image encoding but suffer from probabilistic retrieval, whereas basis-state representations offer deterministic recovery at the expense of increased circuit complexity.QIR demonstrates significant potential in image classification, feature extraction, image compression, and hybrid quantum-classical learning frameworks.QIR provides a promising foundation for next-generation quantum-enhanced visual intelligence systems.However, practical implementation remains constrained by state preparation overhead, noise, decoherence, limited qubit availability, and the lack of standardized evaluation frameworks.Future research should focus on scalable encoding methods, fault-tolerant quantum architectures, benchmarking standards, and deeper integration with advanced QML models to accelerate the development of practical quantum image analytics.
This paper explores the application of quantum quantumization for image processing, aiming to improve image compression ratios and quality. The core concept involves transforming images into quantum quantumized information, leveraging the unique properties of quantum computing to perform image processing operations. This approach facilitates both image compression and enhancement. We propose a novel framework utilizing quantum techniques to represent and manipulate image data, offering potential advantages over classical methods, particularly for high-resolution images and complex scenes. The theoretical underpinnings of this work are detailed, focusing on the mathematical formulations involved in the quantum encoding, processing, and decoding stages. We demonstrate the feasibility of this approach and suggest future research directions.
This work focuses into the emerging field of quantum image representation, which is a key for processing grayscale and color images on quantum computing platforms. We explore foundational methods like the qubit lattice model, the flexible representation for quantum images, the novel enhanced quantum representation, and the generalized quantum image representation, and categorize them into state-based, amplitude-based, and quaternion-based representations - the latter offering holistic color processing. A novel discrete signal representation mapping data on the unit circle will be introduced to simplify the Fourier transform concepts in quantum systems. We will examine crucial quantum operations, including quantum gradients, multiplication, square roots, Fourier transform, and filtering. Challenges in implementing the circular convolution on quantum hardware will be addressed with practical examples such as quantum low-pass and high-pass filters and 3-qubit convolution circuits. Additionally, we will discuss ongoing research into quantum algorithms inspired by classical transform processing, including the Fourier transforms, that leverage quantum states’ unique properties to achieve efficient encoding, transformation, and decoding of images.