Results 21 to 30 of about 2,291,200 (218)
Deterministic Grover search with a restricted oracle
Physical Review Research, 2022 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 probability on ...
Tanay Roy +2 more
doaj +1 more source
Implementation of new technique for Face recognition based on quantum computing
Wasit Journal of Engineering Sciences, 2018 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
Grover’s algorithm on a Feynman computer [PDF]
, 2004 We present an implementation of Grover’s algorithm in the framework of Feynman’s cursor model of a quantum computer. The cursor degrees of freedom act as a quantum clocking mechanism, and allow Grover’s algorithm to be performed using a single, time ...
D. Tamascelli, D. de Falco
core +1 more source
Number Partitioning With Grover’s Algorithm in Central Spin Systems
PRX Quantum, 2021 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
The Subset Sum Problem: Reducing Time Complexity of NP-Completeness with Quantum Search
Undergraduate Journal of Mathematical Modeling: One + Two, 2012 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]
Научно-технический вестник информационных технологий, механики и оптики, 2019 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
Nonlinear quantum search using the Gross–Pitaevskii equation
New Journal of Physics, 2013 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
Design of Grover’s Algorithm over 2, 3 and 4- Qubit Systems in Quantum Programming Studio [PDF]
, 2022 In this paper, we design and analyse the Circuit for Grover’s Quantum Search Algorithm on 2, 3 and 4-qubit systems, in terms of number of gates, representation of state vectors and measurement probability for the state vectors.
Shylu, Sam +4 more
core +1 more source
Molecular Oncology, EarlyView.The novel styrylquinazolinone‐based molecule W1B effectively suppresses glioblastoma by inhibiting IGF1R and EGFR. In high‐glucose microenvironments driving tumor resistance, W1B acts synergistically with the EGFR inhibitor dacomitinib. This combination safely blocks compensatory survival signaling in zebrafish xenograft models. Showcasing promising in
Patryk Rurka +9 more
wiley +1 more source