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

Quantum Information and Computation

A novel enhanced quantum image representation based on bit-planes for log-polar coordinates

Xiao Chen, Zhihao Liu, Hanwu Chen, Liang Wang

Published Dec 28, 2021• 1 citation
Publisher

Abstract

Quantum image representation has a significant impact in quantum image processing. In this paper, a bit-plane representation for log-polar quantum images (BRLQI) is proposed, which utilizes $(n+4)$ or $(n+6)$ qubits to store and process a grayscale or RGB color image of $2^n$ pixels. Compared to a quantum log-polar image (QUALPI), the storage capacity of BRLQI improves 16 times. Moreover, several quantum operations based on BRLQI are proposed, including color information complement operation, bit-planes reversing operation, bit-planes translation operation and conditional exchange operations between bit-planes. Combining the above operations, we designed an image scrambling circuit suitable for the BRLQI model. Furthermore, comparison results of the scrambling circuits indicate that those operations based on BRLQI have a lower quantum cost than QUALPI. In addition, simulation experiments illustrate that the proposed scrambling algorithm is effective and efficient.

DOI
10.26421/qic22.1-2-2

Related papers

A Quantum Image Representation Based on Bitplanes

Hai-Sheng Li, Xiao Chen, Haiying Xia +2 more

Quantum image representation plays an important role in quantum image processing. In this paper, a bitplane representation of quantum images (BRQI) is proposed, which uses (n+4) or (n+6) qubits to store a grayscale or RGB color image of 2npixels. Compared with a novel enhanced quantum representation (NEQR), and a novel quantum representation of color digital images (NCQI), the storage capacity of BRQI improves 16 times and 218times, respectively. Next, some quantum operations based on BRQI are proposed, these operations including complement of colors, reverse of bitplanes, and translation of bitplanes. Analyzed the implementation circuits of these operations, the result indicates that these operations based on BRQI have lower quantum cost than NEQR and NCQI. Furthermore, an image scrambling algorithm based on BRQI is presented by combining the above operations. Simulation experiments and performance analysis show that proposed scrambling algorithm is effective and efficient.

IEEE Access•Jan 1, 2018•93 citations

An improved bit-plane representation of quantum image

Jiale Mu, Xiaofei Li, Xiang-Hua Zhang +1 more

Abstract The quantum image representation based on bit-planes (BRQI) is a widely used model in quantum image processing. It utilizes both the superposition and entanglement properties to store the position and color information of an image effectively, but the time complexity is still high(O(2qn22n)). Here, we propose an improved BRQI model, which still uses log2 q + 1 qubits to represent the color information, and has a low time complexity(O(qn22n)). When storing the value of bit-plane, it can use only one controlled operation to store the values of two adjacent bit-planes at the same time, makes the time and space complexity significantly reduced. Moreover, we design a corresponding quantum image compression algorithm. Simulation experimental results show that the compression efficiency of this model is also better than that of the widely used models NEQR and BRQI, and the time complexity of quantum image representation is further reduced. Hence, our findings will be helpful for further developing the quantum image representation and compression algorithm.

•Jul 24, 2024•0 citations

A YCrCb Bit-Plane Quantum Polar Coordinate Representation Model for Color Images

Jiahao Sun, Zhanhong Wei, Xiaolong Yang

Efficient and perceptually faithful encoding of color images remains a key challenge in quantum image representation. Cartesian schemes store whole-pixel values at high qubit cost, whereas many polar models either treat RGB channels uniformly or omit explicit bit-plane indexing. This paper proposes a color quantum representation that organizes luminance and chrominance as independent bit-plane streams on a standard polar sampling grid. Pixel addresses are encoded in |r⟩|ϕ⟩, bit-plane indices in |l⟩, and the corresponding Y , Cr, and Cb bits in three color qubits. The proposed method formalizes the normalized superposition state, derives a three-stage preparation circuit comprising register initialization, address superposition, and controlled bit writing, and describes deterministic retrieval through plane-aware measurement. For an image with 2hpolar samples, the representation requires h + 6 qubits and O(2h+3) preparation gates. State-vector simulation on a ten-qubit instance confirms the correctness of the preparation circuit and the associated plane-aware retrieval procedure. The resulting register organization supports plane-selective perceptual processing and geometry-aware quantum image operations. Comparative analysis shows that combining YCrCb separation with bit-plane polar indexing yields a representation profile distinct from conventional Cartesian, RGB-oriented bit-plane, and whole-pixel perceptual polar encodings.

International Conference on Electronics and Communication, Network and Computer Technology (ECNCT)•Jul 1, 2026•0 citations

A novel representation for Multi-Channel log-polar quantum images

Jianzhi Sang, Shen Wang, Xianhua Song +2 more

