相关论文: Quantum Mechanics helps in searching for a needle …
A motivation is given for expressing classical mechanics in terms of diagonal projection matrices and diagonal density matrices. Then quantum mechanics is seen to be a simple generalization in which one replaces the diagonal real matrices…
It is shown that quantum mechanics on noncommutative spaces (NQM) can be obtained by the canonical quantization of some underlying second class constrained system formulated in extended configuration space. It leads, in particular, to an…
Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box and the aim is to compute function value for arbitrary input using as few queries as possible. We concentrate on quantum…
We introduce a novel deterministic quantum search algorithm that provides a practical alternative to conventional probabilistic search approaches. Our scheme eliminates the inherent uncertainty of quantum search without relying on arbitrary…
Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data. Quantum kernels are able to capture relationships in the data that are not…
In this paper, we present a novel formulation of traditional sampling-based motion planners as database-oracle structures that can be solved via quantum search algorithms. We consider two complementary scenarios: for simpler sparse…
Quantum computers have the potential of solving certain problems exponentially faster than classical computers. Recently, Harrow, Hassidim and Lloyd proposed a quantum algorithm for solving linear systems of equations: given an $N\times{N}$…
A generalized quantum search algorithm, where phase inversions for the marked state and the prepared state are replaced by $\pi/2$ phase rotations, is realized in a 2-qubit NMR heteronuclear system. The quantum algorithm searches a marked…
A simple criterion is derived in order that a number sequence ${\cal S}_n$ is a permitted spectrum of a quantized system. The sequence of the prime numbers fulfils the criterion and the corresponding one-dimensional quantum potential is…
We consider in this paper the possibility of embedding a quantum search algorithm within a classical binary search framework. The result appears promising: taking full advantage of quantum parallelism, we show that it may actually be…
The fundamental dynamics of quantum particles is neutral with respect to the arrow of time. And yet, our experiments are not: we observe quantum systems evolving from the past to the future, but not the other way round. A fundamental…
Quantum information processing is the use of inherently quantum mechanical phenomena to perform information processing tasks that cannot be achieved using conventional classical information technologies. One famous example is quantum…
Continuous-time quantum walks provide an alternative method for quantum search problems. Most of the earlier studies confirmed that quadratic speedup exists in some synthetic Hamiltonians, but whether there is quadratic speedup in real…
In this survey, we describe two recent developments in quantum algorithms. The first new development is a quantum algorithm for evaluating a Boolean formula consisting of AND and OR gates of size N in time O(\sqrt{N}). This provides quantum…
Quantum annealing is a generic algorithm using quantum-mechanical fluctuations to search for the solution of an optimization problem. The present paper first reviews the fundamentals of quantum annealing and then reports on preliminary…
The Bohmian formulation of quantum mechanics is used in order to describe the measurement process in an intuitive way without a reduction postulate in the framework of a deterministic single system theory. Thereby the motion of the hidden…
Quantum computers leverage the principles of quantum mechanics to do computation with a potential advantage over classical computers. While a single classical computer transforms one particular binary input into an output after applying one…
We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably…
Quantum algorithms provide an exponential speedup for solving certain classes of linear systems, including those that model geologic fracture flow. However, this revolutionary gain in efficiency does not come without difficulty. Quantum…
The ability to extract relevant information is critical to learning. An ingenious approach as such is the information bottleneck, an optimisation problem whose solution corresponds to a faithful and memory-efficient representation of…