Related papers: Quantum searching a classical database (or how we …

Searching for marked items from an unsorted database is an important scientific problem and a benchmark for computing devices as well. Using a 7-qubit liquid NMR quantum computer, we have demonstrated successfully an hybrid quantum fetching…

The Grover algorithm is a crucial solution for addressing unstructured search problems and has emerged as an essential quantum subroutine in various complex algorithms. By using a different approach with previous studies, this research…

With the exception of superselection rules, there are no known explicit violations of the Principle of quantum Superposition. However, quantum measurement and the emergence of classicality seem to imply that the Principle of Superposition…

Interaction-free measurement is thought to allow for quantum particles to detect objects along paths they never traveled. As such, it represents one of the most beguiling of quantum phenomena. Here, we present a classical analog of…

In this tutorial, which contains some original results, we bridge the fields of quantum computing algorithms, conservation laws, and many-body quantum systems by examining three algorithms for searching an unordered database of size $N$…

Quantum interferometry methods exploit quantum resources, such as photonic entanglement, to enhance phase estimation beyond classical limits. Nonlinear optics has served as a workhorse for the generation of entangled photon pairs, ensuring…

The discovery of derivatives and integrals was a tremendous leap in scientific knowledge and completely revolutionized many fields, including mathematics, physics, and engineering. The existence of higher-order derivatives means better…

Manipulating a database system on a quantum computer is an essential aim to benefit from the promising speed-up of quantum computers over classical computers in areas that take a vast amount of storage and processing time such as in…

Quantum algorithms for Hamiltonian simulation and linear differential equations more generally have provided promising exponential speed-ups over classical computers on a set of problems with high real-world interest. However, extending…

Composition is something we take for granted in classical algorithms design, and in particular, we take it as a basic axiom that composing ``efficient'' algorithms should result in an ``efficient'' algorithm -- even using this intuition to…

A test of quantumness is a protocol where a classical user issues challenges to a quantum device to determine if it exhibits non-classical behavior, under certain cryptographic assumptions. Recent attempts to implement such tests on current…

In this work we initiate the question of whether quantum devices can provide us with an almost perfect source of classical randomness, and more generally, suffice for classical cryptographic tasks, such as encryption. Indeed, it is well…

We propose a quantum programming paradigm where all data are familiar classical data, and the only non-classical element is a random number generator that can return results with negative probability. Currently, the vast majority of quantum…

We recast Grover's generalised search algorithm in a geometric language even when the states are not approximately orthogonal. We provide a possible search algorithm based on an arbitrary unitary transformation which can speed up the steps…

Extracting useful signals is key to both classical and quantum technologies. Conventional noise filtering methods rely on different patterns of signal and noise in frequency or time domains, thus limiting their scope of application,…

In a fundamental paper [Phys. Rev. Lett. 78, 325 (1997)] Grover showed how a quantum computer can find a single marked object in a database of size N by using only O(N^{1/2}) queries of the oracle that identifies the object. His result was…

We introduce a general statistical learning theory for processes that take as input a classical random variable and output a quantum state. Our setting is motivated by the practical situation in which one desires to learn a quantum process…

Quantum computing promises the ability to compute properties of quantum systems exponentially faster than classical computers. Quantum advantage is achieved when a practical problem is solved more efficiently on a quantum computer than on a…

Given an efficient and systematic method for generating input sets for free fermionic heterotic model building we consider what the realistic bounds are for a statistical analysis of the free fermionic Landscape with a classical computer.…

In this work, we present a quantum query algorithm for searching a word of length $m$ in an unsorted dictionary of size $n$. The algorithm uses $O(\sqrt{n})$ queries (Grover operators), like previously known algorithms. What is new is that…