Mostly existing quantum image models represent image in Cartesian coor- dinates. Some complicated affine transformation can not be easily handled in Cartesian coordinates. In this paper, a new representation of Multi-Channel log-polar quantum im- age (MCLPQI) sampled in log-polar coordinates is proposed. This form contains the im- age RGB color information and transparency of the corresponding pixel. Then we give the polynomial preparation process which proves that our quantum image representation state can be made in a feasible time complexity. Finally we discussed color transfor- mation among different channels and single channel color transformations, transparency adjustments. Analysis demonstrates that the MCLPQI is a efficient quantum log-polar color image representation.

J. Inf. Hiding Multim. Signal Process.•Jan 1, 2015•1 citation

A multi-channel quantum image representation model with qubit sequences for quantum-inspired image and image retrieval

Nawres A. Alwan, Suzan Jabbar Obaiys, Nadia M. G. Al-Saidi +2 more

Quantum image processing (QIP) has become one of the most significant fields in quantum computing (QC); it merges quantum mechanics with image processing to improve classical image-processing speed, which involves various operations to advance quantum image representation (QIR). Accordingly, we introduce two new QIRs: The first is based on the wavelength and bit plane, called the quantum image representation bit plane (QIRBP), and the second is based on the wavelength and adjacency pixels, which is called the quantum image representation wavelength correlation (QIRWC). The QIRBP model uses $ b+2n+6 $ quantum bit (qubits) to store a digital color image of size $ {2}^{n}\times {2}^{n} $. In contrast, the QIRWC needs $ 2b+4n+8 $ qubits to store a digital color image of size $ {2}^{n}\times {2}^{n} $ and to entangle the wavelength between two neighboring pixels. While the QIRWC approach is more complex, it is also more efficient on the basis of the transformation data. The complexity arises from the level of information being transmitted. In this work, two new representation methods (QIRBP and QIRWC) are proposed to overcome existing QIR weaknesses by enhancing storage efficiency, enabling compact high-resolution representation, improving data transformation through wavelength correlation and pixel adjacency, reducing noise, achieving greater versatility, and advancing scalable QIR. To prove the efficiency of the proposed methods, they were analyzed and compared with other efficient quantum image representations, outlining their similar and different aspects.

AIMS Mathematics•Jan 1, 2025•6 citations

A Block-Based Quantum Image Scrambling for GNEQR

Hai-Sheng Li, Xiao Chen, Shuxiang Song +2 more

Image scrambling on classical computers has been widely studied, however, the corresponding quantum algorithms are rare. This paper proposes a block-based image scrambling scheme for the generalized model of novel enhanced quantum representation (GNEQR). It is not only suit for grayscale images and color images, but also can be used in 2n× 2mimages (i.e., rectangular images). To realize the image scrambling method, we use geometric transformations and an operation of bitplane scrambling to perform position and pixel scrambling, respectively. Furthermore, the complexity of the implementation circuit of the proposed image scrambling is only O(n2) for a 2n× 2nimage. Therefore, it shows our proposed quantum image scrambling is efficient. Then, the result analysis of simulation experiments demonstrates that our proposed image scrambling is effective. In addition, security analysis shows that the proposed scrambling algorithm is secure.

