0
$\begingroup$

I am a beginner in quantum computing. I have already computed the sat quantum solver with Grover search and then, I would like to compute the "minimum search" of Dür and Hoyer. My question is: Is it possible to encode a list with two registers of qubits?

If it is possible, I would like to see a general methods with explanations of how to encode a list in a quantum circuit. :)

Ref: A Quantum Algorithm for Finding the Minimum

$\endgroup$
  • $\begingroup$ Hi and welcome to Quatum computing SE. I am afraid that currently the minimisation algorithm you linked is impossible to implement on current quantum computer as they do not have RAM memory (qRAM) which could contain the table with function values. See discussion on qRAM here quantumcomputing.stackexchange.com/questions/9413/…. $\endgroup$ – Martin Vesely Apr 5 at 6:35
  • $\begingroup$ Here quantumcomputing.stackexchange.com/questions/9507/… you can see discussion on another algorithm using the minimization. As you can see, the minimization is only discussed however practical implementation is not provided. $\endgroup$ – Martin Vesely Apr 5 at 21:38
  • 1
    $\begingroup$ thank you! but if I want to « test » this algorithm, is it possible to simulate the QRAM ? And create an index state entangled with T[i] state. $\endgroup$ – julien rodriguez Apr 6 at 5:52
0
$\begingroup$

This article purpose a method to encode a list in quantum circuit.

An example for the list : [1, 3, 0, 2] and the Grover search, where is 0 ? Grover search

And the result : index 2 Result

| improve this answer | |
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.