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:2409.14629

Gate Optimization of NEQR Quantum Circuits via PPRM Transformation

Shahab Iranmanesh, Hossein Aghababa, Kazim Fouladi

Published Sep 22, 2024• 2 citations
arXivHTMLPDF

Abstract

Quantum image representation (QIR) is a key challenge in quantum image processing (QIP) due to the large number of pixels in images, which increases the need for quantum gates and qubits. However, current quantum systems face limitations in run-time complexity and available qubits. This work aims to compress the quantum circuits of the Novel Enhanced Quantum Representation (NEQR) scheme by transforming their Exclusive-Or Sum-of-Products (ESOP) expressions into Positive Polarity Reed-Muller (PPRM) equivalents without adding ancillary qubits. Two cases of run-time complexity, exponential and linear, are considered for NEQR circuits with m controlling qubits ($m \rightarrow \infty$), depending on the decomposition of multi-controlled NOT gates. Using nonlinear regression, the proposed transformation is estimated to reduce the exponential complexity from $O(2^m)$ to $O(1.5^m)$, with a compression ratio approaching 100%. For linear complexity, the transformation is estimated to halve the run-time, with a compression ratio approaching 52%. Tests on six 256$\times$256 images show average reductions of 105.5 times for exponential cases and 2.4 times for linear cases, with average compression ratios of 99.05% and 58.91%, respectively.

DOI
10.48550/arxiv.2409.14629

Related papers

Enhancing Image Representation and Compression: An Innovative Nz-Nqer Framework With Block Truncation Quantum Coding

Md Ershadul Haque, Manoranjan Paul, Faranak Tohidi +2 more

Efficiently representing and compressing large-scale images in quantum circuits remains a challenge due to increasing circuit complexity. This paper proposes an innovative approach called NZ-NEQR (Non-Zero Novel Quantum Representation) to tackle this issue. Eliminating zero connections from the existing NEQR approach significantly reduces the complexity of state label preparation. The proposed NZ-NEQR approach achieves remarkable improvements in both image representation and compression, leading to a substantial reduction in required bits per pixel. To further enhance compression, Block Truncation Coding (BTC) is adopted as a compression scheme, which effectively truncates images into two labels suitable for quantum compression and reconstruction. Notably, the proposed method requires fewer bits per pixel compared to existing NEQR approaches. Additionally, NZ-NEQR combined with BTC employs only 5 qubits for representing a $1024 \times 1024$ image, and compression using a $4 \times 4$ quantum BTC block represents a significant advancement. Computational results demonstrate the superior effectiveness of the proposed NZ-NEQR approach combined with BTC for quantum image representation and compression, surpassing the performance of NEQR and JPEG approaches.

International Conference on Digital Image Computing: Techniques and Applications (DICTA)•Nov 28, 2023•5 citations

Multi-strategy based quantum cost reduction of quantum boolean circuits

Taghreed Ahmed, Ahmed Younes, Islam Elkabani

Abstract The construction of quantum computers is based on the synthesis of low-cost quantum circuits. The quantum circuit of any Boolean function expressed in a Positive Polarity Reed-Muller (PPRM) expansion can be synthesized using Multiple-Control Toffoli (MCT) gates. This paper proposes two algorithms to construct a quantum circuit for any Boolean function expressed in a PPRM expansion. The Boolean function can be expressed with various algebraic forms, so there are different quantum circuits can be synthesized for the Boolean function based on its algebraic form. The proposed algorithms aim to map the MCT gates into the NCV gates for any quantum circuit by generating a simple algebraic form for the Boolean function. The first algorithm generates a special algebraic form for any Boolean function by rearrangement of terms of the Boolean function according to a predefined degree of term d term , then synthesizes the corresponding quantum circuit. The second algorithm applies the decomposition methods to decompose MCT circuit into its elementary gates followed by applying a set of simplification rules to simplify and optimize the synthesized quantum circuit. The proposed algorithms achieve a reduction in the quantum cost of synthesized quantum circuits when compared with relevant work in the literature. The proposed algorithms synthesize quantum circuits that can applied on IBM quantum computer.

arXiv:2407.04826•Physica Scripta•Nov 18, 2024•5 citations

