This paper proposes a new algorithm for binarizing the grayscale quantum images represented by novel enhanced quantum image representation(NEQR) through pixel qubit flipping. The algorithm consists of two steps: the first step performs the qubit state checking, and the second completes pixel qubit flipping based on the results in previous step. The key data analysis shows that our algorithm has the following advantages, which include: (1) Contrasting with the probable algorithm, the result of this paper is deterministic( without error). (2) Comparing with the latest result, our paper has some superior characters: fewer quantum gates, fewer auxiliary qubits and less quantum delay.
This paper proposes a new algorithm for binarizing the grayscale quantum images represented by novel enhanced quantum image representation(NEQR) through pixel qubit flipping. The algorithm consists of two steps: the first step performs the qubit state checking, and the second completes pixel qubit flipping based on the results in previous step. The key data analysis shows that our algorithm has the following advantages, which include: (1) Contrasting with the probable algorithm, the result of this paper is deterministic( without error). (2) Comparing with the latest result, our paper has some superior characters: fewer quantum gates, fewer auxiliary qubits and less quantum delay.
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.
The classical image segmentation algorithm based on local adaptive threshold can effectively segment images with uneven illumination, but with the increase of the image data, the real-time problem gradually emerges. In this paper, a quantum segmentation algorithm based on local adaptive threshold for NEQR image is proposed, which can use quantum mechanism to simultaneously compute local thresholds for all pixels in a gray-scale image and quickly segment the image into a binary image. In addition, several quantum circuit units, including median calculation, quantum binarization, etc. are designed in detail, and then a complete quantum circuit is designed to segment NEQR images by using fewer qubits and quantum gates. For a [Formula: see text] image with [Formula: see text] gray-scale levels, the complexity of our algorithm can be reduced to O[Formula: see text], which is an exponential speedup compared to the classic counterparts. Finally, the experiment is conducted on IBM Q to show the feasibility of our algorithm in the noisy intermediate-scale quantum (NISQ) era.
Quantum image representation (QIR) is the basic idea behind quantum image processing. It explains how a normal image is converted into quantum states so that it can be processed using quantum computers. The commonly used models for QIR are Flexible Representation of Quantum Images (FRQIs) and Novel Enhanced Quantum Representation (NEQR). Though these approaches highlight the potential of quantum-based image encoding, the limitation of practical applicability on Noisy Intermediate-Scale Quantum (NISQ) devices exists. In this paper, we propose an intensity-preserving quantum image representation (IP-QIR) scheme that aims to maintain accurate grayscale intensity information while significantly reducing quantum resource usage. The proposed method employs a controlled rotation-based encoding strategy, where pixel intensities are embedded into the measurement probability of a single intensity qubit, and spatial information is represented using position qubits. To further enhance feasibility on near-term quantum hardware, the framework operates on small image patches instead of full-resolution images, thereby reducing circuit depth and overall complexity. The performance of the proposed IP-QIR approach is evaluated through IBM Qiskit simulations on three types of grayscale images: synthetic image patches, synthetic aperture radar (SAR) images, and medical tuberculosis (TB) chest X-ray images. Experimental results demonstrate that IP-QIR achieves better intensity preservation than FRQIs and NEQR, with fidelity values reaching up to 84.12% for both SAR and medical datasets. In addition, IP-QIR represents a 4×4 image patch using only five qubits, which significantly reduces the qubit requirement when compared to NEQR, while still preserving high reconstruction accuracy.
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.
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.
Image segmentation is a fundamental operation in computer vision, used to partition an image into meaningful regions according to various attributes or spatial relationships among pixels. This paper presents a novel quantum circuit for two-threshold image segmentation implemented in the Novel Enhanced Quantum Representation (NEQR) format. Threshold-based segmentation is particularly attractive for quantum implementation due to its conceptual simplicity and inherent parallelism, but existing approaches suffer from a critical correctness issue: quantum RESET operations are applied to auxiliary qubits that may become entangled with the image data register during the segmentation process. We demonstrate, both theoretically and experimentally, that such RESET operations implicitly perform a measurement that collapses the superposition of the entangled quantum state, leading to non-reproducible segmentation results across repeated executions. To address this limitation, we propose a seven-step quantum segmentation pipeline that explicitly preserves entanglement integrity by allocating dedicated auxiliary qubits for each comparison stage, thereby eliminating unsafe qubit reuse. The proposed circuit encodes pixel intensities using the NEQR representation, applies upper and lower threshold comparators in sequence, and integrates both comparison outcomes to classify pixels into three intensity regions. Experiments conducted on a Qiskit StatevectorSimulator demonstrate that the proposed design produces stable and reproducible segmentation results across all test images, in contrast to the inconsistent behaviour observed in prior work. For images requiring 33 qubits, simulations consumed up to 128 GB of RAM with a total execution time of approximately 27 h on an Intel® Xeon® Gold 6240 CPU @ 2.60 GHz. The proposed approach establishes a robust foundation for quantum image segmentation on future fault-tolerant hardware.