New answers tagged quantum-fourier-transform
3
I think the algorithm class you are referring to is EQP (Exact Quantum Polynomial-Time).
There is a famous breakthrough paper by Ambainis that shows for a superlinear advantage between exact quantum algorithms over their classical counterparts (classical deterministic algorithms) for the query complexity of a total Boolean function. Later Ambainis, Iraids ...
2
In order to understand why this does not work, let us consider the circuit you've created with two measurement qubits:
Running this circuit using the following code:
backend = Aer.get_backend('aer_simulator')
job = execute(mycircuit, backend)
result = job.result()
result.get_counts()
yielded for me:
{'11': 499, '01': 525}
If we write down the state you ...
Top 50 recent answers are included