Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,258,700 papers from all fields of science
Search
Sign In
Create Free Account
Grover's algorithm
Known as:
Grover algorithm
, Grover (disambiguation)
, Grover search algorithm
Expand
Grover's algorithm is a quantum algorithm that finds with high probability the unique input to a black box function that produces a particular output…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
39 relations
Aanderaa–Karp–Rosenberg conjecture
Amplitude amplification
BHT algorithm
BQP
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Quantum Search Algorithms for Wireless Communications
Panagiotis Botsinis
,
Dimitrios Alanis
,
+4 authors
L. Hanzo
IEEE Communications Surveys and Tutorials
2019
Corpus ID: 69329214
Faster, ultra-reliable, low-power, and secure communications has always been high on the wireless evolutionary agenda. However…
Expand
Highly Cited
2016
Highly Cited
2016
Coherence depletion in the Grover quantum search algorithm
Hai-Long Shi
,
Siyuan Liu
,
Xiao-Hui Wang
,
Wen-Li Yang
,
Zhanying Yang
,
H. Fan
2016
Corpus ID: 119205655
We investigate the role of quantum coherence depletion (QCD) in the Grover search algorithm (GA) by using several typical…
Expand
Review
2012
Review
2012
All biological disciplines that depend on DNA sequence data have been fundamentally changed in the last few years, driven by the development and emergence of next-generation sequenc-
David. Spooner
,
A. Egan
,
J. Schlueter
,
David. Spooner
2012
Corpus ID: 9029611
American Journal of Botany 99(2): 175–185, 2012; http://www.amjbot.org/ © 2012 Botanical Society of America All biological…
Expand
Highly Cited
2010
Highly Cited
2010
Mutual Inductance Calculation Between Circular Filaments Arbitrarily Positioned in Space: Alternative to Grover's Formula
S. Babic
,
F. Sirois
,
C. Akyel
,
Claudio Girardi
IEEE transactions on magnetics
2010
Corpus ID: 21824499
In this paper, we present the full derivation of a new formula for calculating the mutual inductance between inclined circular…
Expand
Highly Cited
2009
Highly Cited
2009
VALIDITY CHECK OF MUTUAL INDUCTANCE FORMULAS FOR CIRCULAR FILAMENTS WITH LATERAL AND ANGULAR MISALIGNMENTS
S. Babic
,
F. Sirois
,
C. Akyel
2009
Corpus ID: 52218348
In this paper we derived the formula for calculating the mutual inductance between circular fllaments with lateral and angular…
Expand
Highly Cited
2008
Highly Cited
2008
Calculating Mutual Inductance Between Circular Coils With Inclined Axes in Air
S. Babic
,
C. Akyel
IEEE transactions on magnetics
2008
Corpus ID: 21361111
In this paper we present a lucid, easy, and accurate approach for calculation of the mutual inductance between all inclined…
Expand
Highly Cited
2008
Highly Cited
2008
Recurrence properties of unbiased coined quantum walks on infinite d -dimensional lattices
M. Štefaňák
,
T. Kiss
,
I. Jex
2008
Corpus ID: 119263550
The P\'olya number characterizes the recurrence of a random walk. We apply the generalization of this concept to quantum walks [M…
Expand
Highly Cited
2007
Highly Cited
2007
Quantum ternary parallel adder/subtractor with partially-look-ahead carry
Mozammel H. A. Khan
,
M. Perkowski
Journal of systems architecture
2007
Corpus ID: 36828342
Highly Cited
1996
Highly Cited
1996
Determinants of Commitment to Information Systems Development: A Longitudinal Investigation
M. Newman
,
R. Sabherwal
MIS Q.
1996
Corpus ID: 14971295
Commitment to an information systems (IS) development project is widely believed to affect the eventual success of the system…
Expand
Highly Cited
1994
Highly Cited
1994
Neural plasticity and development in the first two years of life: Evidence from cognitive and socioemotional domains of research
N. Fox
,
S. Calkins
,
M. A. Bell
Development and Psychopathology
1994
Corpus ID: 14998682
Abstract Three models that can be used to investigate the effects of different environmental events on brain development and…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE