相关论文: A Generalization of Grover's Algorithm
In standard Grover's algorithm for quantum searching, the probability of finding the marked item is not exactly 1. In this Letter we present a modified version of Grover's algorithm that searches a marked state with full successful rate.…
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…
The total magnification due to a point lens has been of particular interest as the theorem that gravitational lensing results in light amplification for all observers appears to contradict the conservation of photon number. This has been…
In this paper, we study supersymmetry in quantum mechanics using the generalized uncertainty principle (GUP), or in other words, generalized supersymmetry in quantum mechanics. We construct supersymmetry in the generalized form of the…
In this paper we give some sufficient conditions of analyticity and univalence for functions defined by an integral operator. Next, we refine the result to a quasiconformal extension criterion with the help of the Becker's method. Further,…
Partial search has been proposed recently for finding the target block containing a target element with fewer queries than the full Grover search algorithm which can locate the target precisely. Since such partial searches will likely be…
Unstructured search remains as one of the significant challenges in computer science, as classical search algorithms become increasingly impractical for large-scale systems due to their linear time complexity. Quantum algorithms, notably…
We analyze the issue of unitary equivalence within Generalized Uncertainty Principle (GUP) theories in the one-dimensional case. For a deformed Heisenberg algebra, its representation in terms of Hilbert space and conjugate operators is not…
We study a Grover-type method for Quadratic Unconstrained Binary Optimization (QUBO) problems. For an $n$-dimensional QUBO problem with $m$ nonzero terms, we construct a marker oracle for such problems with a tuneable parameter, $\Lambda…
Generalized eigenvalue problems (GEPs) play an important role in the variety of fields including engineering, machine learning and quantum chemistry. Especially, many problems in these fields can be reduced to finding the minimum or maximum…
We report the implementation of Grover's quantum search algorithm in the scalable system of trapped atomic ion quantum bits. Any one of four possible states of a two-qubit memory is marked, and following a single query of the search space,…
We show that a quantum state can be perfectly cloned up to global mirroring with a unitary transformation that depends on one single parameter. We then show that this is equivalent to "perfect" cloning for quantum associative memories…
Grover's algorithm is a well-known unstructured quantum search algorithm run on quantum computers. It constructs an oracle and calls the oracle O($\sqrt N$) times to locate specific data out of N unsorted data. This represents a quadratic…
As a key method to deal with loop integrals, Integration-By-Parts (IBP) method can be used to do reduction as well as establish the differential equations for master integrals. However, when talking about tensor reduction, the…
We introduce an iterative method to search for time-optimal Hamiltonians that drive a quantum system between two arbitrary, and in general mixed, quantum states. The method is based on the idea of progressively improving the efficiency of…
We characterize generalized derivatives of the solution operator of the obstacle problem. This precise characterization requires the usage of the theory of so-called capacitary measures and the associated solution operators of relaxed…
Variational quantum algorithms that are used for quantum machine learning rely on the ability to automatically differentiate parametrized quantum circuits with respect to underlying parameters. Here, we propose the rules for differentiating…
We propose several novel methods for enhancing the multi-class SVMs by applying the generalization performance of binary classifiers as the core idea. This concept will be applied on the existing algorithms, i.e., the Decision Directed…
We propose a genetic-algorithm-based method to find the unitary transformations for any desired quantum computation. We formulate a simple genetic algorithm by introducing the "genetic parameter vector" of the unitary transformations to be…
This paper introduces a weighted generalized inverse framework for Fourier extensions, designed to suppress spurious oscillations in the extended region while maintaining high approximation accuracy on the original interval. By formulating…