Related papers: A Comment on Fisher Information and Quantum Algori…
In order to understand the bounds of utilization of the Grover's search algorithm for the large unstructured data in presence of the quantum computer noise, we undertake a series of simulations by inflicting various types of noise, modelled…
Amongst the most remarkable successes of quantum computation are Shor's efficient quantum algorithms for the computational tasks of integer factorisation and the evaluation of discrete logarithms. In this article we review the essential…
We investigate the performance of Grover's quantum search algorithm on a register which is subject to loss of the particles that carry the qubit information. Under the assumption that the basic steps of the algorithm are applied correctly…
In this study, considering the Fisher information metric (Fisher metric) given by a specific form, which is the form of weights in statistical physics, we rewrite the Einstein-Hilbert (EH) action. Then, determining the transformation rules…
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…
Grover's quantum search and its generalization, quantum amplitude amplification, provide quadratic advantage over classical algorithms for a diverse set of tasks, but are tricky to use without knowing beforehand what fraction $\lambda$ of…
Properties of Shor's algorithm and the related period-finding algorithm could serve as benchmarks for the operation of a quantum computer. Distinctive universal behaviour is expected for the probability for success of the period-finding…
Distributed computing seems to be a natural approach to overcome size limitations of quantum computers in terms of number of qubits. But one lacks an efficient distribution approach to deal systematically with potential algorithms. This…
The search problem is to find a state satisfying certain properties out of a given set. Grover's algorithm drives a quantum computer from a prepared initial state to the target state and solves the problem quadratically faster than a…
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central problem solved by Shor's factoring algorithm. We suggest an…
We propose a new adiabatic algorithm for the unsorted database search problem. This algorithm saves two thirds of qubits than Grover's algorithm in realizations. Meanwhile, we analyze the time complexity of the algorithm by both…
Grover's algorithm provides a quadratic speedup over classical algorithms to search for marked elements in an unstructured database. The original algorithm is probabilistic, returning a marked element with bounded error. There are several…
We derive a new variational principle for the quantum Fisher information leading to a simple iterative alternating algorithm, the convergence of which is proved. The case of a fixed measurement, i.e. the classical Fisher information, is…
Quantum computation has attracted much attention since it was shown by Shor and Grover the possibility to implement quantum algorithms able to realize, respectively, factoring and searching in a faster way than any other known classical…
This is continuation of the approach to performing quantum algorithms using geometric structures which was presented by Aerts and Czachor. We solve the Simon's problem which, next to the Shor's alghorithm, is a representative of a quantum…
One of the most promising and versatile approaches to creating new quantum algorithms is based on the quantum hidden subgroup (QHS) paradigm, originally suggested by Alexei Kitaev. This class of quantum algorithms encompasses the…
We discuss a new approach to the problem of quantum gravity in which the quantum mechanical structures that are traditionally fixed, such as the Fubini-Study metric in the Hilbert space of states, become dynamical and so implement the idea…
Grover's search algorithm is one of the first quantum algorithms to exhibit a provable quantum advantage. It forms the backbone of numerous quantum applications and is widely used in benchmarking efforts. Here, we report…
Recently, Andreas de Vries proposed a quantum algorithm that would find an element in an unsorted database exponentially faster than Grover's algorithm. We show that de Vries' algorithm does not work as intended and does not give any clue…
Shor's algorithm for factoring in polynomial time on a quantum computer\cite{Shor} gives an enormous advantage over all known classical factoring algorithm. We demonstrate how to factor products of large prime numbers using a compiled…