Novel quantum circuit for image compression utilizing modified Toffoli gate and quantized transformed coefficient alongside a novel reset gate

Md Ershadul Haque, Manoranjan Paul

Quantum image computing has emerged as a groundbreaking field, revolutionizing how we store and process data at speeds incomparable to classical methods. Nevertheless, as image sizes expand, so does the complexity of qubit connections, posing significant challenges in the efficient representation and compression of quantum images. In response, we introduce a modified Toffoli gate state connection using a quantized transform coefficient preparation process. This innovative strategy streamlines circuit complexity by modifying state connection from the state connection information. In our operational control gates, only input 1 impacts the output, allowing us to modify the state connection and dramatically enhance the efficiency of the proposed circuit. As a result, the proposed approach significantly reduces the number of gates required for both image compression and representation. Our findings reveal that it requires an impressive 44.21 percent fewer gates than existing techniques, such as the Direct Cosine Transform Efficient Flexible Representation of Quantum Images (DCTEFRQI), all while maintaining a consistent peak signal-to-noise ratio (PSNR). For an image block size of 2^Sx2^Sy with q gray levels, the complexity of our approach can be succinctly expressed as, O[3q+log2Sx+log2Sy+2q(log2Sx+log2Sy)]. Here, Sx and Sy represent the X and Y positional control gates while q indicates the non-zero transform coefficients. Moreover, experimental evaluations strongly demonstrate that it excels in both compressing and representing quantum images compared to the DCTEFRQI approach, particularly excelling in the essential metrics of gate requirements and PSNR performance. Embrace the future of quantum imaging with our innovative solution, where efficiency meets excellence.

arXiv:2502.17815•Feb 25, 2025•0 citations

Optimized Quantum Circuits in Quantum Image Processing Using Qiskit

Zahra Boreiri, Alireza Norouzi Azad, N. Majd

Quantum image representation is an essential component of quantum image processing and plays a critical role in quantum information processing. Flexible Representation of Quantum Images (FRQI) presents pixel colors and associated locations as a state to represent images on quantum computers. A fundamental part of the quantum image processing system is quantum image compression (QIC), which is utilized to maintain and retrieve binary images. This compression allows us to minimize the number of controlled rotation gates in the quantum circuits. This paper designed optimized quantum circuits and simulated them using Qiskit on a real quantum computer based on minimum boolean expressions to retrieve the 8×4 binary single-digit images. To demonstrate the feasibility and efficacy of quantum image representation, quantum circuits for images were developed using FRQI, and quantum image representation experiments were done on IBM Quantum Experience (IBMQ). We were able to visualize quantum information by doing the quantum measurement on the image information that we had prepared. Without utilizing this method, the number of controlled rotation gates is equal to the number of pixels in the image; however, we showed that by using the QIC algorithm, we could decrease the number of gates significantly. On these images, the maximum and minimum compression ratios of QIC are 90.63% and 68.75%, respectively.

Iranian Conference on Machine Vision and Image Processing•Feb 23, 2022•10 citations

Quantum pixel representations and compression for N-dimensional images

Mercy G. Amankwah, Daan Camps, E. Wes Bethel +2 more

We introduce a novel and uniform framework for quantum pixel representations that overarches many of the most popular representations proposed in the recent literature, such as (I)FRQI, (I)NEQR, MCRQI, and (I)NCQI. The proposed QPIXL framework results in more efficient circuit implementations and significantly reduces the gate complexity for all considered quantum pixel representations. Our method scales linearly in the number of pixels and does not use ancilla qubits. Furthermore, the circuits only consist of [Formula: see text] gates and [Formula: see text] gates making them practical in the NISQ era. Additionally, we propose a circuit and image compression algorithm that is shown to be highly effective, being able to reduce the necessary gates to prepare an FRQI state for example scientific images by up to 90% without sacrificing image quality. Our algorithms are made publicly available as part of QPIXL++, a Quantum Image Pixel Library.

arXiv:2110.04405•Scientific Reports•May 11, 2022•50 citations

Theoretical and Numerical Analysis of Measurement Limits in Quantum Image Representations: Qubit Lattice, FRQI, and NEQR

Kento Okada, Akira Hasegawa, Yoshihiro Maeda +3 more

