相关论文: A Comment on Fisher Information and Quantum Algori…
The conventional Quantum Fourier Transform, with exponential speedup compared to the classical Fast Fourier Transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, the…
The ultimate objective of this paper is to create a stepping stone to the development of new quantum algorithms. The strategy chosen is to begin by focusing on the class of abelian quantum hidden subgroup algorithms, i.e., the class of…
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…
Quantum systems with adiabatic classical parameters are widely studied, e.g., in the modern holonomic quantum computation. We here provide complete geometric quantization of a Hamiltonian system with time-dependent parameters, without the…
Grover's algorithm for quantum searching is generalized to deal with arbitrary initial complex amplitude distributions. First order linear difference equations are found for the time evolution of the amplitudes of the marked and unmarked…
Given a parameterized quantum circuit such that a certain setting of these real-valued parameters corresponds to Grover's celebrated search algorithm, can a variational algorithm recover these settings and hence learn Grover's algorithm? We…
We generalize Grover algorithm with two arbitrary phases in a density matrix set up. We give exact analytic expressions for the success probability after arbitrary number of iteration of the generalized Grover operator as a function of…
Grover's search algorithm was a groundbreaking advancement in quantum algorithms, displaying a quadratic speed-up of querying for items. Since the creation of this algorithm it has been utilized in various ways, including in preparing…
Recent studies have been spurred on by the promise of advanced quantum computing technology, which has led to the development of quantum computer simulations on classical hardware. Grover's quantum search algorithm is one of the well-known…
Grover's quantum search algorithm provides a quadratic quantum advantage over classical algorithms across a broad class of unstructured search problems. The original protocol is probabilistic, returning the desired result with significant…
Continuous-time quantum walks and adiabatic quantum evolution are two general techniques for quantum computing, both of which are described by Hamiltonians that govern their evolutions by Schr\"odinger's equation. In the former, the…
Grover's algorithm relies on the superposition and interference of quantum mechanics, which is more efficient than classical computing in specific tasks such as searching an unsorted database. Due to the high complexity of quantum…
The difference between classical and quantum algorithms (QA) is following: problem solved by QA is coded in the structure of the quantum operators. Input to QA in this case is always the same. Output of QA says which problem coded. In some…
Grover's quantum search algorithm drives a quantum computer from a prepared initial state to a desired final state by using selective transformations of these states. Here, we analyze a framework when one of the selective trasformations is…
This paper studies one of the best known quantum algorithms - Shor's factorisation algorithm - via categorical distributivity. A key aim of the paper is to provide a minimal set of categorical requirements for key parts of the algorithm, in…
The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The…
Optimization in large language models (LLMs) unfolds over high-dimensional parameter spaces with non-Euclidean structure. Information geometry frames this landscape using the Fisher information metric, enabling more principled learning via…
Entanglement plays a crucial role in quantum processes particularly those pertaining to quantum information and computation. An analytical expression for entanglement measure defined in terms of success rate of Grover's search algorithm has…
We review the basic theoretical underpinnings of the Grover algorithm, providing a rigorous and well motivated derivation. We then present a generalization of Grover's algorithm that searches an arbitrary subspace of the multi-dimensional…
Considering its relevance in the field of cryptography, integer factorization is a prominent application where Quantum computers are expected to have a substantial impact. Thanks to Shor's algorithm this peculiar problem can be solved in…