Related papers: The Quantum Steeplechase
Quantization has emerged as a standard technique for accelerating inference for generative models by enabling faster low-precision computations and reduced memory transfers. Recently, GPU accelerators have added first-class support for…
Quantum search is a quantum mechanical technique for searching N possibilities in only sqrt(N) steps. This paper gives a fresh perspective on the algorithm in terms of a resonance phenomenon which is implemented through classical coupled…
Quantum search is a quantum mechanical technique for searching N possibilities in only sqrt(N) steps. This has been proved to be the best possible algorithm for the exhuastive search problem in the sense the number of queries it requires…
We consider a zero-temperature one-dimensional system of bosons interacting via the soft-shoulder potential in the continuum, typical of dressed Rydberg gases. We employ quantum Monte Carlo simulations, which allow for the exact calculation…
In this work, analytical expressions for the Green function of a Luttinger liquid are derived with one and two mobile impurities (heavy particles) using a combination of bosonization and perturbative approaches. The calculations are done in…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. Quantum search algorithm can be described as the rotation of state vectors in…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
Generic quantum search algorithm searches for target entity in an unsorted database by repeatedly applying canonical Grover's quantum rotation transform to reach near the vicinity of the target entity. Thus, upon measurement, there is a…
The quantum search algorithm consists of an alternating sequence of selective inversions and diffusion type operations, as a result of which it can find a target state in an unsorted database of size N in only sqrt(N) queries. This paper…
Continuous-time quantum walks provide an alternative method for quantum search problems. Most of the earlier studies confirmed that quadratic speedup exists in some synthetic Hamiltonians, but whether there is quadratic speedup in real…
We use an alternative method to the Bethe-Salpeter equation, the N-Quantum approximation (NQA), for studying bound states in motion. We use this method to find a relativistic equation for weakly bound states of two constituents with…
We introduce a new measure called reduced entropy of sublattice to quantify entanglement in spin, electron and boson systems. By analyzing this quantity, we reveal an intriguing connection between quantum entanglement and quantum phase…
The quantum search algorithm is a technique for searching N possibilities in only sqrt(N) steps. Although the algorithm itself is widely known, not so well known is the series of steps that first led to it, these are quite different from…
Generic quantum search algorithm searches for target entity in an unsorted database by repeatedly applying canonical Grover's quantum rotation transform to reach near the vicinity of the target entity represented by a basis state in the…
The lackadaisical quantum walk, a quantum analog of the lazy random walk, is obtained by adding a weighted self-loop transition to each state. Impacts of the self-loop weight $l$ on the final success probability in finding a solution make…
The quantum Lattice Boltzmann equation (QLBe), a new variant of the lattice Boltzmann equation, specifically designed to describe non relativistic quantum motion, is validated for the case of a free-particle in (1+1) space-time dimensions.…
We describe a general method to obtain quantum speedups of classical algorithms which are based on the technique of backtracking, a standard approach for solving constraint satisfaction problems (CSPs). Backtracking algorithms explore a…
Quantum Phase Transition (QPT) is a phase transition between different quantum states by adjusting some control parameters. Based on the Principle of Hamilton Dynamics (PHD) and the Principle of Lagrangian Dynamics (PLD), a general QPT…
The simulation of molecules is a widely anticipated application of quantum computers. However, recent studies \cite{WBCH13a,HWBT14a} have cast a shadow on this hope by revealing that the complexity in gate count of such simulations…