Skip to content
Tech Interview Prep
Technical interview guide

Qubits, Superposition & Quantum State Representation

How a qubit's state differs from a classical bit: superposition, the Bloch sphere, and bra-ket notation for describing quantum states.

Read
49 min
Practice MCQs
25
Interview Q&A
25
Edition
v2
Editorial status
Reviewed

Scope: IBM Quantum information and Qiskit current documentation; OpenQASM 3; QuTiP 5.4; Preskill notes; no-cloning and tomography source literature reviewed 2026-09-04.

Curated: · Written: · Reviewed:

25 questions

MCQ-10A team simulates a 2-qubit register. One engineer sizes a statevector buffer (one complex amplitude per basis state); a colleague sizes a full density matrix instead. How many complex amplitudes does the statevector buffer hold?
MCQ-11A team is sizing memory for one run of a 24-qubit circuit. Qubits 0-2 are prepared in |0> and never touched again; the remaining 21 qubits pass through a circuit that leaves them in a general entangled pure state with no exploitable structure. The simulator keeps the smallest dense array of complex amplitudes that represents the final state exactly, with each amplitude stored as complex64 (8 bytes). What does that array hold?
MCQ-12A 4-qubit Qiskit circuit is drawn with q0 on the top wire and q3 on the bottom. It is run as written (no transpilation) and returns the counts key '0100'. Which qubit is in state |1⟩?
MCQ-25A qubit is prepared in the state |+> = (|0> + |1>)/√2. It is measured in the computational basis {|0>, |1>}. Which statement correctly gives the probability of outcome |0> and the reason the two outcome probabilities sum to one?
MCQ-2A simulator stores a qubit as α|0⟩ + β|1⟩ and asserts |α|² + |β|² = 1 (tolerance 1e-9) before each run. A test sets α = 0.5 + 0.5i and β = 0.5 − 0.5i. What does the assertion compute, and what is its verdict?
MCQ-3A simulator stores a qubit state as the column vector |psi> = [ (1+i)/2 , (1-i)/2 ] in the computational basis, and a diagnostic routine must compute the inner product <psi|psi> to confirm the state is normalised. The routine builds the bra row vector by taking the transpose of the column and conjugating each entry, then multiplies bra times ket. What value does the routine report?
MCQ-9A qubit is prepared in the state |ψ⟩ = (1/√2)(|0⟩ + |1⟩). Engineer A rewrites |ψ⟩ in the X basis (|+⟩, |−⟩) and reports the two amplitudes. Engineer B, working with a separate qubit in the same prepared state, applies a Hadamard gate and then measures in the computational basis. Which pair of results is correct?
MCQ-7A qubit is prepared in one of two states, |+> = (|0> + |1>)/√2 or |-> = (|0> − |1>)/√2. In 1000 shots measured in the computational basis, both states return 0 about 500 times and 1 about 500 times, so the two histograms are indistinguishable. The same states are then measured in the X basis (the Hadamard basis). Which statement explains why the X-basis results now separate the two states?
MCQ-6A qubit is prepared in the state |psi> = (|0> + exp(i*pi/4)|1>) / sqrt(2). A routine multiplies the entire two-component state by exp(i*pi/3). A gate then multiplies only the |1> amplitude by exp(i*pi/4). The final state is measured in the X basis, where |+> = (|0> + |1>) / sqrt(2). What is the probability of the outcome |+>?
MCQ-5A qubit simulator must implement a two-outcome projective measurement in which outcome 0 is certain on |0> and outcome 1 is certain on |1>. The code currently uses P0 = |0><0| and P+ = |+><+|, with |+> = (|0> + |1>)/sqrt(2). Running 10,000 shots on |1> reports p(0) = 0.00 and p(+) = 0.50, and 10,000 shots on |0> reports p(0) = 1.00 and p(+) = 0.50. Which single change fixes the measurement?
MCQ-8A control engineer is calibrating single-qubit rotations on a superconducting transmon. She prepares the qubit with a pi/2 pulse about the y-axis starting from |0>, then applies a pi pulse about the x-axis, and reads out the state. She wants to predict the readout by tracking the state as a point on the Bloch sphere. After the two pulses, where does the state vector point, and what does that point tell her about the qubit?
MCQ-1An engineer prepares a qubit in the state |psi> = (1/2)|0> + (sqrt(3)/2)|1>. The circuit applies a Hadamard gate, then a phase gate R(pi/3) that leaves |0> unchanged and multiplies the |1> amplitude by exp(i*pi/3), then a second Hadamard gate. The qubit is measured in the computational basis. What is the probability of reading outcome 0?
MCQ-4A source emits the qubit state |psi0> = |0> on half its shots and |psi1> = (3/5)|0> + (4/5)|1> on the other half. An engineer gets a single shot, may measure the qubit in any basis she chooses, and must then name which of the two states it was. Over all such single-shot measurements, how low can her error probability go?
MCQ-20Two runs of a single-qubit device, 100,000 shots each, report 50,013 and 49,987 counts of |0> against |1>. Run A prepares |0> or |1> by coin flip; run B applies a Hadamard to |0>. A colleague argues the two runs prepare the same state and the difference is noise. Which measurement, with the counts it produces, settles this?
MCQ-17A qubit is prepared in the mixed state ρ = 0.7|0⟩⟨0| + 0.3|1⟩⟨1|. An engineer sums the diagonal entries of ρ in the computational basis, then rewrites ρ in the Hadamard basis and sums the diagonal again. What do the two sums give?
MCQ-14A simulator holds a two-qubit pure state |ψ⟩ = (√3/2)|00⟩ + (1/2)|11⟩ and forms its density matrix with the standard outer-product rule ρ = |ψ⟩⟨ψ|. A unit test reads the off-diagonal entry ρ_{00,11}. Which value should it expect?
MCQ-18A 2-qubit register is prepared in the Bell state |Φ+⟩ = (|00⟩ + |11⟩)/√2, and the lab measures the purity of the full 2-qubit state as Tr(ρ²). A teammate then traces out qubit B and measures the purity of qubit A's reduced state ρ_A. What pair of values should the lab report?
MCQ-15A 2-qubit register is prepared in the state |ψ⟩ = (|00⟩ + |01⟩ + |10⟩ + |11⟩)/2, and a calibration fault applies a Z rotation of angle θ to qubit 1 only, giving the state |ψ'⟩ = (|00⟩ + |01⟩ − |10⟩ − |11⟩)/2. An engineer reconstructs the single-qubit reduced density matrix ρ₁ = Tr₂(|ψ'⟩⟨ψ'|) and checks it numerically. Which matrix does the trace produce, and does it pass the density-matrix validity test?
MCQ-16A source prepares two qubits in the pure state (|00> + |11>)/sqrt(2) and gives you only qubit A; qubit B is discarded before you can see it. A second source prepares the pair as a classical mixture: with probability 1/2 the pair is |00>, with probability 1/2 it is |11>, and again gives you only A. You receive 1000 copies of A from one of these sources and may measure each copy in any basis. What is the correct account of your ability to identify the source?
MCQ-19A 2-qubit register is prepared in the Bell state |Φ+⟩ = (|00⟩ + |11⟩)/√2, with qubit A held by Alice and qubit B sent to Bob. Alice measures her qubit in the computational basis and records the outcome, but Bob never learns it. Bob then measures his own qubit in the computational basis. What does Bob's measurement statistics look like, and why?
MCQ-13A two-qubit register is prepared in the pure state |ψ⟩ = (|00⟩ + |01⟩ + |10⟩ + |11⟩)/2. A teammate argues it must be entangled because all four amplitudes are nonzero. Which check settles whether the state is separable?
MCQ-22A lab has 4,000 copies of an unknown single-qubit state. They measure all copies in the Z basis, reconstruct a density matrix with off-diagonal elements set to zero, and find its X-basis prediction disagrees with a later X-basis measurement on fresh copies. What should they do next to get a state that predicts both bases?
MCQ-21A team runs a quantum key distribution link using the BB84 protocol, where Alice sends each qubit in one of four nonorthogonal states and Bob measures in a randomly chosen basis. An engineer proposes adding a repeater node that, on each qubit, performs a fixed unitary that copies the qubit's state onto a spare qubit and forwards both copies, so that Bob can measure one copy in each basis and always match Alice. The link currently shows a 25% sifted-key error rate from eavesdropping checks. What happens to the error rate if the copying node is inserted?
MCQ-24A transpiler change is validated in CI by asserting that a 2-qubit circuit's final statevector equals the pre-optimization reference. In the |00>, |01>, |10>, |11> basis, one seed produces a = [0, 0.7071067811865476, 0.7071067811865476, 0] b = [0, -0.7071067811865476, -0.7071067811865476, 1.1102230246251565e-16] The assertion must accept a against b. The same run must also reject b' = [0, 0.7071067811865476, -0.7071067811865476, 0] which the transpiler produced after a genuine relative-phase regression. Which check does both?
MCQ-23A team simulates a 15-qubit GHZ circuit with an ideal statevector simulator and 4096 shots. The simulator returns only |000...0> and |111...1>, each about 2048 times. On a superconducting backend the same circuit returns those two bitstrings 1760 and 1690 times, plus 646 other bitstrings. They want to know whether the circuit logic is correct before filing a hardware bug. What should they do?