Quantum Computing Hardware

Gates H, Z and H are applied in that order to a qubit in |0⟩, which is then measured. What is the probability of getting 1?

  1. A0%
  2. B50%
  3. C100%
Show answer and explanation

Answer: C. 100%

The first H gives (|0⟩ + |1⟩)/√2, and Z flips the sign of the amplitude of |1⟩, giving (|0⟩ − |1⟩)/√2. A measurement at this point would give 0 and 1 with 50% each: Z has not changed the measurement probabilities, but it has changed the relative phase. The second H makes the |0⟩ components cancel and the |1⟩ components add, giving |1⟩, so the probability of getting 1 is 100%. Turning differences in phase into differences in measurement results through interference is the basic mechanism of quantum algorithms.

  • A. This is the value when Z is left out and H is applied twice.
  • B. This is the value for a measurement before the second H; it misses the fact that the phase change made by Z shows up in the result through interference.
  • C. Correct. The combination H, Z, H acts like an X gate and turns |0⟩ into |1⟩.
Practice this topic Back to topic

Books on Quantum Computing Hardware Ad

As an Amazon Associate I earn from qualifying purchases.

More Quantum Computing Hardware questions

  1. Why can't quantum error correction directly use the classical approach of making three copies of the data and taking a majority vote?
  2. Which correctly describes the energy relaxation time T1 of a qubit?
  3. Which correctly describes the relationship between the dephasing time T2 and the energy relaxation time T1 of a qubit?
  4. A circuit uses a two-qubit gate with a fidelity of 99.5% per operation (an error rate of 0.5%) 100 times in a row. Assuming errors occur independently, which is closest to the probability that no error occurs at all?
  5. Which is the most appropriate reason why the performance of quantum computers cannot be compared by their number of qubits alone?