Exploring Quantum-Enhanced Machine Learning for Computer Vision: Applications and Insights on Noisy Intermediate-Scale Quantum Devices
- URL: http://arxiv.org/abs/2404.02177v1
- Date: Mon, 1 Apr 2024 20:55:03 GMT
- Title: Exploring Quantum-Enhanced Machine Learning for Computer Vision: Applications and Insights on Noisy Intermediate-Scale Quantum Devices
- Authors: Purnachandra Mandadapu,
- Abstract summary: This study explores the intersection of quantum computing and Machine Learning (ML)
It evaluates the effectiveness of hybrid quantum-classical algorithms, such as the data re-uploading scheme and the patch Generative Adversarial Networks (GAN) model, on small-scale quantum devices.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: As medium-scale quantum computers progress, the application of quantum algorithms across diverse fields like simulating physical systems, chemistry, optimization, and cryptography becomes more prevalent. However, these quantum computers, known as Noisy Intermediate Scale Quantum (NISQ), are susceptible to noise, prompting the search for applications that can capitalize on quantum advantage without extensive error correction procedures. Since, Machine Learning (ML), particularly Deep Learning (DL), faces challenges due to resource-intensive training and algorithmic opacity. Therefore, this study explores the intersection of quantum computing and ML, focusing on computer vision tasks. Specifically, it evaluates the effectiveness of hybrid quantum-classical algorithms, such as the data re-uploading scheme and the patch Generative Adversarial Networks (GAN) model, on small-scale quantum devices. Through practical implementation and testing, the study reveals comparable or superior performance of these algorithms compared to classical counterparts, highlighting the potential of leveraging quantum algorithms in ML tasks.
Related papers
- Quantum Visual Feature Encoding Revisited [8.839645003062456]
This paper revisits the quantum visual encoding strategies, the initial step in quantum machine learning.
Investigating the root cause, we uncover that the existing quantum encoding design fails to ensure information preservation of the visual features after the encoding process.
We introduce a new loss function named Quantum Information Preserving to minimize this gap, resulting in enhanced performance of quantum machine learning algorithms.
arXiv Detail & Related papers (2024-05-30T06:15:08Z) - Scalable Quantum Algorithms for Noisy Quantum Computers [0.0]
This thesis develops two main techniques to reduce the quantum computational resource requirements.
The aim is to scale up application sizes on current quantum processors.
While the main focus of application for our algorithms is the simulation of quantum systems, the developed subroutines can further be utilized in the fields of optimization or machine learning.
arXiv Detail & Related papers (2024-03-01T19:36:35Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Machine learning on quantum experimental data toward solving quantum
many-body problems [0.0]
We demonstrate the successful implementation of classical machine learning algorithms for systems with up to 44 qubits.
We extend the applicability of the hybrid approach to problems of interest in many-body physics.
arXiv Detail & Related papers (2023-10-30T10:25:59Z) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - Quantum Machine Learning: from physics to software engineering [58.720142291102135]
We show how classical machine learning approach can help improve the facilities of quantum computers.
We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
arXiv Detail & Related papers (2023-01-04T23:37:45Z) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - Parametrized Complexity of Quantum Inspired Algorithms [0.0]
Two promising areas of quantum algorithms are quantum machine learning and quantum optimization.
Motivated by recent progress in quantum technologies and in particular quantum software, research and industrial communities have been trying to discover new applications of quantum algorithms.
arXiv Detail & Related papers (2021-12-22T06:19:36Z) - Quantum Machine Learning For Classical Data [0.0]
We study the intersection of quantum computing and supervised machine learning algorithms.
In particular, we investigate what extent quantum computers can be used to accelerate supervised machine learning algorithms.
arXiv Detail & Related papers (2021-05-08T12:11:44Z) - An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem.
The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
arXiv Detail & Related papers (2020-05-06T14:18:44Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.