IEEE Access•Jan 1, 2019•28 citations
Quantum image representation has a significant impact in quantum image processing. In this paper, a bit-plane representation for log-polar quantum images (BRLQI) is proposed, which utilizes (n+4)(n+4)(n+4) or (n+6)(n+6)(n+6) qubits to store and process a grayscale or RGB color image of 2n2^n2n pixels. Compared to a quantum log-polar image (QUALPI), the storage capacity of BRLQI improves 16 times. Moreover, several quantum operations based on BRLQI are proposed, including color information complement operation, bit-planes reversing operation, bit-planes translation operation and conditional exchange operations between bit-planes. Combining the above operations, we designed an image scrambling circuit suitable for the BRLQI model. Furthermore, comparison results of the scrambling circuits indicate that those operations based on BRLQI have a lower quantum cost than QUALPI. In addition, simulation experiments illustrate that the proposed scrambling algorithm is effective and efficient.
Quantum image representation plays an important role in quantum image processing. In this paper, a bitplane representation of quantum images (BRQI) is proposed, which uses (n+4) or (n+6) qubits to store a grayscale or RGB color image of 2npixels. Compared with a novel enhanced quantum representation (NEQR), and a novel quantum representation of color digital images (NCQI), the storage capacity of BRQI improves 16 times and 218times, respectively. Next, some quantum operations based on BRQI are proposed, these operations including complement of colors, reverse of bitplanes, and translation of bitplanes. Analyzed the implementation circuits of these operations, the result indicates that these operations based on BRQI have lower quantum cost than NEQR and NCQI. Furthermore, an image scrambling algorithm based on BRQI is presented by combining the above operations. Simulation experiments and performance analysis show that proposed scrambling algorithm is effective and efficient.
Abstract The quantum image representation based on bit-planes (BRQI) is a widely used model in quantum image processing. It utilizes both the superposition and entanglement properties to store the position and color information of an image effectively, but the time complexity is still high(O(2qn22n)). Here, we propose an improved BRQI model, which still uses log2 q + 1 qubits to represent the color information, and has a low time complexity(O(qn22n)). When storing the value of bit-plane, it can use only one controlled operation to store the values of two adjacent bit-planes at the same time, makes the time and space complexity significantly reduced. Moreover, we design a corresponding quantum image compression algorithm. Simulation experimental results show that the compression efficiency of this model is also better than that of the widely used models NEQR and BRQI, and the time complexity of quantum image representation is further reduced. Hence, our findings will be helpful for further developing the quantum image representation and compression algorithm.
Efficient and perceptually faithful encoding of color images remains a key challenge in quantum image representation. Cartesian schemes store whole-pixel values at high qubit cost, whereas many polar models either treat RGB channels uniformly or omit explicit bit-plane indexing. This paper proposes a color quantum representation that organizes luminance and chrominance as independent bit-plane streams on a standard polar sampling grid. Pixel addresses are encoded in |r⟩|ϕ⟩, bit-plane indices in |l⟩, and the corresponding Y , Cr, and Cb bits in three color qubits. The proposed method formalizes the normalized superposition state, derives a three-stage preparation circuit comprising register initialization, address superposition, and controlled bit writing, and describes deterministic retrieval through plane-aware measurement. For an image with 2hpolar samples, the representation requires h + 6 qubits and O(2h+3) preparation gates. State-vector simulation on a ten-qubit instance confirms the correctness of the preparation circuit and the associated plane-aware retrieval procedure. The resulting register organization supports plane-selective perceptual processing and geometry-aware quantum image operations. Comparative analysis shows that combining YCrCb separation with bit-plane polar indexing yields a representation profile distinct from conventional Cartesian, RGB-oriented bit-plane, and whole-pixel perceptual polar encodings.
Mostly existing quantum image models represent image in Cartesian coor- dinates. Some complicated affine transformation can not be easily handled in Cartesian coordinates. In this paper, a new representation of Multi-Channel log-polar quantum im- age (MCLPQI) sampled in log-polar coordinates is proposed. This form contains the im- age RGB color information and transparency of the corresponding pixel. Then we give the polynomial preparation process which proves that our quantum image representation state can be made in a feasible time complexity. Finally we discussed color transfor- mation among different channels and single channel color transformations, transparency adjustments. Analysis demonstrates that the MCLPQI is a efficient quantum log-polar color image representation.
Quantum image processing (QIP) has become one of the most significant fields in quantum computing (QC); it merges quantum mechanics with image processing to improve classical image-processing speed, which involves various operations to advance quantum image representation (QIR). Accordingly, we introduce two new QIRs: The first is based on the wavelength and bit plane, called the quantum image representation bit plane (QIRBP), and the second is based on the wavelength and adjacency pixels, which is called the quantum image representation wavelength correlation (QIRWC). The QIRBP model uses $ b+2n+6 $ quantum bit (qubits) to store a digital color image of size $ {2}^{n}\times {2}^{n} $. In contrast, the QIRWC needs $ 2b+4n+8 $ qubits to store a digital color image of size $ {2}^{n}\times {2}^{n} $ and to entangle the wavelength between two neighboring pixels. While the QIRWC approach is more complex, it is also more efficient on the basis of the transformation data. The complexity arises from the level of information being transmitted. In this work, two new representation methods (QIRBP and QIRWC) are proposed to overcome existing QIR weaknesses by enhancing storage efficiency, enabling compact high-resolution representation, improving data transformation through wavelength correlation and pixel adjacency, reducing noise, achieving greater versatility, and advancing scalable QIR. To prove the efficiency of the proposed methods, they were analyzed and compared with other efficient quantum image representations, outlining their similar and different aspects.
Image scrambling on classical computers has been widely studied, however, the corresponding quantum algorithms are rare. This paper proposes a block-based image scrambling scheme for the generalized model of novel enhanced quantum representation (GNEQR). It is not only suit for grayscale images and color images, but also can be used in 2n× 2mimages (i.e., rectangular images). To realize the image scrambling method, we use geometric transformations and an operation of bitplane scrambling to perform position and pixel scrambling, respectively. Furthermore, the complexity of the implementation circuit of the proposed image scrambling is only O(n2) for a 2n× 2nimage. Therefore, it shows our proposed quantum image scrambling is efficient. Then, the result analysis of simulation experiments demonstrates that our proposed image scrambling is effective. In addition, security analysis shows that the proposed scrambling algorithm is secure.