We report a similarity measurement algorithm, based on quantum optics formulation, where a coherent state is used as the elementary quantum resource. The algorithm is demonstrated for an image database and we provide an architecture with constituent optical elements in linear order with respect to the image resolution. The obtained phase-distributed multimode coherent state is fed into an image retrieval scheme and we identify the appropriate laser intensity parameter for similarity measurement. We demonstrate the viability of the protocol through an objective quality assessment of images by adding consecutive layers of noises. The results are in good agreement with the expected outcome. The image distortion-sensitivity analysis of the metric establishes the further merit of the model. Our quantum algorithm has wider applicability also in supervised machine learning tasks.
We report a similarity measurement algorithm, based on quantum optics formulation, where a coherent state is used as the elementary quantum resource. The algorithm is demonstrated for an image database and we provide an architecture with constituent optical elements in linear order with respect to the image resolution. The obtained phase-distributed multimode coherent state is fed into an image retrieval scheme and we identify the appropriate laser intensity parameter for similarity measurement. We demonstrate the viability of the protocol through an objective quality assessment of images by adding consecutive layers of noises. The results are in good agreement with the expected outcome. The image distortion-sensitivity analysis of the metric establishes the further merit of the model. Our quantum algorithm has wider applicability also in supervised machine learning tasks.
An enhanced quantum-based image fidelity metric, the QIFM metric, is proposed as a tool to assess the “congruity” between two or more quantum images. The often confounding contrariety that distinguishes between classical and quantum information processing makes the widely accepted peak-signal-to-noise-ratio (PSNR) ill-suited for use in the quantum computing framework, whereas the prohibitive cost of the probability-based similarity score makes it imprudent for use as an effective image quality metric. Unlike the aforementioned image quality measures, the proposed QIFM metric is calibrated as a pixel difference-based image quality measure that is sensitive to the intricacies inherent to quantum image processing (QIP). As proposed, the QIFM is configured with in-built non-destructive measurement units that preserve the coherence necessary for quantum computation. This design moderates the cost of executing the QIFM in order to estimate congruity between two or more quantum images. A statistical analysis also shows that our proposed QIFM metric has a better correlation with digital expectation of likeness between images than other available quantum image quality measures. Therefore, the QIFM offers a competent substitute for the PSNR as an image quality measure in the quantum computing framework thereby providing a tool to effectively assess fidelity between images in quantum watermarking, quantum movie aggregation and other applications in QIP.
This paper introduces a study on fuzzy-based approaches aimed at addressing a crucial task in quantum computation: the evaluation of the similarity between quantum states. A quantum state is a mathematical entity that provides a probability distribution for the outcomes of each possible measurement of a quantum algorithm. Because quantum computers are still characterized by high noise in computation, output quantum states generated by quantum algorithms could be very far to be close to the ideal output quantum state computed by a noiseless quantum computer. As a consequence, there is a strong emergence for measures capable of assessing the similarity level of two quantum states, one ideal and the other real, to infer the quality of a quantum device in performing precise calculations and design appropriate quantum error correction schemes. This research proves that fuzzy methods are fully suitable to face this crucial challenge in a pioneering scenario such as that of quantum computing, as proved by their application on well-known quantum algorithms, such as Bernstein-Vazirani and Grover's algorithm.
A quantum image searching method is proposed based on the probability distributions of the readouts from the quantum measurements. It is achieved by using low computational resources which are only a single Hadamard gate combined with m + 1 quantum measurement operations. To validate the proposed method, a simulation experiment is used where the image with the highest similarity value of 0.93 to the particular test image is retrieved as the search result from 4 × 4 binary image database. The proposal provides a basic step for designing a search engine on quantum computing devices where the image in the database is retrieved based on its similarity to the test image.
The measurement of image similarity represents a fundamental task within the domain of image processing, enabling the application of sophisticated computational techniques to ascertain the degree of similarity between two images. To enhance the performance of these similarity measurement algorithms, the academic community has investigated a range of quantum algorithms. Notably, the swap test-based quantum inner product algorithm (ST-QIP) has emerged as a pivotal method for computing image similarity. However, the inherent destructive nature of the swap test necessitates multiple quantum state evolutions and measurements, which leads to consumption of quantum resources and prolonged computational time, ultimately constraining its practical applicability. To address these limitations, this study introduces an advanced quantum inner product algorithm based on amplitude estimation (AE-QIP) designed to compute image similarity. This innovative approach circumvents the repetitive measurement processes associated with the swap test, thereby optimizing the utilization of quantum resources and substantially enhancing the algorithm's performance. We conducted experiments using a quantum simulator to implement the AE-QIP algorithm and evaluate its effectiveness in the image retrieval tasks. It is found that the AE-QIP algorithm achieves comparable precision to the ST-QIP algorithm while exhibiting significant reductions in qubit consumption and average processing time. Additionally, our findings suggest that increasing the number of ancillary qubits can further enhance the accuracy of the AE-QIP algorithm. Overall, within the acceptable error thresholds, the AE-QIP algorithm exhibits enhanced efficiency relative to the ST-QIP algorithm. However, significant further research is needed to address the challenges involved in optimizing the performance of quantum retrieval systems as a whole.
Large machine learning models based on Convolutional Neural Networks (CNNs) with rapidly increasing numbers of parameters are being deployed in a wide array of computer vision tasks. However, the insatiable demand for computing resources required to train these models is fast outpacing the advancement of classical computing hardware, and new frameworks including Optical Neural Networks (ONNs) and quantum computing are being explored as future alternatives. In this work, we report a novel quantum computing based deep learning model, the Quantum Optical Convolutional Neural Network (QOCNN), to alleviate the computational bottleneck in future computer vision applications. Using the MNIST dataset, we have benchmarked this new architecture against a traditional CNN model based on the seminal LeNet architecture. We have also compared the performance against previously reported ONNs, the GridNet and ComplexNet, and a Quantum Optical Neural Network (QONN) that we built by combining the ComplexNet with quantum-inspired sinusoidal nonlinearities. Our work extends the prior research on QONN by adding quantum convolution and pooling layers. We have evaluated the models using the metrics of accuracies, confusion matrices, Receiver Operating Characteristic curves, and Matthews Correlation Coefficients. The performance of the models were similar, and the metrics indicated that the new QOCNN model is robust. Finally, we estimated the gains in computational efficiencies from executing this novel framework on a quantum computer, concluding that switching to a quantum computing based approach to deep learning may result in comparable accuracies to classical models while simultaneously achieving unprecedented boosts in computational performances and power allocation.
Abstract Deep neural networks were previously used in the arena of image retrieval. Siamese network architecture is also used for image similarity comparison. Recently, the application of quantum computing in different fields has gained research interest. Researchers are keen to explore the prospect of quantum circuit implementation in terms of supervised learning, resource utilization, and energy‐efficient reversible computing. In this study, the authors propose an application of quantum circuit in Siamese architecture and explored its efficiency in the field of exudate‐affected retinal image patch retrieval. Quantum computing applied within Siamese network architecture may be effective for image patch characteristic comparison and retrieval work. Although there is a restriction of managing high‐dimensional inner product space, the circuit with a limited number of qubits represents exudate‐affected retinal image patches and retrieves similar patches from the patch database. Parameterized quantum circuit (PQC) is implemented using a quantum machine learning library on Google Cirq framework. PQC model is composed of classical pre/post‐processing and parameterized quantum circuit. System efficiency is evaluated with the most widely used retrieval evaluation metrics: mean average precision (MAP) and mean reciprocal rank (MRR). The system achieved an encouraging and promising result of 98.1336% MAP and 100% MRR. Image pixels are implicitly converted to rectangular grid qubits in this experiment. The experimentation was further extended to IBM Qiskit framework also. In Qiskit, individual pixels are explicitly encoded using novel enhanced quantum representation (NEQR) image encoding algorithm. The probability distributions of both query and database patches are compared through Jeffreys distance to retrieve similar patches.