Related papers: Efficient unstructured search implementation on cu…
Given two sets A and B and two oracles O(A) and O(B) that can identify the elements of these sets respectively, the goal is to find an element common to both sets using minimum number of oracle queries. Each application of either O(A) or…
Grover's algorithm searches for data satisfying a desired condition in an unstructured database. This algorithm can search a space of size $N$ in $\sqrt{N}$ queries, thereby achieving a quadratic speedup. However, within the Grover oracle…
Perceptron model is a fundamental linear classifier in machine learning and also the building block of artificial neural networks. Recently, Wiebe et al. (arXiv:1602.04799) proposed that the training of a perceptron can be quadratically…
We demonstrate a quantum processor based on a 3D linear Paul trap that uses $^{171}$Yb$^{+}$ ions with 8 individually controllable four-level qudits (ququarts), which is computationally equivalent to a 16-qubit quantum processor. The design…
Grover's algorithm is a well-known unstructured quantum search algorithm run on quantum computers. It constructs an oracle and calls the oracle O($\sqrt N$) times to locate specific data out of N unsorted data. This represents a quadratic…
We consider quantum search algorithms that have access to a noisy oracle that, for every oracle call, with probability $p>0$ completely depolarizes the query registers, while otherwise working properly. Previous results had not ruled out…
Evolution of entanglement with the proceeding of quantum algorithms affects the outcome of the algorithm. Particularly, the performance of Grover's search algorithm gets worsened if the initial state of the algorithm is an entangled one.…
Non-adiabatic two-qubit gate proposals for trapped-ion systems offer superior performance and flexibility over adiabatic schemes at the cost of increased laser control requirements. Existing fast gate schemes are limited by single-qubit…
The Grover search algorithm performs an unstructured search of a marked item in a database quadratically faster than classical algorithms and is shown to be optimal. Here, we show that if the search space is divided into two blocks with the…
We study the unsorted database search problem with items $N$ from the viewpoint of unitary discrimination. Instead of considering the famous $O(\sqrt{N})$ Grover's the bounded-error algorithm for the original problem, we seek for the…
Quantum computers are now on the brink of outperforming their classical counterparts. One way to demonstrate the advantage of quantum computation is through quantum random sampling performed on quantum computing devices. However, existing…
Grover's search algorithm was originally proposed for circuit-based quantum computers. A crucial part of it is to query an oracle -- a black-box unitary operation. Generation of this oracle is formally beyond the original algorithm design.…
The main idea in the original Grover search (Phys. Rev. Lett. 79, 325 (1997)) is to single out a target state containing the solution to a search problem by amplifying the amplitude of the state, following the Oracle's job, i.e., a black…
Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications…
In typical discrete-time quantum walk algorithms, one measures the position of the walker while ignoring its internal spin/coin state. Rather than neglecting the information in this internal state, we show that additionally measuring it…
Quantum algorithms and circuits can, in principle, outperform the best non-quantum (classical) techniques for some hard computational problems. However, this does not necessarily lead to useful applications. To gauge the practical…
Quantum computer is extensively used in solving financial problems. Quantum amplitude estimation, an algorithm that aims to estimate the amplitude of a given quantum state, can be utilized to determine the expectation value of bonds as the…
With the advent of powerful quantum computers, the quest for more efficient quantum algorithms becomes crucial in attaining quantum supremacy over classical counterparts in the noisy intermediate-scale quantum era. While Grover's search…
The hardness to solve an unstructured quantum search problem by a standard quantum search algorithm mainly originates from the low efficiency to amplify the amplitude of the marked state by the oracle unitary operation associated with other…
One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log_2 N queries to the list, a quantum computer can solve the problem…