Skip to main content
Quantum Computing

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

5
  • $\begingroup$ Thank you. So I presume it is possible to use Option A to implement an oracle for Grover's max/min search as well? Something like "true if this bitstring's decimal value is above the given threshold". $\endgroup$ Commented Feb 10, 2021 at 1:58
  • 1
    $\begingroup$ Not yet! Right now it just supports operations on binary values (not and or ^ (xor)). But support for integer valued operations (like >) can be added in future. $\endgroup$ Commented Feb 10, 2021 at 10:06
  • $\begingroup$ Is there any benefit in using method B over method A ? $\endgroup$ Commented Feb 10, 2021 at 10:46
  • $\begingroup$ Yes, it uses one less qubit :) $\endgroup$ Commented Feb 10, 2021 at 17:45
  • $\begingroup$ @Cryoris I See. Thank you! $\endgroup$ Commented Feb 15, 2021 at 2:05