This is a purely hypothetical answer - I don't know if anybody has ever studied it, and have not attempted to find out - but think about public key cryptography. Current public key systems are based on the idea that some problems in the complexity class NP are probably hard to solve directly, but there exists a "proof" that lets you verify the solution ...


As far as I know, there are four possibilities for having a quantum advantage in Bayesian machine learning: Gaussian processes: there is a known quantum speed-up for Gaussian processes that you can easily test on IBM Q [1,2]. The idea is to use HHL (quantum algorithm for matrix inversion) in order to compute the inverse of the kernel matrix, which is used ...


An application of the reflection operator change each amplitude of a basis state $ |i\rangle$ by $$ \alpha_i \rightarrow- \alpha_i + 2 \langle\alpha\rangle\ $$ where $ \langle\alpha\rangle\ $ is the average of all amplitudes. It follows the oracle which is use to "mark" the seeked elements $ |i\rangle$. Say for instance that you have 8 elements, so you ...


It seems that there is a missing $\mathrm{X}$ and $\mathrm{H}$ gates on qubit $q_2$. I used this Grover algoritm shape: Note 1: controlled $\mathrm{Z}$ is replaced by $\mathrm{CNOT}$ and Hadamards on both sides. Note 2: put your Oracle instead of dashed line. Note 3: you do not have to measure $q_2$.


It seems that $\mathrm{CNOT}$ gates should not be in your circuit. Here is Grover algorithm for 3 qubits: Put your Oracle instead of dashed line. The Oracle should have three inputs $q_0$, $q_1$ and $q_2$, output should be on qubit $q_3$ after $\mathrm{H}$ gate.


The error is caused by appending gates onto qubits following a measurement. On qubit 1 and qubit 0, you attach a cx gate after a measurementhas already been placed. This will compile on the simulator, but it is not something that is supported on the real hardware.


I don't think a hello world really exists here. You can have different points of view or goals here. I will give references. The first one is speeding up parts of the algorithm with a quantum version (here is an example reference). But here, we assume a perfect hardware. Another one is to apply it to quantum many-body systems. The interesting point here is ...


If you have one parameter (one $\theta$) for both circuits then I think the first one is better... they are doing the same job, but the second one is creating extra gates. So the first one will be faster and will have fewer errors because there are fewer gates in the first circuit. But if you are obtaining the second circuit with two parameters (two ...

Only top voted, non community-wiki answers of a minimum length are eligible