What is the STP cost of preparing a Quantum Max-Cut witness?
Compare verification by a weighted random-edge singlet test with STP preparation of a state whose Quantum Max-Cut objective is near optimal.
Discuss this questionFor nonnegative rational edge weights , let and A verifier receives one -qubit witness, draws edge with probability , and accepts its singlet outcome; its acceptance is . With thresholds separated by , distinguish from . Ask for the cost of preparing a near-optimal witness by STP, and compare the spin structure needed for preparation with what this verifier accesses.
One randomized edge test defines an acceptance probability; estimating that probability empirically needs independent repetitions. A single unknown witness cannot be treated as arbitrarily many independent copies. The verification task and a state-generation task have different input/output requirements.
Why this is interesting
The verifier accesses a weighted singlet expectation through local tests. The preparation problem asks how to achieve a near-optimal expectation across the interaction graph.
A place to start
Choose a small frustrated graph and compare an STP preparation protocol with randomized edge verification, including sampling error and back-action.
Related work
These works provide context and established results. They need not be the origin of this exact formulation.
Discuss this question
Reading is public. Posting requires a GitHub account. You can also write to Kunal.