Bernstein-Vazirani We are interested in estimating the space…
Bernstein-Vazirani We are interested in estimating the space and query complexity of the Bernstein-Vazirani (BV) algorithm for a problem with a 64-bit secret key. For the quantum version, the number of CNOT gates to implement BV can range from to , depending on the key (assuming all qubits start in the “0” state). For the quantum version (noise-free), the number of queries required to solve the BV problem is query(ies). For the classical version, the number of queries required to solve the BV problem is query(ies). Answer the following four questions, you must report numerical answers.
Read DetailsGrover’s Algorithm part-1 Step-0 in Grover’s algorithm is co…
Grover’s Algorithm part-1 Step-0 in Grover’s algorithm is computing a Hadamard over all the 128 states. After this step what is the probability amplitude corresponding to ? (You must enter a numerical answer in the closed interval [-1,1] and you must keep the leading zero if there is one. Keep three decimal places.)
Read Details