相关论文: Quantum searching a classical database (or how we …
We provide an overview of a canonical formalism that describes mixed quantum-classical systems in terms of statistical ensembles on configuration space, and discuss applications to measurement theory. It is shown that the formalism allows a…
We consider a database separated into blocks. Blocks containing target items are called target blocks. Blocks without target items are called non-target blocks. We consider a case, when each target block has the same number of target items.…
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…
We address the use of a single qubit as a quantum probe to characterize the properties of classical noise. In particular, we focus on the characterization of classical noise arising from the interaction with a stochastic field described by…
Quantum computation, in particular Grover's algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. Classical search procedures for an $N$ element database require at most…
We present several quantum algorithms for performing nearest-neighbor learning. At the core of our algorithms are fast and coherent quantum methods for computing distance metrics such as the inner product and Euclidean distance. We prove…
Due to the success of the Standard Model~(SM), it is reasonable to anticipate that the signal of new physics~(NP) beyond the SM is small. Consequently, future searches for NP and precision tests of the SM will require high luminosity…
Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box, but the aim is to compute function value for arbitrary input using as few queries as possible. In this paper we…
The current era of quantum computing has yielded several algorithms that promise high computational efficiency. While the algorithms are sound in theory and can provide potentially exponential speedup, there is little guidance on how to…
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…
In this work I describe a classical analog of Grover's quantum searching algorithm, explaining why a quantum algorithm should be able to perform search in O(sqrtN) steps and also acting as a useful pedagogic demonstration.
Quantum searching for one of $N$ marked items in an unsorted database of $n$ items is solved in $\mathcal{O}(\sqrt{n/N})$ steps using Grover's algorithm. Using nonlinear quantum dynamics with a Gross-Pitaevskii type quadratic nonlinearity,…
Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue in quantum walks is expected to provide a fruitful source of quantum algorithms. So far, however, such…
We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be at most polynomial. We show that for average-case complexity under the…
Grover's algorithm is normally presented as a method of searching a database, however it would be more accurately described as a method of identifying elements of an interval of the integers which satisfy some logical clause - an example…
A careful study of the classical/quantum connection with the aid of coherent states offers new insights into various technical problems. This analysis includes both canonical as well as closely related affine quantization procedures. The…
Quantum measurements of physical quantities are usually described as ideal measurements. However, only a few measurements fulfil the conditions of ideal measurements. The aim of the present work is to describe real position measurements…
Quantum information science provides powerful technologies beyond the scope of classical physics. In practice, accurate control of quantum operations is a challenging task with current quantum devices. The implementation of high fidelity…
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that any bounded-error nonadaptive quantum query algorithm that…
In classical computation, a problem can be solved in multiple steps where calculated results of each step can be copied and used repeatedly. While in quantum computation, it is difficult to realize a similar multi-step computation process…