Related papers: Quantum techniques for eigenvalue problems
Quantum algorithms for both differential equation solving and for machine learning potentially offer an exponential speedup over all known classical algorithms. However, there also exist obstacles to obtaining this potential speedup in…
This article surveys the state of the art in quantum computer algorithms, including both black-box and non-black-box results. It is infeasible to detail all the known quantum algorithms, so a representative sample is given. This includes a…
This document is a pdf version of the series of blogposts about variational quantum algorithms (VQA) I originally posted on my blog Musty Thoughts. It provides an explanation of the basic variational algorithms, such as Variational Quantum…
Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the remarkable efficiency in factoring a positive integer and searching databases faster than any currently known classical computing…
Estimating the eigenvalues of a unitary transformation U by standard phase estimation requires the implementation of controlled-U-gates which are not available if U is only given as a black box. We show that a simple trick allows to measure…
We describe a new polynomial time quantum algorithm that uses the quantum fast fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases (commonly found in ab initio physics and…
Implementation of quantum logical gates for multilevel system is demonstrated through decoherence control under the quantum adiabatic method using simple phase modulated laser pulses. We make use of selective population inversion and…
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…
Solving linear systems and computing eigenvalues are two fundamental problems in linear algebra. For solving linear systems, many efficient quantum algorithms have been discovered. For computing eigenvalues, currently, we have efficient…
Quantum phase estimation provides a path to quantum computation of solutions to Hermitian eigenvalue problems $Hv = \lambda v$, such as those occurring in quantum chemistry. It is natural to ask whether the same technique can be applied to…
Quantum algorithms speeding up classical counterparts are proposed for the problems: 1. Recognition of eigenvalues with fixed precision. Given a quantum circuit generating unitary mapping $U$ and a complex number the problem is to determine…
Quantum adiabatic algorithm is of vital importance in quantum computation field. It offers us an alternative approach to manipulate the system instead of quantum gate model. Recently, an interesting work arXiv:1805.10549 indicated that we…
We discuss in this chapter the basics of adiabatic computation, as well as some physical implementations. After a short introduction of the quantum circuit model, we describe quantum adiabatic computation, quantum annealing, and the strong…
A unified approach, for solving a wide class of single and many-body quantum problems, commonly encountered in literature is developed based on a recently proposed method for finding solutions of linear differential equations. Apart from…
We introduce two kinds of quantum algorithms to explore microcanonical and canonical properties of many-body systems. The first one is a hybrid quantum algorithm that, given an efficiently preparable state, computes expectation values in a…
We present a quantum algorithm that analyzes time series data simulated by a quantum differential equation solver. The proposed algorithm is a quantum version of the dynamic mode decomposition algorithm used in diverse fields such as fluid…
Phase estimation is a quantum algorithm for measuring the eigenvalues of a Hamiltonian. We propose and rigorously analyse a randomized phase estimation algorithm with two distinctive features. First, our algorithm has complexity independent…
We study the eigenlevel spectrum of quantum adiabatic algorithm for 3-satisfiability problem, focusing on single-solution instances. The properties of the ground state and the associated gap, crucial for determining the running time of the…
Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $\epsilon$ in Heisenberg-limited time $T=\Theta(1/\epsilon)$. Standard gate-based implementations of QPE require…
We present a hybrid classical-quantum algorithm to solve optimization problems in current quantum computers, whose basic idea is to assist variational quantum eigensolvers (VQE) with adiabatic change of the Hamiltonian. The rational for…