With the advancement of quantum computing, quantum image representations (QIRs) have been widely studied as platforms for quantum image processing. While previous studies have focused on theoretical qubit counts and circuit complexities, there has been limited quantitative evaluation of image reconstruction performance from quantum states. In this study, we clarify the theoretical upper bounds of restoration performance for three representative QIRs: qubit lattice (QL), flexible representation of quantum images (FRQI), and novel enhanced quantum representation (NEQR). Also, we validate them through large-scale GPU-based simulations using cuQuantum. Specifically, we (1) derive a prediction formula for PSNR in probabilistic schemes like QL and FRQI, independent of image content and size; (2) show that deterministic schemes like NEQR require a number of samples following a harmonic number for complete restoration; and (3) perform large-scale simulations to verify these findings. These results provide fundamental insights for designing QIRs and their applications on NISQ devices.

IEEE International Conference on Visual Communications and Image Processing (VCIP)•Dec 1, 2025•0 citations
Quantum image representation (QIR) is a key challenge in quantum image processing (QIP) due to the large number of pixels in images, which increases the need for quantum gates and qubits. However, current quantum systems face limitations in run-time complexity and available qubits. This work aims to compress the quantum circuits of the Novel Enhanced Quantum Representation (NEQR) scheme by transforming their Exclusive-Or Sum-of-Products (ESOP) expressions into Positive Polarity Reed-Muller (PPRM) equivalents without adding ancillary qubits. Two cases of run-time complexity, exponential and linear, are considered for NEQR circuits with m controlling qubits (m→∞m \rightarrow \inftym→∞), depending on the decomposition of multi-controlled NOT gates. Using nonlinear regression, the proposed transformation is estimated to reduce the exponential complexity from O(2m)O(2^m)O(2m) to O(1.5m)O(1.5^m)O(1.5m), with a compression ratio approaching 100%. For linear complexity, the transformation is estimated to halve the run-time, with a compression ratio approaching 52%. Tests on six 256×\times×256 images show average reductions of 105.5 times for exponential cases and 2.4 times for linear cases, with average compression ratios of 99.05% and 58.91%, respectively.
Efficiently representing and compressing large-scale images in quantum circuits remains a challenge due to increasing circuit complexity. This paper proposes an innovative approach called NZ-NEQR (Non-Zero Novel Quantum Representation) to tackle this issue. Eliminating zero connections from the existing NEQR approach significantly reduces the complexity of state label preparation. The proposed NZ-NEQR approach achieves remarkable improvements in both image representation and compression, leading to a substantial reduction in required bits per pixel. To further enhance compression, Block Truncation Coding (BTC) is adopted as a compression scheme, which effectively truncates images into two labels suitable for quantum compression and reconstruction. Notably, the proposed method requires fewer bits per pixel compared to existing NEQR approaches. Additionally, NZ-NEQR combined with BTC employs only 5 qubits for representing a 1024×10241024 \times 10241024×1024 image, and compression using a 4×44 \times 44×4 quantum BTC block represents a significant advancement. Computational results demonstrate the superior effectiveness of the proposed NZ-NEQR approach combined with BTC for quantum image representation and compression, surpassing the performance of NEQR and JPEG approaches.
Abstract The construction of quantum computers is based on the synthesis of low-cost quantum circuits. The quantum circuit of any Boolean function expressed in a Positive Polarity Reed-Muller (PPRM) expansion can be synthesized using Multiple-Control Toffoli (MCT) gates. This paper proposes two algorithms to construct a quantum circuit for any Boolean function expressed in a PPRM expansion. The Boolean function can be expressed with various algebraic forms, so there are different quantum circuits can be synthesized for the Boolean function based on its algebraic form. The proposed algorithms aim to map the MCT gates into the NCV gates for any quantum circuit by generating a simple algebraic form for the Boolean function. The first algorithm generates a special algebraic form for any Boolean function by rearrangement of terms of the Boolean function according to a predefined degree of term d term , then synthesizes the corresponding quantum circuit. The second algorithm applies the decomposition methods to decompose MCT circuit into its elementary gates followed by applying a set of simplification rules to simplify and optimize the synthesized quantum circuit. The proposed algorithms achieve a reduction in the quantum cost of synthesized quantum circuits when compared with relevant work in the literature. The proposed algorithms synthesize quantum circuits that can applied on IBM quantum computer.
Quantum image computing has emerged as a groundbreaking field, revolutionizing how we store and process data at speeds incomparable to classical methods. Nevertheless, as image sizes expand, so does the complexity of qubit connections, posing significant challenges in the efficient representation and compression of quantum images. In response, we introduce a modified Toffoli gate state connection using a quantized transform coefficient preparation process. This innovative strategy streamlines circuit complexity by modifying state connection from the state connection information. In our operational control gates, only input 1 impacts the output, allowing us to modify the state connection and dramatically enhance the efficiency of the proposed circuit. As a result, the proposed approach significantly reduces the number of gates required for both image compression and representation. Our findings reveal that it requires an impressive 44.21 percent fewer gates than existing techniques, such as the Direct Cosine Transform Efficient Flexible Representation of Quantum Images (DCTEFRQI), all while maintaining a consistent peak signal-to-noise ratio (PSNR). For an image block size of 2^Sx2^Sy with q gray levels, the complexity of our approach can be succinctly expressed as, O[3q+log2Sx+log2Sy+2q(log2Sx+log2Sy)]. Here, Sx and Sy represent the X and Y positional control gates while q indicates the non-zero transform coefficients. Moreover, experimental evaluations strongly demonstrate that it excels in both compressing and representing quantum images compared to the DCTEFRQI approach, particularly excelling in the essential metrics of gate requirements and PSNR performance. Embrace the future of quantum imaging with our innovative solution, where efficiency meets excellence.
Quantum image representation is an essential component of quantum image processing and plays a critical role in quantum information processing. Flexible Representation of Quantum Images (FRQI) presents pixel colors and associated locations as a state to represent images on quantum computers. A fundamental part of the quantum image processing system is quantum image compression (QIC), which is utilized to maintain and retrieve binary images. This compression allows us to minimize the number of controlled rotation gates in the quantum circuits. This paper designed optimized quantum circuits and simulated them using Qiskit on a real quantum computer based on minimum boolean expressions to retrieve the 8×4 binary single-digit images. To demonstrate the feasibility and efficacy of quantum image representation, quantum circuits for images were developed using FRQI, and quantum image representation experiments were done on IBM Quantum Experience (IBMQ). We were able to visualize quantum information by doing the quantum measurement on the image information that we had prepared. Without utilizing this method, the number of controlled rotation gates is equal to the number of pixels in the image; however, we showed that by using the QIC algorithm, we could decrease the number of gates significantly. On these images, the maximum and minimum compression ratios of QIC are 90.63% and 68.75%, respectively.
We introduce a novel and uniform framework for quantum pixel representations that overarches many of the most popular representations proposed in the recent literature, such as (I)FRQI, (I)NEQR, MCRQI, and (I)NCQI. The proposed QPIXL framework results in more efficient circuit implementations and significantly reduces the gate complexity for all considered quantum pixel representations. Our method scales linearly in the number of pixels and does not use ancilla qubits. Furthermore, the circuits only consist of [Formula: see text] gates and [Formula: see text] gates making them practical in the NISQ era. Additionally, we propose a circuit and image compression algorithm that is shown to be highly effective, being able to reduce the necessary gates to prepare an FRQI state for example scientific images by up to 90% without sacrificing image quality. Our algorithms are made publicly available as part of QPIXL++, a Quantum Image Pixel Library.
With the advancement of quantum computing, quantum image representations (QIRs) have been widely studied as platforms for quantum image processing. While previous studies have focused on theoretical qubit counts and circuit complexities, there has been limited quantitative evaluation of image reconstruction performance from quantum states. In this study, we clarify the theoretical upper bounds of restoration performance for three representative QIRs: qubit lattice (QL), flexible representation of quantum images (FRQI), and novel enhanced quantum representation (NEQR). Also, we validate them through large-scale GPU-based simulations using cuQuantum. Specifically, we (1) derive a prediction formula for PSNR in probabilistic schemes like QL and FRQI, independent of image content and size; (2) show that deterministic schemes like NEQR require a number of samples following a harmonic number for complete restoration; and (3) perform large-scale simulations to verify these findings. These results provide fundamental insights for designing QIRs and their applications on NISQ devices.