Related papers: Measures of quantum computing speedup

Quantum algorithms and complexity have recently been studied not only for discrete, but also for some numerical problems. Most attention has been paid so far to the integration problem, for which a speed-up is shown by quantum computers…

Using the simplest but fundamental example, the problem of the infinite potential well, this paper makes an ideological attempt (supported by rigorous mathematical proofs) to approach the issue of…

Quantum computers promise significant speedups in solving problems intractable for conventional computers but, despite recent progress, remain limited in scaling and availability. Therefore, quantum software and hardware development heavily…

Quantum computers, besides offering substantial computational speedups, are also expected to provide the possibility of preserving the privacy of a computation. Here we show the first such experimental demonstration of blind quantum…

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…

A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by taking advantage of non-unitary transformation in ground state quantum computer. The energy gap scale of the ground state quantum computer is analyzed for 3-bit…

The working of a quantum computer is described in the concrete example of a quantum simulator of the single-particle Schrodinger equation. We show that a register of 6-10 qubits is sufficient to realize a useful quantum simulator capable of…

We show that universal quantum computation can be achieved in the standard pure-state circuit model while, at any time, the entanglement entropy of all bipartitions is small---even tending to zero with growing system size. The result is…

Recently, there has been increasing interest in designing schemes for quantum computations that are robust against errors. Although considerable research has been devoted to developing quantum error correction schemes, much less attention…

While extensive research over the past decades has been dedicated to developing scalable quantum computers, the question of their energetic performance has only gained attention more recently, but its importance is now recognized. In fact,…

The prevalent role of force in traditional quantum mechanics is outlined, with special reference to approximate calculations for stationary states. It will be explored how far this force concept can be made useful in the concerned area. The…

With the help of recent developments in quantum algorithms for semidefinite programming, we discuss the possibility for quantum speedup for the numerical conformal bootstrap in conformal field theory. We show that quantum algorithms may…

Quantum computing is usually associated with discrete quantum states and physical quantities possessing discrete eigenvalue spectrum. However, quantum computing in general is any computation accomplished by the exploitation of quantum…

I provide an alternative way of seeing quantum computation. First, I describe an idealized classical problem solving machine that, thanks to a many body interaction, reversibly and nondeterministically produces the solution of the problem…

A recently proposed variational quantum algorithm has expanded the horizon of variational quantum computing to nonlinear physics and fluid dynamics. In this work, we probe the ability of such approaches to capture the ground state of the…

Designing quantum algorithms with a speedup over their classical analogs is a central challenge in quantum information science. Motivated by recent experimental observations of a superlinear quantum speedup in solving the Maximum…

Solutions of quaternionic quantum mechanics (QQM) are difficult to grasp, even in simple physical situations. In this article, we provide simple and understandable free particle quaternionic solutions, that can be easily compared to complex…

In this perspective, we discuss conditions under which it would be possible for a modest fault-tolerant quantum computer to realize a runtime advantage by executing a quantum algorithm with only a small polynomial speedup over the best…

The concept of qudit (a d-level system) cluster state is proposed by generalizing the qubit cluster state (Phys. Rev. Lett. \textbf{86}, 910 (2001)) according to the finite dimensional representations of quantum plane algebra. We…

The problem of estimating the ground-state energy of a quantum system is ubiquitous in chemistry and condensed matter physics. Krylov quantum diagonalization (KQD) has emerged as a promising approach for this task. However, many KQD methods…