Results 11 to 20 of about 2,291,200 (218)
Opening the Black Box inside Grover’s Algorithm
Physical Review XGrover’s algorithm is one of the primary algorithms offered as evidence that quantum computers can provide an advantage over classical computers. It involves an “oracle” (external quantum subroutine), which must be specified for a given application and ...
E. M. Stoudenmire, Xavier Waintal
doaj +2 more sources
Application of Grover’s quantum algorithm for string matching [PDF]
, 2022 Treballs Finals de Grau de Física, Facultat de Física, Universitat de Barcelona, Curs: 2022, Tutors: Alba Cervera Lierta, Bruno Juliá DíazIn this work we present a quantum algorithm for exact string matching that relies on Grover’s algorithm.
Barberà Rodríguez, Júlia
core +6 more sources
Journal of Mathematical Cryptology, 2020 In this paper we provide a framework for applying classical search and preprocessing to quantum oracles for use with Grover’s quantum search algorithm in order to lower the quantum circuit-complexity of Grover’s algorithm for single-target search ...
Biasse Jean-François, Pring Benjamin
doaj +2 more sources
Grover’s algorithm on the IBM quantum computers [PDF]
, 2021 Treballs Finals de Grau de Física, Facultat de Física, Universitat de Barcelona, Curs: 2021, Tutor: Bruno Juliá DíazWe present a detailed study of Grover’s search algorithm including its mathematical foundations.
Rodríguez Grasa, Pablo
core +6 more sources
Error Mitigation of Grover’s Quantum Search Algorithm [PDF]
, 2022 Grover’s quantum search algorithm delivers quadratic speedup over classical counterparts for finding an item in unstructured database. But the accuracy of the algorithm degrades as the number of qubits are increased.
Singh, Gurmohan ; Cyber Security Technology Division, Centre for Development of Advanced Computing (C-DAC), Mohali +2 more
core +3 more sources
Web-app realization of Shor’s quantum factoring algorithm and Grover’s quantum search algorithm [PDF]
, 2020 Quantum algorithms are well-known for their quadratic if not exponential speedup over their classical counterparts. The two widely-known quantum algorithms are Shor’s quantum factoring algorithm and Grover’s quantum search algorithm.
Wicaksana, Arya +5 more
core +2 more sources
On Hitting Times for General Quantum Markov Processes [PDF]
Quantum, 2023 Random walks (or Markov chains) are models extensively used in theoretical computer science. Several tools, including analysis of quantities such as hitting and mixing times, are helpful for devising randomized algorithms. A notable example is Schöning's
Lorenzo Laneve +2 more
doaj +1 more source
Resource Efficient Boolean Function Solver on Quantum Computer [PDF]
QuantumNonlinear boolean equation systems play an important role in a wide range of applications. Grover's algorithm is one of the best-known quantum search algorithms in solving the nonlinear boolean equation system on quantum computers.
Xiang Li +3 more
doaj +1 more source
Determination of the number of shots for Grover’s search algorithm [PDF]
, 2023 This paper focuses on Grover’s quantum search algorithm, which is of paramount importance as a masterpiece of Quantum Computing software. Given the inherent probabilistic nature of quantum computers, quantum programs based on Grover’s algorithm need to ...
Sánchez Palma, Pedro +3 more
core +1 more source
Gate-based quantum computing for protein design.
PLoS Computational Biology, 2023 Protein design is a technique to engineer proteins by permuting amino acids in the sequence to obtain novel functionalities. However, exploring all possible combinations of amino acids is generally impossible due to the exponential growth of ...
Mohammad Hassan Khatami +3 more
doaj +1 more source