Related papers: Computational speed-up in a single qudit NMR quant…
It is known that quantum computers yield a speed-up for certain discrete problems. Here we want to know whether quantum computers are useful for continuous problems. We study the computation of the integral of functions from the classical…
In this paper, we consider a quantum algorithm for solving the following problem: ``Suppose $f$ is a function given as a black box (that is also called an oracle) and $f$ is invariant under some AND-mask. Examine a property of $f$ by…
Quantum computers are considered as a part of the family of the reversible, lineary-extended, dynamical systems (Quanputers). For classical problems an operational reformulation is given. A universal algorithm for the solving of classical…
We report an experiment to demonstrate a quantum permutation determining algorithm with linear optical system. By employing photon polarization and spatial modes, we realize the quantum ququart states and all the essential permutation…
We introduce a classical-quantum hybrid approach to computation, allowing for a quadratic performance improvement in the decision process of a learning agent. In particular, a quantum routine is described, which encodes on a quantum…
Quantum computing is the process of performing calculations using quantum mechanics. This field studies the quantum behavior of certain subatomic particles for subsequent use in performing calculations, as well as for large-scale…
We describe a new polynomial time quantum algorithm that uses the quantum fast fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases (commonly found in ab initio physics and…
A framework is presented for the design and analysis of quantum mechanical algorithms, the sqrt(N) step quantum search algorithm is an immediate consequence of this framework. It leads to several other search-type applications - several…
Quantum algorithms are demonstrated to outperform classical algorithms for certain problems and thus are promising candidates for efficient information processing. Herein we aim to provide a brief and popular introduction to quantum…
Quantum algorithms are built enabling to find Poincar\'e recurrence times and periodic orbits of classical dynamical systems. It is shown that exponential gain compared to classical algorithms can be reached for a restricted class of…
Quantum computing and quantum Monte Carlo (QMC) are respectively the state-of-the-art quantum and classical computing methods for understanding many-body quantum systems. Here, we propose a hybrid quantum-classical algorithm that integrates…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…
Machines are possible to have some artificial intelligence like human beings owing to particular algorithms or software. Such machines could learn knowledge from what people taught them and do works according to the knowledge. In practical…
The new model of quantum computation is proposed, for which an effective algorithm of solving any task in NP is described. The work is based and inspired be the Grover's algorithm for solving NP-tasks with quadratic speedup compared to the…
Quantum algorithms for scientific computing require modules implementing fundamental functions, such as the square root, the logarithm, and others. We require algorithms that have a well-controlled numerical error, that are uniformly…
We describe a quantum algorithm for finding the smallest eigenvalue of a Hermitian matrix. This algorithm combines Quantum Phase Estimation and Quantum Amplitude Estimation to achieve a quadratic speedup with respect to the best classical…
Quantum amplitude amplification and estimation have shown quadratic speedups to unstructured search and estimation tasks. We show that a coherent combination of these quantum algorithms also provides a quadratic speedup to calculating the…
A system of unitary transformations providing two optimal copies of an arbitrary input cubit is obtained. An algorithm based on classical Boolean algebra and allowing one to find any unitary transformation realized by the quantum CNOT…
In this work we present an algorithm to perform algorithmic differentiation in the context of quantum computing. We present two versions of the algorithm, one which is fully quantum and one which employees a classical step (hybrid…
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…