Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 63 1 d Solution Created 2026-10-03 Updated 2026-10-06
For a normalized computational history state, the output projector sees only its final clock component. With the quantum circuit's acceptance probability,This proves the hint, including for a computational basis quantum witness. Moreover is a stoquastic Hamiltonian term, so adding it with positive coefficient preserves stoquasticity.
There are two substantive problems with the stated promise. First, for any basis quantum witness the initialized state has nonnegative amplitudes, and every permutation matrix preserves them. Write the output as , with both vectors entrywise nonnegative. ThenThe stoquastic acceptance floor rules out the printed one-third soundness condition. There are no NO instances of that literal promise. Second, the ground space includes histories of arbitrary quantum witnesses. It is the maximum over those quantum witnesses, not the maximum over basis quantum witnesses, that determines the lowest output energy. Even the identity quantum circuit accepts each basis input with probability , but accepts a quantum witness with probability one. Thus a basis-witness soundness bound would not control this Hamiltonian, even if its numerical threshold were repaired.
The requested nontrivial hardness statement therefore needs the standard quantum-witness StoqMA promise, with and inverse-polynomial gap . The intended reduction can be completed precisely under that corrected promise. Define the quantum witness embedding and the witness acceptance operatorIt is a positive contraction, and . The minimum expectation of on the history ground space is . This is also consistent with a nonnegative optimal StoqMA quantum witness: is entrywise nonnegative, so replacing amplitudes by their absolute values cannot decrease its quadratic form.
A uniform ground-space perturbation bound is needed because the gap shrinks with quantum circuit length. Put , and choose a positive inverse-polynomial coefficientFor the history ground projector and any unit vector with , the operator norm bound givesThe last inequality completes the square in and uses . Testing a ground space minimizing vector gives the upper bound . Since , we obtainYES instances of the corrected promise have energy at most ; NO instances have energy at leastThe separation is at least , an inverse polynomial. The quantum circuit and all these Hamiltonian terms have polynomial-size descriptions. This proves StoqMA hardness for the local Hamiltonian problem variant that permits the nonlocal clock, under the corrected quantum witness and acceptance promise.
The printed perturbation formula also has where a general perturbation belongs. Its unspecified cannot be treated as uniform in a closing gap. Likewise a circuit-length-independent constant cannot in general satisfy the stated small-perturbation requirement for an arbitrary long quantum circuit. The explicit bound above avoids both issues; it does not claim the defective literal promise defines standard StoqMA.