4

That looks right to me. Since, $HZH = X$ then we have that $\langle \psi | X | \psi \rangle = \langle \psi | HZH | \psi \rangle = \langle \psi H | Z | H\psi \rangle $. In your code, you generate $|\psi \rangle$ with a $U_3(\theta, \phi, \lambda) $ gate applied to $|0\rangle$. Then you applied the Hadamard gate ($H$) before measuring which is what needed ...


2

Yes, you can add at any time. The reservation system cares about the project you send the jobs from, not the individual users.


2

Firstly, you might be interested in paper Elementary gates for quantum computation explaining how complex gates can be decomposed to simpler ones. This would allow you understand how the matrix $U_j$ is decomposed. Before we proceeed further, we have to define gate $U1$ used on IBM Q computer: $$ U1(\lambda)= \begin{pmatrix} 1 & 0 \\ 0 & e^{i\lambda} ...


2

If all what you want is a list of all job IDs for the jobs in a job set: job_set = job_manager.retrieve_job_set(job_set_id = 'XXX-YYY', provider = provider) id_list = [ job.job_id() for job in job_set.jobs() ]


1

"Runtime" is not so easily quantified, it depends a lot on the compilation, the other operations in your circuit and whether you simulate or have a real backend. Generally, the different methods trade off circuit depth (more gates, but less qubits) against circuit width (more qubits, less gates). If we define the runtime by the number of gates we ...


1

This is because the last job is to extract the eigenstate. If you check the circuit, then you should see that it is just being measure in the Z basis. This circuit will give back the user the counts of the states that the Ansatz generated.


1

I don't think there is a feature to download a folder, but you can download the folder by zipping it first. To zip the folder, write in a new cell: !zip -r MyFolder.zip path/to/folder Then you can download the zip file. If you only want to download the .txt files, you can write: !zip MyFolder.zip path/to/folder/*.txt


1

From reading your post I assume that you calculate the CNOT error by: preparing one of the four states from {00,01,10,11} Applying a CNOT gate Measuring the final state The probalitiy of measuring {00,01,11,10}, respectively, is then what you (?) assume to be the cnot error If you follow this procedure then your 'CNOT error rate' will also be affected by ...


1

The article of Devoret and Schoelkopf [1] and an update provided in Section 7.1 of Reagor [2] makes a comparison between Moore's law and an observed trend of exponentially improving $T_1$ and $T_2$ times for superconducting qubits. The trend they present shows a roughly exponential improvement from $10^0$ to $10^6$ nanoseconds for $T_2$ between various ...


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