Related papers: Postprocessing can speed up general quantum search…
Grover discovered a quantum algorithm for identifying a target element in an unstructured search universe of N items in approximately square-root of N queries to a quantum oracle, thus achieving a square-root speed-up over classical…
We introduce quantum agents trained by episodic, reward-based reinforcement learning to autonomously rediscover several seminal quantum algorithms and protocols. In particular, our agents learn: efficient logarithmic-depth quantum circuits…
An optimal estimator of quantum states based on a modified Kalman's Filter is proposed in this work. Such estimator acts after state measurement, allowing obtain an optimal estimation of quantum state resulting in the output of any quantum…
Quantum algorithms profit from the interference of quantum states in an exponentially large Hilbert space and the fact that unitary transformations on that Hilbert space can be broken down to universal gates that act only on one or two…
The effect of unitary noise on the performance of Grover's quantum search algorithm is studied. This type of noise may result from tiny fluctuations and drift in the parameters of the (quantum) components performing the computation. The…
The execution of Grover's quantum search algorithm needs rather limited resources without much fine tuning. Consequently, the algorithm can be implemented in a variety of physical set-ups, which involve wave dynamics but may not need other…
We complete the task of optimal probabilistic coherence distillation protocol, whose aim is to transform a general state into a set of n-level maximally coherent states via strictly incoherent operations (SIO). Specifically, we present the…
The method is introduced for fast data processing by reducing the probability amplitudes of undesirable elements. The algorithm has a mathematical description and circuit implementation on a quantum processor. The idea is to make a quick…
We propose a simple quantum algorithm for implementing the diffusion step of grid-based Bayesian filters. The method encodes the advected state density and the process noise density into quantum registers and realizes diffusion using a…
The description of gene interactions that constantly occur in the cellular environment is an extremely challenging task due to an immense number of degrees of freedom and incomplete knowledge about microscopic details. Hence, a…
Recently, there has been a growing literature exploring the generalization of quantum algorithms, such that different quantum algorithms are special examples of a more fundamental structure. In this short paper, we provide a general…
We analyze the role played by entanglement in the dynamical evolution of Grover's search algorithm in the space of qubits. We show that the algorithm can be equivalently described as an iterative change of the entanglement between the…
As the engineering endeavour to realise quantum computers progresses, we consider that such machines need not rely on binary as their de facto unit of information. We investigate Grover's algorithm under a generalised quantum circuit model,…
Quantum machine learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure…
In a recent work we presented a recursive algorithm to compute the matrix elements of a generic Gaussian transformation in the photon-number basis. Its purpose was to evolve a quantum state by building the transformation matrix and…
Neural network quantum states are a promising tool to analyze complex quantum systems given their representative power. It can however be difficult to optimize efficiently and effectively the parameters of this type of ansatz. Here we…
We describe a simple quantum algorithm for preparing $K$ copies of an $N$-dimensional quantum state whose amplitudes are given by a quantum oracle. Our result extends a previous work of Grover, who showed how to prepare one copy in time…
Grover's algorithm is a primary algorithm offered as evidence that quantum computers can provide an advantage over classical computers. It involves an "oracle" specified for a given application whose structure is not part of the formal…
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…
Quantum algorithm, as compared to classical algorithm, plays a notable role in solving linear systems of equations with an exponential speedup. Here, we demonstrate a method for solving a particular system of equations by using the concept…