English
Related papers

Related papers: An in-principle super-polynomial quantum advantage…

200 papers

In recent years, deep learning has had a profound impact on machine learning and artificial intelligence. At the same time, algorithms for quantum computers have been shown to efficiently solve some problems that are intractable on…

Quantum Physics · Physics 2015-05-25 Nathan Wiebe , Ashish Kapoor , Krysta M. Svore

The discovery of an algorithm for factoring which runs in polynomial time on a quantum computer has given rise to a concerted effort to understand the principles, advantages, and limitations of quantum computing. At the same time, many…

Quantum Physics · Physics 2007-05-23 Chris Adami , Jonathan P. Dowling

The availability of working quantum computers has led to several proposals and claims of quantum advantage. In 2023, this has included claims that quantum computers can successfully factor large integers, by optimizing the search for nearby…

Quantum Physics · Physics 2023-08-16 Willie Aboumrad , Dominic Widdows , Ananth Kaushik

The intensive pursuit for quantum advantage in terms of computational complexity has further led to a modernized crucial question: {\it When and how will quantum computers outperform classical computers?} The next milestone is undoubtedly…

Quantum Physics · Physics 2024-05-07 Nobuyuki Yoshioka , Tsuyoshi Okubo , Yasunari Suzuki , Yuki Koizumi , Wataru Mizukami

For decades, computational chemistry has been posited as one of the areas in which quantum computing would revolutionize. However, the algorithmic advantages that fault-tolerant quantum computers have for chemistry can be overwhelmed by…

Recent technological developments have focused the interest of the quantum computing community on investigating how near-term devices could outperform classical computers for practical applications. A central question that remains open is…

Quantum Physics · Physics 2021-11-24 Daniel Stilck Franca , Raul Garcia-Patron

To date, research in quantum computation promises potential for outperforming classical heuristics in combinatorial optimization. However, when aiming at provable optimality, one has to rely on classical exact methods like integer…

Quantum Physics · Physics 2025-03-13 Friedrich Wagner , Jonas Nüßlein , Frauke Liers

Quantum machine learning techniques are commonly considered one of the most promising candidates for demonstrating practical quantum advantage. In particular, quantum kernel methods have been demonstrated to be able to learn certain…

Variational quantum algorithms are proposed to solve relevant computational problems on near term quantum devices. Popular versions are variational quantum eigensolvers and quantum ap- proximate optimization algorithms that solve ground…

Quantum Physics · Physics 2022-04-15 Lennart Bittel , Martin Kliesch

Quantum machine learning promises to efficiently solve important problems. There are two persistent challenges in classical machine learning: the lack of labeled data, and the limit of computational power. We propose a novel framework that…

Quantum Physics · Physics 2022-10-25 Zhou Shangnan

As we begin to reach the limits of classical computing, quantum computing has emerged as a technology that has captured the imagination of the scientific world. While for many years, the ability to execute quantum algorithms was only a…

Quantum Physics · Physics 2020-11-12 Bela Bauer , Sergey Bravyi , Mario Motta , Garnet Kin-Lic Chan

We present classical and quantum algorithms based on spectral methods for a problem in tensor principal component analysis. The quantum algorithm achieves a quartic speedup while using exponentially smaller space than the fastest classical…

Quantum Physics · Physics 2020-03-04 M. B. Hastings

Feedback-based quantum optimization is a quantum approach to combinatorial optimization. In this paper, we introduce the classical counterpart of feedback-based quantum optimization by using the quantum-classical correspondence of spin…

Quantum Physics · Physics 2026-05-14 Tomohiro Hattori , Takuya Hatomura

Many modern asymmetric encryption methods rely on prime numbers, as they have distinctive properties. For instance, the security of RSA cryptosystem relies on the computational difficulty of factoring a large composite number in its prime…

Cryptography and Security · Computer Science 2026-05-19 Anas A. Abudaqa , Nujud Alyami , Mostefa Kara , Farid Binbeshr , Muhammad Imam , Amjad Abuhassan

A central task in the field of quantum computing is to find applications where quantum computer could provide exponential speedup over any classical computer. Machine learning represents an important field with broad applications where…

Quantum Physics · Physics 2017-11-07 Xun Gao , Zhengyu Zhang , Luming Duan

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…

Quantum Physics · Physics 2017-02-20 Peter W. Shor

Quantum computers take advantage of interfering quantum alternatives in order to handle problems that might be too time consuming with algorithms based on classical logic. Developing quantum computers requires new ways of thinking beyond…

Quantum Physics · Physics 2014-09-10 W. C. Parke

Fuelled by increasing computer power and algorithmic advances, machine learning techniques have become powerful tools for finding patterns in data. Since quantum systems produce counter-intuitive patterns believed not to be efficiently…

Quantum Physics · Physics 2018-05-14 Jacob Biamonte , Peter Wittek , Nicola Pancotti , Patrick Rebentrost , Nathan Wiebe , Seth Lloyd

Quantum computers are able to outperform classical algorithms. This was long recognized by the visionary Richard Feynman who pointed out in the 1980s that quantum mechanical problems were better solved with quantum machines. It was only in…

Most continuous mathematical formulations arising in science and engineering can only be solved numerically and therefore approximately. We shall always assume that we're dealing with a numerical approximation to the solution. There are two…

Quantum Physics · Physics 2007-12-10 A. Papageorgiou , J. F. Traub