Quantum Software Engineer Interview Questions

Option B is strongest. It provides the matrix representations for both gates (the precise mathematical definition expected at a quantum software engineering interview), explains the Bloch sphere interpretation for H (X-Z plane rotation), and lists all four CNOT truth table entries. The Bell state construction is shown step-by-step with the final state written in Dirac notation. The "why it cannot be written as a product state" explanation defines entanglement precisely — not just "they are correlated" but the specific non-separability property. The universality statement names all three gates in the universal gate set (H + CNOT + T) — T gate is often omitted by candidates who know H and CNOT but not the full set. The Qiskit code snippet shows practical implementation. Quantum gate vocabulary: Hadamard gate (H) — creates equal superposition from basis states; maps Z-axis to X-axis on the Bloch sphere. CNOT (controlled-NOT) — flips target qubit conditioned on control qubit being |1⟩. Bell state — maximally entangled two-qubit state; cannot be written as a product of individual qubit states. Universal gate set — a set of gates that can approximate any unitary transformation. T gate — the π/8 phase gate; required alongside H and CNOT for universality. Options C and D name the components correctly but lack the Bloch sphere interpretation and the entanglement definition.

Option B is strongest. The three-obstacle structure frames QEC as solving specific problems rather than just describing it as "error protection." The no-cloning theorem is derived correctly (follows from linearity, not just stated as a rule). The measurement obstacle introduces ancilla qubits and indirect syndrome measurement — the conceptual breakthrough of QEC — explaining precisely WHY syndrome measurement works (reveals which error occurred without measuring the logical qubit). The continuous error space section introduces the quantum threshold theorem (discrete Pauli X/Z correction suffices for all errors) — a deep result that most candidates do not articulate. The three-qubit bit-flip code is explained with the actual logical encoding (|0⟩L=|000⟩) and syndrome mechanism. The surface code section gives specific numbers: d² physical qubits, (d-1)/2 correction capacity, d=7 example (49 physical per logical). QEC vocabulary: No-cloning theorem — quantum mechanics prohibits copying unknown quantum states. Ancilla qubit — an auxiliary qubit used to measure error syndrome without disturbing the logical qubit. Syndrome measurement — an indirect measurement that reveals which error occurred without collapsing the logical qubit. Quantum threshold theorem — discrete X and Z error correction suffices to correct all quantum errors. Surface code — a topological quantum error-correcting code implemented on a 2D qubit grid. Options C and D list the obstacles but lack the linearity derivation of no-cloning and the threshold theorem explanation.

Option B is strongest. The variational principle is stated mathematically (⟨ψ(θ)|H|ψ(θ)⟩ ≥ E_ground) and interpreted correctly — minimising ⟨H⟩ drives towards the ground state, not past it. The classical intractability framing (Hilbert space grows as 2^N, ~50 electron limit) explains WHY quantum computers are needed. The hybrid loop is broken into four steps with the Pauli decomposition of the Hamiltonian explained (H = Σ c_i P_i) — this is the key step that makes the quantum-classical interface concrete. The parameter shift rule is given with the exact formula (shift by ±π/2, divide by 2) — this is the quantum analogue of numerical gradients and is a specific technical detail that differentiates senior candidates. The NISQ suitability section correctly identifies both the advantage (shallow circuits) and the limitation (barren plateaus — exponentially vanishing gradients). VQE vocabulary: Variational principle — any trial state has energy ≥ ground state energy. Ansatz — a parameterised quantum circuit that prepares the trial state. UCCSD — Unitary Coupled Cluster Singles and Doubles, a chemically motivated ansatz. Pauli decomposition — expressing the Hamiltonian as a sum of Pauli operator terms. Parameter shift rule — computing quantum circuit gradients analytically by evaluating the circuit at ±π/2 shifted parameters. Barren plateau — exponentially vanishing gradients in deep parameterised quantum circuits. Options C and D are accurate but lack the intractability motivation and the Pauli decomposition explanation.

Option B is strongest. The QAOA circuit structure section introduces QUBO/Ising Hamiltonian as the problem representation, which is the correct framing (not just "combinatorial problems"). The cost and mixer unitaries are defined mathematically with their exponential forms — the level of precision expected at a quantum computing company like IBM Quantum, IonQ, or Quantinuum. The theoretical guarantee (0.6924 approximation ratio at p=1, proven by Farhi et al.) is the specific result that differentiates QAOA from generic variational algorithms. The VQE comparison section is structured across four dimensions (domain / circuit structure / objective / NISQ performance), showing systematic thinking. The classical algorithm comparison is the most important honest assessment: Goemans-Williamson SDP achieves 0.878 for Max-Cut vs. QAOA's 0.693 at p=1 — quantum advantage has not been demonstrated, which is the correct scientific position. QAOA vocabulary: QUBO (Quadratic Unconstrained Binary Optimisation) — a problem class expressible as an Ising Hamiltonian and solvable by QAOA. Cost unitary U_C(γ) — the unitary that encodes the optimisation objective. Mixer unitary U_M(β) — the unitary that explores the solution space. Approximation ratio — the guaranteed fraction of optimal solution quality. Goemans-Williamson — a classical SDP algorithm achieving 0.878 Max-Cut approximation. Options C and D name the components correctly but lack the mathematical unitary definitions and the honest quantum-classical comparison.

Option B is strongest. The gate error section provides specific error rates (0.1-1% per two-qubit gate), names actual hardware vendors (IBM, Google, IonQ), and computes the cumulative fidelity degradation for 100 gates. The critical comparison — VQE/QAOA p=1 satisfies the < 100-200 gate limit while Shor's for RSA requires millions of gates — directly answers what is and is not possible on NISQ. The coherence time section introduces both T1 and T2 with definitions and specific superconducting qubit values (100-300 μs), then derives the maximum circuit depth calculation from first principles (T2 / gate_time). The connectivity section explains WHY SWAP gates increase circuit depth (3 CNOTs per SWAP) and names Qiskit's transpiler as the mitigation. The barren plateau section provides the quantitative gradient magnitude (< 2^(-50) for 50-qubit random circuits) — the correct mathematical expression of exponential vanishing. NISQ vocabulary: T1 (relaxation time) — time for excited qubit state to decay to ground state. T2 (dephasing time) — time for phase coherence to be lost. Barren plateau — exponentially small gradients in random parameterised quantum circuits. Readout error mitigation — post-processing measurement results using a calibration matrix. Transpilation — converting a quantum circuit to run on specific hardware connectivity with minimal overhead. Options C and D are accurate but lack the Shor's algorithm comparison and the barren plateau gradient quantification.