Practice

Short rounds pulled from the checks at the end of each entry. In a round your first answer counts. Each one comes with the reasoning, and the round ends with a list of what to reread.

Every question, with answers

For studying instead of testing. New entries add their checks here when they publish.

  • Why are almost all nn-qubit states entangled? Software

    B. A product of nn single-qubit states is fixed by nn complex numbers, but a general nn-qubit state needs 2n−12^n - 1 Each qubit of a product state is one number, so nn qubits give nn, while the whole space needs 2n−12^n - 1. For n=10n = 10 that is 10 against 1,023, so nearly every state can't be split into separate qubits (Rieffel & Polak, §3.2, p. 38).

    From: Quantum Information Processing: Foundations - Part 4

  • Is 710∣00⟩+110∣01⟩+110∣10⟩+710∣11⟩\frac{7}{10}|00\rangle + \frac{1}{10}|01\rangle + \frac{1}{10}|10\rangle + \frac{7}{10}|11\rangle entangled? Software

    C. Yes: ad−bc=49100−1100≠0ad - bc = \frac{49}{100} - \frac{1}{100} \neq 0 ad−bc=0.48ad - bc = 0.48, which is not zero, so no choice of two single-qubit states can produce it. Rieffel & Polak give this state as one of their examples of entanglement (§3.2, p. 38).

    From: Quantum Information Processing: Foundations - Part 4

  • Alice applies ZZ to her qubit of ∣Φ+⟩|\Phi^+\rangle and does nothing else. What is the pair's state? Software

    B. ∣Φ−⟩=12(∣00⟩−∣11⟩)|\Phi^-\rangle = \frac{1}{\sqrt{2}}(|00\rangle - |11\rangle) (Z⊗I)12(∣00⟩+∣11⟩)=12(∣00⟩−∣11⟩)(Z \otimes I)\frac{1}{\sqrt{2}}(|00\rangle + |11\rangle) = \frac{1}{\sqrt{2}}(|00\rangle - |11\rangle). One Pauli gate on one qubit reaches all four Bell states, which is how dense coding sends two bits by sending one qubit (Rieffel & Polak, §5.3.1, pp. 81–82).

    From: Quantum Information Processing: Foundations - Part 4

  • Alice and Bob share many copies of ∣Φ+⟩|\Phi^+\rangle. Alice chooses which angle to measure hers at. Can Bob learn her choice by looking only at his own results? Software

    D. No: the correlation shows only when the two lists are compared, which takes ordinary communication Each side alone sees a fair coin; the agreement appears only when results are brought together. That is why an EPR pair can't send a message faster than light (Rieffel & Polak, §4.4, p. 61).

    From: Quantum Information Processing: Foundations - Part 4

  • In the three-angle game, quantum mechanics predicts the two results agree half the time. What is the least any set of hidden instructions can give? Software

    C. 59\frac{5}{9} Every instruction set agrees in at least 5 of the 9 equally likely settings, so no local hidden-variable theory can bring agreement down to the 12\frac{1}{2} seen in experiments (Rieffel & Polak, §4.4.3, pp. 63–64).

    From: Quantum Information Processing: Foundations - Part 4

  • What is the concurrence of 710∣00⟩+110∣01⟩+110∣10⟩+710∣11⟩\frac{7}{10}|00\rangle + \frac{1}{10}|01\rangle + \frac{1}{10}|10\rangle + \frac{7}{10}|11\rangle? Software

    B. 0.960.96 C=2∣ad−bc∣=2×0.48=0.96\mathcal{C} = 2|ad - bc| = 2 \times 0.48 = 0.96: strongly entangled, but less than a Bell state.

    From: Quantum Information Processing: Foundations - Part 4

  • You measure ∣01⟩|01\rangle in the Bell basis. What can you get? Software

    B. ∣Ψ+⟩|\Psi^+\rangle or ∣Ψ−⟩|\Psi^-\rangle, each with probability 12\frac{1}{2} ∣Ψ+⟩+∣Ψ−⟩=2∣01⟩|\Psi^+\rangle + |\Psi^-\rangle = \sqrt{2}|01\rangle, so ∣01⟩=12(∣Ψ+⟩+∣Ψ−⟩)|01\rangle = \frac{1}{\sqrt{2}}(|\Psi^+\rangle + |\Psi^-\rangle), and each has squared amplitude 12\frac{1}{2} (Rieffel & Polak, §3.2, p. 39).

    From: Quantum Information Processing: Foundations - Part 4

  • After (H⊗H⊗H)∣000⟩(H \otimes H \otimes H)|000\rangle, what is the amplitude of ∣101⟩|101\rangle? Software

    A. 122\frac{1}{2\sqrt{2}} Each H∣0⟩=12(∣0⟩+∣1⟩)H|0\rangle = \frac{1}{\sqrt{2}}(|0\rangle + |1\rangle), so every one of the 232^3 basis states gets (12)3=18=122\left(\frac{1}{\sqrt{2}}\right)^3 = \frac{1}{\sqrt{8}} = \frac{1}{2\sqrt{2}}.

    From: Quantum Information Processing: Foundations - Part 4

  • In teleportation, what must Alice send Bob before he can recover the state? Software

    A. Two classical bits: her measurement results, which tell Bob which Pauli gate to apply Alice's two measurements give two bits that pick Bob's correction: II, XX, ZZ or YY. Teleportation sends a qubit with two classical bits and a shared EPR pair, and is the mirror image of dense coding (Rieffel & Polak, §5.3.2, pp. 82–84).

    From: Quantum Information Processing: Foundations - Part 4

  • Two qubits are in ∣Φ+⟩|\Phi^+\rangle. Looked at on its own, what state is the first qubit in? Software

    C. No pure state: on its own it is as uncertain as a qubit can be This is what maximally entangled means: each qubit alone is the maximally mixed state 12I\frac{1}{2}I, with all the information in the correlations (Rieffel & Polak, §10.2.1, p. 218).

    From: Quantum Information Processing: Foundations - Part 4

  • Can single-qubit gates applied separately to each qubit, U⊗VU \otimes V, turn ∣Φ+⟩|\Phi^+\rangle into the product state ∣00⟩|00\rangle? Software

    A. No: U⊗VU \otimes V never changes whether a state is entangled Entanglement isn't a local property: transformations acting separately on the parts can't create or remove it. Undoing a Bell state takes a two-qubit gate, the CNOT in the entry's circuit run backwards (Rieffel & Polak, §5.2.3, p. 76).

    From: Quantum Information Processing: Foundations - Part 4

  • The book's version of the three-angle game sets polarisers at −60∘-60^\circ, 0∘0^\circ and +60∘+60^\circ, while the entry uses 0∘0^\circ, 120∘120^\circ and 240∘240^\circ. Both give agreement 14\frac{1}{4} when the settings differ. Why? Software

    B. The entry's angles are on the Bloch sphere, which doubles the polariser's angles: 120∘120^\circ there is 60∘60^\circ at the polariser The book's rule is cos⁡2(θ1−θ2)\cos^2(\theta_1 - \theta_2) for polariser angles; the entry's is cos⁡2θA−θB2\cos^2\frac{\theta_A - \theta_B}{2} for Bloch angles. Angles on the Bloch sphere are twice those between the state vectors (Rieffel & Polak, §2.5.2, p. 25; §4.4.2, pp. 62–63).

    From: Quantum Information Processing: Foundations - Part 4

  • Quantum gates are reversible. Which of these classical gates can't be made reversible using only its own two bits? Software

    C. AND AND maps four inputs to two outputs, so information is lost. Reversibly it needs a third bit: the Toffoli gate takes (b1,b0,0)(b_1, b_0, 0) to (b1,b0,b1∧b0)(b_1, b_0, b_1 \wedge b_0) (Rieffel & Polak, §6.1.1, p. 101).

    From: Quantum Information Processing: Foundations - Part 3

  • The entry's YY is [0−ii0]\begin{bmatrix}0 & -i \\ i & 0\end{bmatrix}. Rieffel & Polak's YY is [01−10]\begin{bmatrix}0 & 1 \\ -1 & 0\end{bmatrix}. How are they related? Software

    B. The book's YY is ii times the entry's: the same transformation up to a global phase The book uses Y=ZX=∣0⟩⟨1∣−∣1⟩⟨0∣Y = ZX = |0\rangle\langle 1| - |1\rangle\langle 0| and notes that −iY-iY, the entry's version, is also called the Pauli YY. Since the two differ by the factor ii, they act identically on every state, up to a global phase (Rieffel & Polak, §5.2.1, pp. 75–76).

    From: Quantum Information Processing: Foundations - Part 3

  • What single gate equals HH, then ZZ, then HH (HZHHZH)? Software

    A. XX HH sends ∣0⟩|0\rangle to ∣+⟩|+\rangle and ∣1⟩|1\rangle to ∣−⟩|-\rangle. ZZ swaps ∣+⟩|+\rangle and ∣−⟩|-\rangle, and the second HH maps them back, so the whole thing swaps ∣0⟩|0\rangle and ∣1⟩|1\rangle: a NOT (Rieffel & Polak, §5.2.2, p. 76).

    From: Quantum Information Processing: Foundations - Part 3

  • How many TT gates in a row make a ZZ gate? Software

    B. 4 TT puts eiπ/4e^{i\pi/4} on ∣1⟩|1\rangle, so T4T^4 puts eiπ=−1e^{i\pi} = -1 there: T4=S2=ZT^4 = S^2 = Z (Rieffel & Polak, §5.2.1, p. 75).

    From: Quantum Information Processing: Foundations - Part 3

  • Two qubits start unentangled. Why do you need a two-qubit gate such as CNOT to entangle them, rather than one single-qubit gate on each? Software

    C. A gate of the form U⊗VU \otimes V acts on each qubit separately, so it can neither create nor remove entanglement (U⊗V)∣ψ⟩(U \otimes V)|\psi\rangle is entangled exactly when ∣ψ⟩|\psi\rangle is. CNOT can't be written as a tensor product of two single-qubit gates, which is why it can take 12(∣0⟩+∣1⟩)∣0⟩\frac{1}{\sqrt{2}}(|0\rangle + |1\rangle)|0\rangle to 12(∣00⟩+∣11⟩)\frac{1}{\sqrt{2}}(|00\rangle + |11\rangle) (Rieffel & Polak, §5.2.3–5.2.4, pp. 76–77).

    From: Quantum Information Processing: Foundations - Part 3

  • SWAP is CNOT1,2\mathrm{CNOT}_{1,2} then CNOT2,1\mathrm{CNOT}_{2,1} then CNOT1,2\mathrm{CNOT}_{1,2}. Stop after the first two. What does (a,b)(a, b) become? Software

    C. (b,a⊕b)(b, a \oplus b) CNOT1,2\mathrm{CNOT}_{1,2} gives (a,a⊕b)(a, a \oplus b). CNOT2,1\mathrm{CNOT}_{2,1} then replaces qubit 1 with a⊕(a⊕b)=ba \oplus (a \oplus b) = b, leaving (b,a⊕b)(b, a \oplus b). The third CNOT finishes the swap.

    From: Quantum Information Processing: Foundations - Part 3

  • Which matrix applies HH to the first of two qubits and leaves the second alone, in the order ∣00⟩,∣01⟩,∣10⟩,∣11⟩|00\rangle, |01\rangle, |10\rangle, |11\rangle? Software

    B. H⊗IH \otimes I Applying UU to qubit ii of nn means applying I⊗⋯⊗U⊗⋯⊗II \otimes \cdots \otimes U \otimes \cdots \otimes I with UU in position ii. For the first of two qubits that is H⊗IH \otimes I (Rieffel & Polak, §5.2, p. 75).

    From: Quantum Information Processing: Foundations - Part 3

  • Which of these is not a valid quantum gate? Software

    D. X+Z2\frac{X + Z}{2} Gates must be unitary. Sums of unitaries usually aren't: X+Z2\frac{X + Z}{2} has columns of length 12\frac{1}{\sqrt{2}}, so it would shrink states. Scaling by 12\frac{1}{\sqrt{2}} instead of 12\frac{1}{2} happens to give HH (Rieffel & Polak, §5.1, pp. 72–73).

    From: Quantum Information Processing: Foundations - Part 3

  • What do you get by applying HH twice to ∣1⟩|1\rangle? Software

    D. ∣1⟩|1\rangle HH=IHH = I: the Hadamard gate is its own inverse (Rieffel & Polak, §5.2.2, p. 76).

    From: Quantum Information Processing: Foundations - Part 3

  • The entry says HH, CNOT and TT can approximate any quantum computation. Why approximate, and not exactly? Software

    C. There are uncountably many unitaries, but a finite set of gates can build only countably many circuits No finite gate set generates every unitary exactly, but some finite sets approximate any of them as closely as you like, and efficiently, by the Solovay-Kitaev theorem (Rieffel & Polak, §5.2, p. 74; §5.5, p. 91).

    From: Quantum Information Processing: Foundations - Part 3

  • Two single-qubit states are orthogonal, like ∣0⟩|0\rangle and ∣1⟩|1\rangle or ∣+⟩|+\rangle and ∣−⟩|-\rangle. Where do they sit on the Bloch sphere? Software

    B. At opposite ends of a diameter Orthogonal states are antipodal on the Bloch sphere, so every diameter is a measurement basis. The sphere's angles are twice the angles in the inner-product picture (Rieffel & Polak, §2.5.2, p. 25).

    From: Quantum Information Processing: Foundations - Part 2

  • The general state eiγ(cos⁡θ2∣0⟩+eiϕsin⁡θ2∣1⟩)e^{i\gamma}\left(\cos\frac{\theta}{2}|0\rangle + e^{i\phi}\sin\frac{\theta}{2}|1\rangle\right) is drawn on the Bloch sphere without its eiγe^{i\gamma}. Why can that factor go? Software

    A. It is a global phase: it changes no measurement probability, so it is not part of the state Vectors that differ by a factor of magnitude 1 represent the same quantum state, so the ket picture has a redundancy that the sphere doesn't: each point on the sphere's surface is exactly one state (Rieffel & Polak, §2.5.1, p. 21; §2.5.2, p. 24).

    From: Quantum Information Processing: Foundations - Part 2

  • The Bloch form is cos⁡θ2∣0⟩+eiϕsin⁡θ2∣1⟩\cos\frac{\theta}{2}|0\rangle + e^{i\phi}\sin\frac{\theta}{2}|1\rangle, with θ\theta from 00 to π\pi. Why θ2\frac{\theta}{2} and not θ\theta? Software

    A. So that θ=π\theta = \pi, the opposite pole, gives ∣1⟩|1\rangle, the state orthogonal to ∣0⟩|0\rangle With θ2\frac{\theta}{2}, moving from the north pole (θ=0\theta = 0) to the south pole (θ=π\theta = \pi) turns the vector by π2\frac{\pi}{2}, from ∣0⟩|0\rangle to ∣1⟩|1\rangle. Angles on the sphere are double the angles between the vectors (Rieffel & Polak, §2.5.2, p. 25).

    From: Quantum Information Processing: Foundations - Part 2

  • Which pair represents the same quantum state? Software

    D. ∣+⟩|+\rangle and i∣+⟩i|+\rangle i∣+⟩i|+\rangle multiplies the whole vector by ii, a global phase, so it is the same state. Changing the phase of only one amplitude is a relative phase and gives a different state (Rieffel & Polak, §2.5.1, pp. 21–22).

    From: Quantum Information Processing: Foundations - Part 2

  • Following the hint, what are θ\theta and ϕ\phi for ∣−i⟩=12(∣0⟩−i∣1⟩)|{-i}\rangle = \frac{1}{\sqrt{2}}(|0\rangle - i|1\rangle)? Software

    B. θ=π2\theta = \frac{\pi}{2}, ϕ=3π2\phi = \frac{3\pi}{2} cos⁡θ2=12\cos\frac{\theta}{2} = \frac{1}{\sqrt{2}} gives θ=π2\theta = \frac{\pi}{2}, and eiϕ=−ie^{i\phi} = -i gives ϕ=3π2\phi = \frac{3\pi}{2} (or −π2-\frac{\pi}{2}). That is the point (0,−1,0)(0, -1, 0) on the sphere (Rieffel & Polak, §2.5.2, p. 24).

    From: Quantum Information Processing: Foundations - Part 2

  • A state on the Bloch sphere has θ=π3\theta = \frac{\pi}{3}. What is the probability of measuring ∣0⟩|0\rangle? Software

    C. 34\frac{3}{4} The amplitude of ∣0⟩|0\rangle is cos⁡π6=32\cos\frac{\pi}{6} = \frac{\sqrt{3}}{2}, so the probability is 34\frac{3}{4} (Rieffel & Polak, §2.3, p. 17).

    From: Quantum Information Processing: Foundations - Part 2

  • You keep θ\theta fixed and change only ϕ\phi, moving the state around a circle of latitude. What happens to the probabilities of measuring ∣0⟩|0\rangle and ∣1⟩|1\rangle? Software

    A. Nothing: ϕ\phi is a relative phase, and standard-basis probabilities depend only on θ\theta P(0)=cos⁡2θ2P(0) = \cos^2\frac{\theta}{2} and P(1)=sin⁡2θ2P(1) = \sin^2\frac{\theta}{2}. ϕ\phi still matters, though: it changes the state, and measuring in another basis, such as the Hadamard basis, shows it (Rieffel & Polak, §2.5.1, p. 22).

    From: Quantum Information Processing: Foundations - Part 2

  • For which θ\theta is eiθ∣1⟩e^{i\theta}|1\rangle equivalent to ∣1⟩|1\rangle? Software

    A. Every θ\theta eiθe^{i\theta} multiplies the whole vector, so it is a global phase for any θ\theta (Rieffel & Polak, §2.5.1, p. 21).

    From: Quantum Information Processing: Foundations - Part 2

  • For ∣ψ⟩=12(∣0⟩+i∣1⟩)|\psi\rangle = \frac{1}{\sqrt{2}}(|0\rangle + i|1\rangle), which of these is the bra ⟨ψ∣\langle\psi|? Software

    A. 12(⟨0∣−i⟨1∣)\frac{1}{\sqrt{2}}(\langle 0| - i\langle 1|) A bra is the conjugate transpose of its ket: the column becomes a row and every amplitude is complex-conjugated, so ii becomes −i-i (Rieffel & Polak, §2.2, p. 15).

    From: Quantum Information Processing: Foundations - Part 1

  • For a unit vector ∣ψ⟩|\psi\rangle, what is the outer product ∣ψ⟩⟨ψ∣|\psi\rangle\langle\psi|? Software

    D. The projection onto ∣ψ⟩|\psi\rangle: it keeps the part of a state along ∣ψ⟩|\psi\rangle and removes the rest (∣ψ⟩⟨ψ∣)∣ϕ⟩=∣ψ⟩⟨ψ∣ϕ⟩(|\psi\rangle\langle\psi|)|\phi\rangle = |\psi\rangle\langle\psi|\phi\rangle: the inner product with ∣ψ⟩|\psi\rangle scales a copy of ∣ψ⟩|\psi\rangle. Operators written as ∣i⟩⟨j∣|i\rangle\langle j| are how Dirac notation describes every linear transformation, and projectors like this one describe measurement (Rieffel & Polak, §4.1–4.2, pp. 47–49).

    From: Quantum Information Processing: Foundations - Part 1

  • A qubit in 32∣0⟩+12∣1⟩\frac{\sqrt{3}}{2}|0\rangle + \frac{1}{2}|1\rangle is measured in the standard basis and the result is ∣1⟩|1\rangle. You measure it again in the same basis. What do you get? Software

    A. ∣1⟩|1\rangle, with certainty Measurement moves the state onto the basis vector it reports; a second measurement in the same basis returns that vector with probability 1. That is also why a single measurement can't reveal the original amplitudes (Rieffel & Polak, §2.3, p. 17).

    From: Quantum Information Processing: Foundations - Part 1

  • 12(∣0⟩+∣1⟩)\frac{1}{\sqrt{2}}(|0\rangle + |1\rangle) and 12(∣0⟩−∣1⟩)\frac{1}{\sqrt{2}}(|0\rangle - |1\rangle) both give 0 and 1 half the time when measured in the standard basis. Are they the same state? Software

    C. No: they differ by a relative phase, and the Hadamard basis tells them apart every time These are ∣+⟩|+\rangle and ∣−⟩|-\rangle. Measured in the Hadamard basis {∣+⟩,∣−⟩}\{|+\rangle, |-\rangle\}, each gives its own outcome with certainty. A relative phase is physically meaningful; a global phase is not (Rieffel & Polak, §2.5.1, p. 22; §2.3, p. 17).

    From: Quantum Information Processing: Foundations - Part 1

  • A qubit in ∣−⟩|-\rangle is measured in the Hadamard basis {∣+⟩,∣−⟩}\{|+\rangle, |-\rangle\}. What do you get? Software

    B. ∣−⟩|-\rangle, with certainty ∣⟨−∣−⟩∣2=1|\langle -|-\rangle|^2 = 1 and ∣⟨+∣−⟩∣2=0|\langle +|-\rangle|^2 = 0. Whether a state looks random depends on the basis: ∣−⟩|-\rangle is random in the standard basis and certain in the Hadamard basis (Rieffel & Polak, §2.3, p. 17).

    From: Quantum Information Processing: Foundations - Part 1

  • Cirq measures in the standard basis, so the article applies S†S^\dagger and then HH before measuring in {∣i⟩,∣−i⟩}\{|i\rangle, |{-i}\rangle\}. What do those two gates do? Software

    B. They turn ∣i⟩|i\rangle into ∣0⟩|0\rangle and ∣−i⟩|{-i}\rangle into ∣1⟩|1\rangle, so a standard-basis result reads as an ii-basis result S†∣i⟩=∣+⟩S^\dagger|i\rangle = |+\rangle and H∣+⟩=∣0⟩H|+\rangle = |0\rangle; S†∣−i⟩=∣−⟩S^\dagger|{-i}\rangle = |-\rangle and H∣−⟩=∣1⟩H|-\rangle = |1\rangle. Applying a unitary and then measuring in the standard basis gives the same statistics as measuring in the basis it maps onto the standard one (Rieffel & Polak, §5.1, p. 72).

    From: Quantum Information Processing: Foundations - Part 1

  • Which of these is not a valid qubit state? Software

    B. 12∣0⟩+12∣1⟩\frac{1}{2}|0\rangle + \frac{1}{2}|1\rangle A qubit a∣0⟩+b∣1⟩a|0\rangle + b|1\rangle needs ∣a∣2+∣b∣2=1|a|^2 + |b|^2 = 1. Here 14+14=12\frac{1}{4} + \frac{1}{4} = \frac{1}{2}, so this vector is not normalised (Rieffel & Polak, §2.2, p. 15).

    From: Quantum Information Processing: Foundations - Part 1

  • A qubit is 1−i2∣0⟩+12∣1⟩\frac{1-i}{2}|0\rangle + \frac{1}{\sqrt{2}}|1\rangle. What is the probability of measuring ∣0⟩|0\rangle? Software

    C. 12\frac{1}{2} ∣1−i2∣2=1+14=12\left|\frac{1-i}{2}\right|^2 = \frac{1+1}{4} = \frac{1}{2}, and ∣12∣2=12\left|\frac{1}{\sqrt{2}}\right|^2 = \frac{1}{2}, so the two add to 1 as they must (Rieffel & Polak, §2.3, pp. 16–17).

    From: Quantum Information Processing: Foundations - Part 1

  • Is −∣0⟩-|0\rangle a different state from ∣0⟩|0\rangle? Software

    B. No: −1-1 is a global phase, and global phases have no physical meaning Vectors that differ by a factor of magnitude 1, like −1-1, ii or eiϕe^{i\phi}, represent the same quantum state (Rieffel & Polak, §2.5.1, p. 21).

    From: Quantum Information Processing: Foundations - Part 1

  • A qubit can be in infinitely many states. How much classical information can one measurement of it give you? Software

    A. At most one bit Each measurement yields one of the two basis states and changes the qubit, so one qubit gives up at most one classical bit (Rieffel & Polak, §2.3, pp. 17–18).

    From: Quantum Information Processing: Foundations - Part 1