Related papers: Quantum Complexity vs Classical Complexity: A Survey

Quantum Complexity vs Classical Complexity: A Survey

URL: http://arxiv.org/abs/2312.14075v5
Date: Wed, 11 Sep 2024 22:11:48 GMT
Title: Quantum Complexity vs Classical Complexity: A Survey
Authors: Arash Vaezi, Ali Movaghar, Mohammad Ghodsi, Seyed Mohammad Hussein Kazemi, Negin Bagheri Noghrehy, Seyed Mohsen Kazemi,
Abstract summary: Adapting problem-solving strategies is crucial to harness the full potential of quantum computing. This paper concentrates on aggregating prior research efforts dedicated to solving intricate classical computational problems through quantum computing.
Score: 2.4302813010040714
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strategies is crucial to harness the full potential of quantum computing. Nonetheless, there are defined boundaries to the capabilities of quantum computing. This paper concentrates on aggregating prior research efforts dedicated to solving intricate classical computational problems through quantum computing. The objective is to systematically compile an exhaustive inventory of these solutions and categorize a collection of demanding open problems that await further exploration. Through statistical analysis, we help the researchers with their further investigations.

Related papers

A Review of Quantum Scientific Computing Algorithms for Engineering Problems [0.0]
Quantum computing, leveraging quantum phenomena like superposition and entanglement, is emerging as a transformative force in computing technology. This paper systematically explores the foundational concepts of quantum mechanics and their implications for computational advancements.
arXiv Detail & Related papers (2024-08-25T21:40:22Z)
Character Complexity: A Novel Measure for Quantum Circuit Analysis [0.0]
This paper introduces Character Complexity, a novel measure that bridges Group-theoretic concepts with practical quantum computing concerns. I prove several key properties of character complexity and establish a surprising connection to the classical simulability of quantum circuits. I present innovative visualization methods for character complexity, providing intuitive insights into the structure of quantum circuits.
arXiv Detail & Related papers (2024-08-19T01:58:54Z)
Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing [2.2989970407820484]
distributed quantum computing aims to boost the computational power of current quantum systems. From quantum communication protocols to entanglement-based distributed algorithms, each aspect contributes to the mosaic of distributed quantum computing. Our objective is to provide an exhaustive overview for experienced researchers and field newcomers.
arXiv Detail & Related papers (2024-04-01T17:38:18Z)
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)
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)
From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
arXiv Detail & Related papers (2022-02-19T02:56:47Z)
Quantum Computing for Location Determination [6.141741864834815]
We introduce an example for the expected gain of using quantum algorithms for location determination research. The proposed quantum algorithm has a complexity that is exponentially better than its classical algorithm version, both in space and running time. We discuss both software and hardware research challenges and opportunities that researchers can build on to explore this exciting new domain.
arXiv Detail & Related papers (2021-06-11T15:39:35Z)
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.