Related papers: Probabilistic Nonunitary Gate in Imaginary Time Ev…
Since the final quantum state in the Grover search algorithm is the normalized marked quantum state from the Gram-Schmidt process, Abrams and Lloyd [1] has shown that we can generate this vector by using a non-unitary gate. Following their…
This article presents the first complete application of a quantum time-marching algorithm for simulating multidimensional linear transport phenomena with arbitrary boundaries, whereby the success probabilities are problem intrinsic. The…
Constraint satisfiability problems, crucial to several applications, are solved on a quantum computer using Grover's search algorithm, leading to a quadratic improvement over the classical case. The solutions are obtained with high…
State-of-the-art cosmological simulations on classical computers are limited by time, energy, and memory usage. Quantum computers can perform some calculations exponentially faster than classical computers, using exponentially less energy…
We introduce hybrid classical-quantum algorithms for problems involving a large classical data set X and a space of models Y such that a quantum computer has superposition access to Y but not X. These algorithms use data reduction…
We propose and analyze a nonunitary variant of the continuous time Grover search algorithm based on frequent Zeno-type measurements. We show that the algorithm scales similarly to the pure quantum version by deriving tight analytical lower…
We demonstrate that locally connected networks of machines that have primitive learning capabilities can be used to perform a deterministic, event-based simulation of quantum computation. We present simulation results for basic quantum…
The execution of Grover's quantum search algorithm needs rather limited resources without much fine tuning. Consequently, the algorithm can be implemented in a variety of physical set-ups, which involve wave dynamics but may not need other…
Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size…
Nuclear magnetic resonance techniques are used to realize a quantum algorithm experimentally. The algorithm allows a simple NMR quantum computer to determine global properties of an unknown function requiring fewer function ``calls'' than…
We present a quantum algorithm that additively approximates the value of a tensor network to a certain scale. When combined with existing results, this provides a complete problem for quantum computation. The result is a simple new way of…
Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been used to design and reproduce quantum…
Quantum computers can be used to simulate nonlinear non-Hamiltonian classical dynamics on phase space by using the generalized Koopman-von Neumann formulation of classical mechanics. The Koopman-von Neumann formulation implies that the…
In order to resolve the measurement problem of Quantum Mechanics, non-unitary time evolution has been derived from the unitarity of standard quantum formalism. New wave functions of free and non-free quantum systems follow from Schroedinger…
Variational quantum algorithms dominate contemporary gate-based quantum enhanced optimisation, eigenvalue estimation and machine learning. Here we establish the quantum computational universality of variational quantum computation by…
In continuous-variable quantum computation, identifying key elements that enable a quantum computational advantage is a long-standing issue. Starting from the standard results on the necessity of Wigner negativity, we develop a…
A quantum circuit is generalized to a nonunitary one whose constituents are nonunitary gates operated by quantum measurement. It is shown that a specific type of one-qubit nonunitary gates, the controlled-NOT gate, as well as all one-qubit…
In the effort to develop useful quantum computers simulating quantum machines with conventional computing resources is a key capability. Such simulations will always face limits preventing the emulation of quantum computers of substantial…
Grover's algorithm is one of the pioneering demonstrations of the advantages of quantum computing over its classical counterpart, providing - at most - a quadratic speed-up over the classical solution for unstructured database search. The…
Grover's algorithm, orginally conceived as a means of searching an unordered database, can also be used to extract solutions from the result sets generated by quantum computations. The Grover algorithm exploits the concept of an oracle…