A quantum min/max search that uses exact Grover-Long search instead of probabilistic Grover search, with oracle circuit simplifications and small IBM Q demonstrations.
Specifical ly, we propose two methods to reduce the failure rate and compare the complexity of DHA and our algorithm
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits
A quantum min/max search that uses exact Grover-Long search instead of probabilistic Grover search, with oracle circuit simplifications and small IBM Q demonstrations.