Every question on one page: open one, choose an answer, and see why at once. Signed in, your latest answer to each question counts, and you can answer again after 24 hours.
Curated: · Written: · Reviewed:
Reviewed 100Review pending 0
Answers to reviewed questions count toward this role and the overall leaderboard; your latest answer to each one is the one that counts.
MCQ-1A team runs a 3-qubit circuit that applies an X gate to qubit 2 and nothing else. Framework A uses little-endian (qubit 0 is the least significant bit). The histogram shows the key '001' with probability 1.0. What does this indicate?⌄
MCQ-2A team prepares a qubit in H|0⟩ and measures 1000 shots in the Z basis, recording 498 zeros and 502 ones. A reviewer argues the device is simply emitting a classical random bit. To settle it, the team prepares a fresh qubit the same way, applies a second Hadamard, and measures 1000 shots in the Z basis. What should they expect, and why does it decide the question?⌄
MCQ-4A team must commit a shot budget before running a variational eigensolver whose final decision turns on whether a measured probability is 0.50 or 0.51. Which approach to the Born rule and shot noise is defensible?⌄
MCQ-11A two-qubit circuit prepares the Bell state (|00>+|11>)/√2, applies a Hadamard to qubit A, then measures A in the computational basis and reads outcome 1. What are the post-measurement state of qubit B and the probability of that outcome?⌄
MCQ-5A team submits a 'state duplicator' for review. The gadget is a single CNOT: the unknown input qubit is the control, a fresh |0> is the target. Validation prepares the control in |0> and in |1>, 1000 shots each, and the target's measured value equals the control's in 1000/1000 shots both times. The team reports 'duplication verified, fidelity 1.000' and asks to ship. What should the review conclude?⌄
MCQ-3A synthesis tool outputs a single-qubit block U' that is supposed to implement Z, but U' = -Z. A standalone test on |0> and |1> passes because the two differ only by a global phase. The block is then used as the controlled gate in a phase-kickback circuit: control in |+>, target in |1>, measure control in the X basis. The intended controlled-Z leaves the control in |->, but the synthesized block leaves it in |+>. Which action corrects the block for this circuit?⌄
MCQ-19A two-qubit circuit is built to demonstrate phase kickback on an ideal, noiseless device. q0 is prepared in |+⟩ by an H, q1 is prepared in |−⟩ by an X followed by an H, a CNOT is applied with q0 as control and q1 as target, an H is applied to q0, and both qubits are measured in the Z basis. Over 1000 shots, which joint-outcome counts should appear?⌄
MCQ-12A two-qubit VQE prepares the state |ψ> = (|01> + |10>)/√2. The Hamiltonian has a term 0.8·X0X1. The team measures both qubits in the computational basis, averages the product of the two ±1 outcomes, and reports the X0X1 contribution as -0.80. What is the correct contribution, and what is the error?⌄
MCQ-26A two-qubit device is prepared in a state the team reports as a Bell pair. Over 20,000 shots the ZZ parity ⟨ZZ⟩ = P(00)+P(11)−P(01)−P(10) is 0.97; over a separate 20,000 shots the XX parity ⟨XX⟩ is 0.03. What does this data establish?⌄
MCQ-8A two-qubit device is characterized after a Bell-state preparation. Measuring Z on each qubit separately gives outcome 0 with probability 0.50 on both qubits. Joint ZZ parity measurements return equal outcomes with probability 0.97, and joint XX parity measurements return equal outcomes with probability 0.88. What does this data establish about the prepared state?⌄
MCQ-9A two-qubit gate is under validation. Run A prepares the Bell state (|00⟩+|11⟩)/√2; run B prepares an equal-probability classical mixture of |00⟩ and |11⟩. Single-qubit tomography returns a Bloch vector within 0.02 of the origin for both qubits in both runs, and the dashboard flags both runs as "qubits maximally mixed: gate not entangling". The team is about to scrap the calibration. What should they do instead?⌄
MCQ-7A two-qubit register is prepared in the state √0.9 |00> + √0.1 |11>. An engineer traces out the second qubit to inspect the first, then stores that single-qubit state as a two-amplitude statevector to keep the simulation memory small. What does the reduced state's purity come out to, and what does it imply?⌄
MCQ-10A 4-qubit register is prepared in |ψ⟩ = (1/√3)(|0000⟩ + |0110⟩ + |1001⟩). A protocol requires the register to be entangled across the cut {qubits 0,1} vs {qubits 2,3}. A verification script instead computed the Schmidt rank across {qubit 0} vs {qubits 1,2,3}, obtained 2, and the team concluded the state is entangled. What is the Schmidt rank across the cut the protocol requires?⌄
MCQ-33A two-qubit run reports 96 percent agreement between the two outcomes over 10,000 shots, all taken in the Z basis, with the qubits 40 m apart and no classical channel open during the measurement window. The team's draft records the pair as entangled on the strength of that agreement. Which claim should the review accept?⌄
MCQ-34A team shares singlet pairs between two labs and tests whether Alice's basis choice leaks into Bob's local record. Alice randomly picks Z or X on each of 10,000 pairs; Bob always measures Z. When Alice chose Z (5,000 runs) Bob recorded 2,506 zeros; when she chose X (5,000 runs) he recorded 2,497 zeros. A junior engineer flags the 0.18-point gap as a possible signalling channel. What should the team report?⌄
MCQ-35A three-node network distributes three-qubit states. When one node's qubit is lost, the protocol proceeds only if the two survivors measure a CHSH value S above 2.2. One node's qubit is lost in 12% of rounds. The team is choosing between |GHZ> = (|000> + |111>)/√2 and |W> = (|001> + |010> + |100>)/√3. Which prediction about the surviving pair is correct?⌄
MCQ-24A two-node link teleports qubits from node A to node B. A heralded source produces one Bell pair every 10 µs, and pairs are buffered so entanglement is ready the instant a teleportation is requested; qubits are supplied to A faster than the link can carry them. The classical channel from A to B has a one-way latency of 40 ms, and the Bell-state measurement plus the receiver's correction together take 1 µs. The team streams qubits continuously. What steady-state latency (request to corrected qubit at B) and throughput should they expect?⌄
MCQ-25A team is evaluating superdense coding on a quantum link that carries 1 Mqubit/s. A dedicated entanglement source emits 1 Mqubit/s and yields one usable pair per 4 qubits, delivering 250k pairs/s to the sender on a separate channel. Each message consumes one pair and one encoded qubit sent over the link. Sending qubits directly already conveys 1 Mbit/s. What classical throughput should the scheme deliver?⌄
MCQ-27A team runs CHSH on a superconducting device with 8,192 trials per setting and measures S = 2.05. They want to claim a Bell violation in the paper. Which analysis is defensible?⌄
MCQ-28A CHSH Bell test on a maximally entangled photon pair attempts 61,600 trials and records 43,120 coincidence events. Post-selecting on coincidences gives S = 2.61; counting every attempted trial, with non-detections as outcomes, gives S = 1.94. The team must decide what to report. Which conclusion is defensible?⌄
MCQ-29A team claims genuine multipartite entanglement on a six-qubit device. They report a fidelity witness estimate F = 0.71 with a 95% confidence interval of [0.63, 0.79], measured in two settings that they chose after inspecting a preliminary run's counts. Full tomography on six qubits would need 3^6 = 729 settings. What should the review decide about the claim?⌄
MCQ-6A team must produce exact results, including the effect of depolarizing noise, for a 20-qubit circuit, on the only node available, which has 512 GB of RAM. Which plan should they run?⌄
MCQ-36A team runs a 4-qubit Deutsch-Jozsa circuit (16 inputs) on a predicate they assume is balanced. The predicate is actually 0 on 12 of the 16 inputs and 1 on the other 4. Over 1000 shots, the all-zeros outcome appears 250 times. Which conclusion does this measurement support?⌄
MCQ-37A team runs Grover's algorithm on a search space of N = 2^20 with exactly one marked item. Each iteration rotates the marked-state amplitude by 2θ, where θ = arcsin(√(M/N)). They schedule 1,608 iterations and measure the marked item in 0 of 8,192 shots. Which conclusion does the evidence support?⌄
MCQ-13A 4-qubit Grover search looks for the single 4-bit string with x0=x1=x2=1. The oracle is a single Toffoli with controls x0,x1,x2 and target a fifth ancilla initialized to |0>; the circuit does not uncompute the ancilla. After 2 iterations the measured distribution over the 16 search outcomes is nearly uniform, with the marked outcome at 7%. A correct phase oracle would put about 91% on the marked outcome after 2 iterations. Which change to the oracle makes the next run produce that ~91% peak?⌄
MCQ-23A 3-qubit Grover search runs two iterations to mark one of eight states; the ideal marked-state probability is about 0.94. The oracle allocates two ancilla qubits, computes a predicate into them, and applies the phase kickback, but returns them to |00⟩ only on the basis states used in its unit tests. On hardware the marked state comes back with probability 0.13 over 8,192 shots, and the team blames device noise. The identical circuit on a noiseless statevector simulator also returns 0.13. Which conclusion is correct?⌄
MCQ-38A 20-qubit Grover search runs over N = 1,048,576 items. The team hardcodes k = 804 iterations because 804 = floor((pi/4)*sqrt(N)) assumes exactly one marked item (M = 1). On validation instances later found to contain M = 4 marked items, the measured success frequency is about 1 in 1,000,000 over 10^6 shots; the team attributes this to device noise. Production instances have unknown M, including possible M = 0. Which action correctly handles the unknown-M regime?⌄
MCQ-41A team runs Grover's algorithm on a 20-qubit register (N = 2^20 = 1,048,576) holding exactly one marked item, using 804 iterations: the optimal count for this N. Over 1,000 shots, 997 return the same bitstring x and 3 return scattered bitstrings. The predicate has been validated on all 2^20 inputs, returns true for exactly one of them, and returns false on x. What does this most likely indicate?⌄
MCQ-39A team benchmarks Grover's search on a 20-qubit instance (N = 2^20) and writes up the run as '804 oracle queries, so the search is cheap'. Their transpiled circuit costs about 432 two-qubit gates per iteration: the oracle for the real predicate plus the diffuser, whose multi-controlled phase alone is about 216 CNOTs, and the target device has a 0.5% two-qubit gate error rate. An ideal state-vector simulation returns the marked item with probability 1. Which assessment of the run is correct?⌄
MCQ-40A sampling routine prepares a state with a 1,000-gate preparation circuit and post-selects on a success flag that fires with probability p = 0.01. A teammate proposes replacing post-selection with amplitude amplification, which needs about 1/√p rounds; profiling one round (preparation, reflection, inverse preparation, reflection) gives 2,000 gates. The teammate reports the speedup as 1/p = 100×. What gate-count advantage does the amplification actually give over classical repetition?⌄
MCQ-42An engineer proposes replacing the classical FFT in a 2^20-sample spectral analysis with a 20-qubit QFT circuit, noting the QFT needs about 210 gates while the FFT needs about 2×10^7 operations. The pipeline's next step reads all 2^20 output amplitudes to locate the dominant frequency. What is the correct assessment?⌄
MCQ-43A team runs quantum phase estimation with 16 precision qubits to resolve a phase to 12 bits of accuracy. Each controlled application of the unitary takes 1.5 µs on the device, whose coherence budget is 20 ms. The run returns no usable phase. Which diagnosis fits?⌄
MCQ-44A team runs Shor's order-finding circuit for N=21 with base a=4. The phase measurement yields r=3. They have shots left and must decide the next step. Which action is correct?⌄
MCQ-45A team runs Shor's order-finding on N = 15 with a = 7 and collects eight shots. The measured phases are 0.25, 0.75, 0.50, 0.25, 0.75, 0.50, 0.25, 0.75. They expand each phase as a continued fraction and test the resulting denominator r by checking a^r mod N = 1. Which reading of the run is correct?⌄
MCQ-46A group reports factoring N = 143 on a 7-qubit device. The transpiled circuit uses 1,100 two-qubit gates, and the paper states the modular exponentiation was compiled from the known factors 11 and 13. A roadmap slide cites this run as evidence that a 2048-bit RSA modulus will fall once devices reach a few hundred qubits. What does the run support?⌄
MCQ-47A team's quantum-risk draft states: 'RSA-2048 falls by 2035; the requirement is 20 million physical qubits for 8 hours.' The cited source is the Gidney–Ekerå estimate, which assumes a 0.1% physical error rate and a specific surface-code cycle time and magic-state factory. The team's roadmap reaches 2 million physical qubits at a 0.01% physical error rate by 2035. A reviewer asks whether the roadmap meets the requirement. Which assessment is correct?⌄
MCQ-48A working group compiles a Grover oracle for AES-128 key search: each iteration costs 2^20 Toffoli-equivalent gates, and their fault-tolerant device sustains 10^6 gates per second. Grover needs about 2^64 iterations. Which conclusion should drive the migration plan?⌄
MCQ-14A 24-qubit circuit contains 1,200 arbitrary single-qubit rotations, compiled to a Clifford+T set at the compiler's default synthesis tolerance of 1e-3 per rotation. Its measured expectation value differs from the ideal simulation by 8%, yet every gate passes individual benchmarking. The team's total synthesis error budget is 1e-2. What does the deviation indicate, and what should they do?⌄
MCQ-15A team is choosing between two implementations of the same algorithm for a fixed superconducting target with line connectivity. The designs use the same qubit count and have comparable depth and total duration; they differ mainly in how many long-range interactions they demand. On this device the median two-qubit error is 0.7%, an order of magnitude above single-qubit and readout error, and the shot budget is fixed. Which justification for treating two-qubit gate count as the cost metric is sound?⌄
MCQ-16A 5-qubit circuit with 12 CNOTs and depth 18 is transpiled onto a device whose coupling graph is a line. The default layout compiles it to 39 CNOTs at depth 46; a layout chosen from the algorithm's interaction graph compiles it to 18 CNOTs at depth 24. Two-qubit gate error is 0.8% and single-qubit error is negligible. The device is fixed for the rerun. Which change addresses the cause of the 21-CNOT gap?⌄
MCQ-17A 30-qubit QAOA circuit is transpiled for a superconducting device. The transpiled circuit contains 1,100 two-qubit gates and the transpiler reports a scheduled duration of 240 µs. The device calibration record lists T1 = 150 µs and T2 = 90 µs (median across qubits). The measured bitstring distribution is nearly uniform, while a statevector simulation of the same circuit is clean. Which conclusion is best supported?⌄
MCQ-18A 20-qubit circuit is scheduled on a transmon device. The schedule reports 2.8 µs total and contains 40 two-qubit gates at 60 ns each, 20 sx gates at 20 ns each, and 60 rz instructions. A teammate says the 60 rz instructions account for 1.2 µs of the 2.8 µs and proposes a rewrite that removes them. What is the correct response?⌄
MCQ-22A detection circuit on a 27-qubit device uses one ancilla 12 times per shot and needs a clean-run probability of at least 0.8. The vendor specifies reset at 2% residual excitation and 1.2 µs. Idle qubits sit at the edge of the data block; bringing one into the ancilla slot costs a 3-SWAP chain at 0.5% error and 300 ns per SWAP. Which policy meets the requirement?⌄
MCQ-20A 5-qubit repetition-code round runs on a superconducting device with T2 = 90 µs and native mid-circuit measurement whose classical feedforward takes 300 ns. The dynamic form: measure the four stabilizers, apply a conditional X to the data qubit, then measure it: compiles to 30 µs. The deferred form, a coherently controlled X on four ancillas with every measurement at the end, compiles to 140 µs and needs four extra qubits. Which choice is defensible for this run?⌄
MCQ-21A 16-qubit dynamic circuit, mid-circuit measurement followed by a conditional X, runs on a backend that supports mid-circuit measurement and conditional gates. The backend's median T2 is 40 µs and its measured feed-forward latency, from measurement result to conditional gate, is 30 µs. An ideal simulator that treats feed-forward as instantaneous reports 0.94 protocol fidelity; the hardware run reports 0.61. Which conclusion should the review accept?⌄
MCQ-31A team characterizes a two-qubit CZ gate on the same qubit pair in the same calibration window. Process tomography against the ideal CZ gives a process fidelity of 97.5%. Interleaved randomized benchmarking gives an average gate fidelity of 98.0%. A reviewer flags the 0.5-point gap as an inconsistency and asks which figure to report. Which response is correct?⌄
MCQ-32A device passes randomized benchmarking at 99.8% average gate fidelity, yet a circuit that repeats one two-qubit gate 50 times accumulates 0.35 rad of phase error: far more than the benchmark's per-Clifford error predicts. The postmortem blames randomized benchmarking's blind spot. Which change addresses it?⌄
MCQ-54A transmon's single-qubit gate is benchmarked two ways. Randomized benchmarking reports 0.02% error per gate. Applying the same gate N times in a row and measuring the final state gives 0.25% infidelity at N=10, 1.0% at N=20, and 4.0% at N=40. Which conclusion does the data support?⌄
MCQ-55A 27-qubit transmon device runs a 30-layer circuit; each layer applies four CZ gates simultaneously on four adjacent qubit pairs. Isolated randomized benchmarking on each pair reports 0.6% error per CZ, so the team budgets 4 × 0.6% = 2.4% per layer and predicts about 48% success for the full circuit. On hardware the circuit succeeds 16% of the time. Which conclusion is correct?⌄
MCQ-58A 20-qubit circuit runs in 40 µs. The scheduler reports each qubit is idle for 2 µs total, in 12 windows of 170 ns each. On this device, idle dephasing costs 0.5% fidelity per µs of idle time, and each single-qubit pulse adds 0.04% error. An XY4 block is four 25 ns pulses with three 20 ns gaps, 160 ns total, and suppresses low-frequency dephasing by 90%. The team inserts XY4 into all 12 idle windows. What is the expected fidelity change per qubit?⌄
MCQ-57A 20-CX-gate circuit is transpiled on Monday against a 27-qubit backend; the chosen layout routes 10 of the 20 CX gates onto the pair (q4,q5), whose CX error is 0.5% in Monday's calibration. On Thursday the same compiled QASM is submitted unchanged with 4096 shots, and the success rate falls from 0.78 to 0.55. Thursday's calibration reports (q4,q5) CX error at 4.0%. Which explanation fits the data?⌄
MCQ-56A distance-5 surface-code memory on a superconducting device holds its logical error rate at 1.1% per cycle whether it runs 10 rounds or 50. Readout after each cycle finds 3% of the data qubits outside |0> and |1>, and that population decays only over about 20 rounds. The decoder uses a depolarizing Pauli noise model. Which change addresses the cause of the stalled logical error rate?⌄
MCQ-61A distance-3 surface code runs three syndrome-extraction rounds per logical operation. In the space-time matching graph, one X-type stabilizer's outcomes across rounds 1, 2, 3 are 0, 1, 1. How should the decoder interpret this time series?⌄
MCQ-62A team is sizing a fault-tolerant machine built on rotated surface codes. Their physical error rate is 10⁻³, below threshold, and they have measured that raising the code distance by 2 divides the logical error rate per round by 10. At distance 5 the logical error rate per round is 10⁻⁴. The algorithm needs a logical error rate of 10⁻⁹ per logical operation, and each logical operation spans 10 rounds of error correction, so its error rate is roughly 10 times the per-round rate. A rotated surface code of distance d uses 2d² − 1 physical qubits. What distance and physical-qubit count per logical qubit should the plan specify?⌄
MCQ-63A team runs a surface-code memory on a device with 0.1% two-qubit gate error and 1% readout error, with a shared readout line coupling neighbouring qubits. They cite a 1% threshold from a paper that assumes independent depolarizing noise and declare the device below threshold. Their measured logical error per round is 0.9% at distance 3 and 1.2% at distance 5. Which conclusion does the data support?⌄
MCQ-64A distance-7 surface-code memory runs 10,000 syndrome rounds at a 1.0 µs round period. The decoder's mean latency is 0.8 µs, but its 99th percentile is 6 µs, and the control hardware blocks until the decoder returns before starting the next round. The measured logical error rate is higher than the value predicted from the decoder's offline per-shot accuracy. What explains the gap?⌄
MCQ-65A team runs a distance-3 surface-code logical memory on a superconducting chip: 25 cycles of idling, no logical gates. They measure a logical error rate of 0.5% per cycle and announce break-even, citing the chip's median physical qubit error of 0.9% per cycle. The best physical qubit on the same chip has 0.28% error per cycle. Which statement about the announcement is correct?⌄
MCQ-59A team runs a 12-qubit VQE on hardware. The unmitigated run at folding factor 1 uses 100,000 shots and returns an energy with a standard error of 0.002 Ha. They add zero-noise extrapolation with a linear fit to folding factors 1 and 3, giving each level its own 100,000 shots. What standard error should they quote for the extrapolated estimate?⌄
MCQ-60A team must estimate an observable on a 50-qubit circuit to 1% statistical precision, which needs about 10^4 effective shots. The transpiled circuit has 5,000 two-qubit gates, each with a two-qubit gate error of 0.1%. They plan probabilistic error cancellation (PEC), whose sampling overhead is γ² with γ = e^(2εN) (the small-error approximation), where ε is the per-gate error rate and N the two-qubit gate count. Their shot budget is 10^8. Which conclusion does the budget support?⌄
MCQ-66A surface-code estimate for a fault-tolerant chemistry run reports 1.6×10^6 physical qubits and a runtime of about 30 minutes, with code distance d=20 and a 1 μs round time. The circuit has 10^10 T gates at T depth 10^8 and 10^12 Clifford gates at Clifford depth 10^6; 1.33×10^6 of the physical qubits sit in magic state distillation factories. A transpiler pass removes 40% of the Clifford gates, leaving the T count and T depth unchanged, and the re-estimate reports the same 1.6×10^6 qubits and 30 minutes. Which explanation fits?⌄
MCQ-53A 40-qubit QAOA circuit has 180 sequential two-qubit layers on its critical path, each layer one two-qubit gate deep. The device's two-qubit gate duration is 300 ns. The team budgeted the run against the chip's median T2 of 70 microseconds, but the transpiler's chosen layout lands on qubits whose T2 is 45 microseconds. What should the review conclude?⌄
MCQ-87A team is choosing between two 20-qubit devices for a variational eigensolver whose entangling pairs are mostly between distant qubits. Device A is fully connected with a median two-qubit error of 0.8%; Device B is a degree-three lattice with a median two-qubit error of 0.5%. Which comparison should the team make?⌄
MCQ-86A team must run 1,000 shots of a 40-qubit chemistry circuit on one of two backends. On the superconducting backend, limited connectivity forces the transpiled circuit to 3,000 two-qubit gates, each taking 200 ns at 99.5% fidelity. On the trapped-ion backend, all-to-all connectivity gives 500 two-qubit gates, each taking 200 µs at 99.9% fidelity. Single-qubit gates and readout are negligible. Which backend should they use?⌄
MCQ-77A team exports a 6-qubit circuit to OpenQASM 2 with `qiskit.qasm2.dumps` and re-imports it with `qiskit.qasm2.loads`. The circuit contains 214 standard gates, 6 instances of a custom gate `my_gate` that the exporter writes as a `gate` declaration with a body, and `qc.global_phase = π/4`. Running both circuits on a noiseless simulator for 8192 shots returns identical counts, but the two unitaries are not equal. What should the review conclude?⌄
MCQ-78A 4-qubit circuit declares two 1-bit classical registers, `flag` and `parity`. It measures q0 into `flag[0]`, q1 into `parity[0]`, then applies `if (parity[0] == 1) X q2`. The team exports the circuit to a serialization format that carries a single classical register, re-imports it, and runs 1000 shots with q0 prepared in |1> and q1 in |+>. The re-imported circuit flips q2 in all 1000 shots. Which diagnosis and fix is correct?⌄
MCQ-79A 30-qubit variational circuit applies 10,000 parameterized RZ gates. A serializer writes each angle to disk with six decimal places, truncating toward zero; all angles are positive. The measured observable depends on the total accumulated phase φ = Σθᵢ, and at the operating point |∂⟨O⟩/∂φ| = 1. What is the worst-case error in φ, in radians, introduced by serialization alone?⌄
MCQ-76A team runs the same 4-qubit circuit and the same observable ⟨Z0Z1⟩ twice on the same 127-qubit backend, using `qiskit_ibm_runtime.EstimatorV2` both times with `default_shots=16384`. Run A sets `resilience_level=0` and returns -0.640 ± 0.008. Run B leaves `resilience_level` at its default and returns -0.672 ± 0.008. A teammate reports a 0.032 device drift between the runs. Which conclusion is supported?⌄
MCQ-82A team's CI runs every test on an ideal statevector simulator with 1,024 shots and a 1e-2 tolerance on expectation values. A readout-error-mitigation routine builds a calibration matrix and divides the measured counts by it, but the qubit indices are swapped when the matrix is assembled. The suite has been green for six weeks; the error surfaces only in the weekly hardware run, where corrected expectation values are off by about 0.15. Which change to the CI tiers catches this defect before merge?⌄
MCQ-83A QAOA test asserts that the count of the all-zeros bitstring over 4,096 shots is within ±20 of the ideal 1,024 (probability 0.25). Clean runs fail about half the time, so the team widens the window to ±200 counts. A gate-angle bug that drops the probability to 0.21 must still be caught, and the team will accept at most a 1% false-failure rate on clean runs. Which assertion should replace the current one?⌄
MCQ-85A team re-runs an archived VQE job on the same simulator and the same SDK versions. The archive holds the shot seed, the transpiler seed, the optimizer's initial parameter vector, and the versions; the transpile call uses the same optimization level and the same backend target. On re-run, the transpiled circuit has 412 two-qubit gates instead of the archived 388, and the first evaluation's counts differ, while the parameter vector at that evaluation is identical to the archived one. What is the cause?⌄
MCQ-84A team runs a 20-qubit QAOA circuit on a provider's 27-qubit device, pinning the framework and provider SDK versions in requirements.txt. They archive the source file and the returned counts. The run reports 96 CNOTs in the transpiled circuit and a success probability of 0.71. Six weeks later, the same source with the same pinned versions reports 117 CNOTs and 0.58. The provider's calibration log shows unchanged connectivity and a median two-qubit error of 0.4% on both dates. Which diagnosis fits the evidence?⌄
MCQ-81A team submits a nightly batch of 200 circuits to the same 127-qubit backend, reusing a target snapshot cached three weeks earlier so the transpile step stays fast. Last night the provider rejected 40 jobs with "instruction not supported" after 25 minutes in the queue; the other 160 ran. Which change should the team make?⌄
MCQ-80A nightly pipeline submits 4,000 tasks to a provider that bills per accepted task and returns the task id only in the HTTP response body. The client retries any submission whose response has not arrived within 10 s, up to three attempts, and sends no idempotency key. Last night the provider accepted 800 submissions whose responses were then lost to a 10 s gateway timeout; each was retried, and 200 of those retries were again accepted with the response lost and retried once more. How many tasks did the provider bill for the run?⌄
MCQ-93A review packet claims one experiment: '256 atoms, a 40-layer QAOA circuit transpiled to two-qubit gates, 100× faster than the best classical simulation.' The vendor spec for the machine lists analog Hamiltonian evolution on up to 256 atoms and digital gate operations on registers of up to 20 atoms, with no gate-mode path to the full array. Which conclusion should the review reach?⌄
MCQ-90A team must run a 24-qubit circuit with 400 two-qubit gates and 12 mid-circuit measurements whose outcomes steer later gates. Their gate-model device has 27 qubits and a long queue; a vendor offers time on a 5,000-qubit annealer. The team proposes moving the workload to the annealer to skip the queue. Which assessment is correct?⌄
MCQ-91A team wants to run a dense 100-variable QUBO on an annealer with 5,000 physical qubits. Their embedder returns chains with mean length 30 and maximum length 70. Which conclusion is correct?⌄
MCQ-92You run a 120-variable weighted Max-Cut on a quantum annealer. The embedding uses chains of 6 physical qubits per logical variable. With chain strength 0.5, 34% of the 1000 samples have at least one broken chain; after majority-vote repair the best objective is 1180. With chain strength 2.0, 3% of samples break and the best objective is 1140. What should you conclude?⌄
MCQ-94A 300-iteration variational loop runs on a shared superconducting device. Each iteration's transpiled circuit executes in 72 s on the device. Submitted one job per iteration, each job waits 40 min in the queue before it runs. The provider also offers a session mode: one queue wait of 30 min for the whole loop, then the same 72 s of execution per iteration. Which wall-clock accounting is right?⌄
MCQ-96A team runs a 500-iteration variational loop. Each circuit executes in 30 µs on the QPU; the classical optimizer runs as a service on a remote host, and the measured per-iteration round trip is 180 ms. The run takes 90 s. Mid-circuit feedback runs on the control FPGA and meets its 500 ns deadline, and each iteration's parameters depend on the previous iteration's measurement outcome. Which change addresses the dominant cost?⌄
MCQ-95A VQE loop runs 200 iterations on a 12-qubit device. Each iteration submits a gradient evaluation to a pool of 8 workers; one evaluation takes about 90 s wall clock, and the run must finish inside a 2-hour maintenance window. Under load, 12% of evaluations return only after the optimizer has already applied the next parameter update. The energy trace spikes roughly every 8 iterations, tracking worker queue depth, and the run ends 0.9 Ha above the converged value. Which change fixes the divergence?⌄
MCQ-97A team benchmarks a quantum classifier on 256 classical features. They amplitude-encode the features into 8 qubits and report a 40× speedup over their classical baseline, timing only the 8-qubit model circuit, which has depth 60. Compiling the state preparation for their unstructured data produces a circuit of depth 12,000. Which conclusion is correct?⌄
MCQ-67A team runs VQE on an 8-qubit superconducting device for a molecule whose exact ground-state energy is −1.137 Ha from classical diagonalization. Each energy evaluation measures six Pauli groups with 2,000 shots each, giving a per-evaluation standard error of about 0.05 Ha. After 300 optimizer iterations the best hardware energy is −1.097 Ha, and five independent repeats finish within 0.05 Ha of one another. What does the run support?⌄
MCQ-68A 24-qubit variational eigensolver is trained on a molecular Hamiltonian. At random initialization the 12-layer hardware-efficient ansatz gives gradient variance 1.5e-8 at 24 qubits and 6e-5 at 12 qubits; a symmetry-preserving ansatz built from the Hamiltonian's particle-number and spin sectors gives 1.5e-2 at 24 qubits. After 400 optimizer steps the hardware-efficient run's energy moved by less than the shot noise of a single evaluation. The team has one week of device time left. Which reading of these numbers is defensible?⌄
MCQ-69A team's change request reports that a 20-qubit variational ansatz with a global cost observable plateaus after a few iterations. They measured gradient variance at random initialization: 1e-2 at 8 qubits, 1e-6 at 20 qubits. The request proposes replacing Adam with SPSA and raising the shot budget from 10^4 to 10^6 per gradient component. Which statement should the review accept?⌄
MCQ-70A team runs VQE on a 12-qubit molecular Hamiltonian whose Pauli coefficients sum in absolute value to 20 hartree. They need each energy estimate to 1.6 millihartree (chemical accuracy) and plan to measure every Pauli term separately with 8,192 shots per energy evaluation. What does that shot budget actually deliver?⌄
MCQ-71A team runs a variational eigensolver on a superconducting device. The ansatz has 100 parameters, and each circuit evaluation, one parameter setting at the full shot budget, occupies 6 seconds of device time. The team has a 1-hour device allocation per day and computes gradients with the parameter-shift rule. Ignoring optimizer and compilation overhead, how many complete gradient steps can they take per day?⌄
MCQ-72A VQE run on a three-group Hamiltonian has a fixed budget of 9,000 shots. Group A has Hamiltonian coefficient c_A = 1.0 and per-shot standard deviation σ_A = 0.10 hartree; groups B and C each have c = 0.5 and σ = 0.02 hartree. The previous run split the budget evenly and reported a total energy uncertainty of 1.84 mHa, above the 1.6 mHa chemical-accuracy target. Which shot allocation should the next run use?⌄
MCQ-73A team runs QAOA at p=3 on a 12-qubit portfolio problem with a cardinality constraint (exactly 4 of 12 assets held), folded into the cost Hamiltonian as a penalty term with coefficient λ=2. From 4,096 shots on the device, the approximation ratio over all shots is 0.88; 1,680 shots violate the cardinality constraint, and over the 2,416 feasible shots the ratio is 0.62. Which conclusion about this run is correct?⌄
MCQ-74A team runs QAOA at depth 3 on 20-node Max-Cut instances and reports an approximation ratio of 0.71 from 6 hours of device and queue time. Their classical comparison is a random assignment (0.50) and a greedy heuristic given 1 second (0.62). A tuned tabu search reaches 0.93 on the same instances in 0.8 s. The team claims the 0.71 demonstrates a quantum advantage. What is the warranted conclusion?⌄
MCQ-75A team preregisters a QAOA benchmark before running on hardware. The protocol fixes 40 random 20-node MaxCut instances, depth p=3, success threshold 0.90, baseline = best of 100 Goemans-Williamson runs, stopping rule = 300 COBYLA iterations, and the reported metric = mean approximation ratio over all 40 preregistered instances. On the device, 14 instances reach 0.90 with mean 0.93; the mean over all 40 is 0.71; the median over all 40 is 0.68; the best instance is 0.97. Which headline number follows the preregistered protocol?⌄
MCQ-98A team is training a kernel SVM with a fidelity quantum kernel on 2,000 training samples. Each entry of the Gram matrix is estimated from 1,000 shots on a device that sustains 5,000 shots per second, and they have booked a 24-hour device window. Roughly how much device time does building the full Gram matrix require?⌄
MCQ-99You estimate a quantum kernel matrix K for a 100-point training set with 4096 shots per pair. After symmetrizing, K has exactly one negative eigenvalue, λ_min = −0.15; all other eigenvalues are positive. Your SVM's QP solver requires a PSD matrix, and you want the PSD matrix closest to K in Frobenius norm. Which repair do you apply?⌄
MCQ-100The team must decide what to claim before committing the device shot budget. A hybrid pipeline: classical scaling, an 8-qubit ZZ feature map, a fidelity quantum kernel estimated at 1024 shots, and an SVM: reaches 0.86 held-out accuracy on 400 samples, against 0.79 for an RBF SVM on the same preprocessed inputs. Three controls run on the same splits: the quantum kernel replaced by a random feature map of the same 256 dimensions (0.85), the RBF SVM retuned over the same grid budget (0.87), and the quantum kernel at 4096 shots (0.862). Over five seeds the quantum-kernel and random-feature-map scores differ by 0.004 ± 0.011. Which claim do the controls support?⌄
MCQ-88A 20-qubit workload runs on a 65-qubit device, where it transpiles to 84 CNOTs and returns the correct bitstring with probability 0.58. On a new 127-qubit device the same workload transpiles to 131 CNOTs and returns it with probability 0.48. Both devices report a 0.4% median two-qubit gate error and 1% readout error per qubit. The vendor's launch post calls the 127-qubit device the capability upgrade. Which conclusion do the numbers support?⌄
MCQ-89A team must choose one of two 27-qubit devices for a variational workload that needs 200,000 executions. The datasheets give Device A quantum volume 128 and 900 CLOPS, Device B quantum volume 32 and 3,600 CLOPS. Both vendors' QV submissions were compiled with a pass that specializes the benchmark circuit to their own native gates and connectivity. The team's circuit transpiles to 90 two-qubit gates on A and 60 on B. Which conclusion does the data support?⌄
MCQ-30A team must certify a 10-qubit register against a known target state inside one 2-hour device window. The device sustains 4,000 shots/s, and their tomography pipeline takes 2,000 shots per measurement setting. Which plan fits the window and still certifies the state?⌄
MCQ-49A research institute has one year of post-quantum migration budget and must choose which systems to move to quantum-resistant key establishment first. Its estate holds TLS session keys that matter for minutes, an internal VPN carrying genomic records under a 25-year confidentiality requirement, and public-facing certificates used for authentication. No cryptographically relevant quantum computer is expected within a decade. Which sequencing should the review adopt?⌄
MCQ-50A payments processor must keep transaction records confidential for 20 years. Its migration plan finishes TLS and internal-CA re-issuance in 18 months, but the HSM firmware signing chain and 40,000 field terminals on a 7-year replacement cycle dominate the schedule. Credible estimates put a cryptographically relevant quantum computer 12 to 20 years out. Which conclusion does the arithmetic support?⌄
MCQ-51A service terminates TLS 1.3 for 40,000 field-deployed devices. Each device allocates a fixed 4 KB buffer for the server's certificate message and cannot be updated in the field. The server's current ECDSA P-256 certificate is 1.2 KB. The team reissues it as a single ML-DSA-65 certificate signed by an ML-DSA-65 CA. What happens on the next handshake?⌄
MCQ-52A TLS 1.3 terminator now offers the hybrid group X25519MLKEM768 and keeps X25519 in its supported list, so the team can roll back to classical-only if the post-quantum component is later found broken. About 4% of connections still come from clients that only offer X25519, and those must keep working. A red-team exercise shows an on-path attacker can delete the hybrid group from the ClientHello; the handshake then completes on X25519 with no error on either side. The threat model includes an adversary recording traffic today to decrypt it once a quantum computer exists. Which change closes the gap?⌄