Results 21 to 30 of about 2,290,834 (158)
Implementation of new technique for Face recognition based on quantum computing
In this research, a new technique for measuring facial recognition face similarity based on quantum computing (oracle) has been proposed. This technique is transforming the oracle of Grover's search algorithm into correlation oracle with feeding image ...
Amjed Yousif Sahib
doaj +1 more source
Research Paper: Advanced Computational Analysis of Grover's Algorithm for Quantum Search in Oil Reservoir Exploration [PDF]
Grover's quantum search algorithm, with a time complexity of , provides an efficient solution for searching unstructured databases. This study conducts a computational analysis of Grover's algorithm for quantum search in a geophysical database with ...
Atiyeh Zeynali, Zahra Bakhshi
doaj +1 more source
The Subset Sum Problem: Reducing Time Complexity of NP-Completeness with Quantum Search
The Subset Sum Problem is a member of the NP-complete class, so no known polynomial time algorithm exists for it. Although there are polynomial time approximations and heuristics, these are not always acceptable, yet exact-solution algorithms are ...
Bo Moon
doaj +1 more source
MODELING OF INTEGRATED OPTICAL QUANTUM SEARCH ALGORITHM [PDF]
Subject of Research. The paper presents a quantum search algorithm model, suitable for integration into a linear optical chip. Error impact caused by two-qubit operator implementation and directional coupler manufacture imperfection on the algorithm ...
Y. A. Adam +7 more
doaj +1 more source
Quantum Advantage of Noisy Grover's Algorithm
Quantum advantage is the core of quantum computing. Grover's search algorithm is the only quantum algorithm with proven advantage to any possible classical search algorithm. However, realizing this quantum advantage in practice is quite challenging since
Yang, Fan, Leng, Jian, Wang, Xiang-Bin
core
A Memory-efficient Simulation Method of Grover's Search Algorithm [PDF]
Grover's search algorithm is one of the most significant quantum algorithms, which can obtain quadratic speedup of the extensive search problems. Since Grover's search algorithm cannot be implemented on a real quantum computer at present, its quantum ...
Xuwei Tang, Bojia Duan, Juan Xu
core +1 more source
Nonlinear quantum search using the Gross–Pitaevskii equation
We solve the unstructured search problem in constant time by computing with a physically motivated nonlinearity of the Gross–Pitaevskii type. This speedup comes, however, at the novel expense of increasing the time-measurement precision.
David A Meyer, Thomas G Wong
doaj +1 more source
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 +1 more source
Number Partitioning With Grover’s Algorithm in Central Spin Systems
Numerous conceptually important quantum algorithms rely on a blackbox device known as an oracle, which is typically difficult to construct without knowing the answer to the problem that the algorithm is intended to solve.
Galit Anikeeva +9 more
doaj +1 more source
Asymptotically Improved Circuit for $d$-ary Grover's Algorithm with Advanced Decomposition of $n$-qudit Toffoli Gate [PDF]
The progress in building quantum computers to execute quantum algorithms has recently been remarkable. Grover's search algorithm in a binary quantum system provides considerable speed-up over classical paradigm.
Majumdar, Ritajit +4 more
core +1 more source

