Pauli correlation encoding (PCE) encodes binary variables in the signs of -body Pauli correlators of qubits, and trains a parameterized circuit on a relaxed loss of sharpness . The strongest published schedules sharpen this loss aggressively and are benchmarked with exact expectation values, whereas a quantum computer estimates correlators from a finite number of shots. We show that the sharpness is a hidden shot budget. Since the expected sign of a correlator estimated from shots, , agrees with to within , the edge term of the relaxed loss at approximately equals, up to a constant, minus twice the cut expected from decoding shots. This explains why schedules tuned with exact expectation values lose their advantage at realistic budgets, and yields a shot-aware schedule whose final sharpness is set by the shot budget. On five G-set graphs with variables on qubits, this schedule outperforms every published schedule at its target budget in all paired comparisons of the decoded circuit output, owing to the sharpness at shots and mostly to switching off the regularization at ; after a classical bit-swap search, it remains the best on average at shots. Device noise damps the correlators by a factor , which amounts to a smaller shot budget . On the IBM Heron processor ibm_fez, an all-to-all ansatz of the type used for the best published G-set results compiles to CZ gates and decodes to a random cut, while our -CZ hardware-native circuit, trained in simulation and sharpened to , retains up to of the best-known cut. For new circuits, a damping and an offset calibrated on other circuits of the same graph predicted the decoded cuts at shots to within .

生成讲解博客的中文版本

生成AI智能校验的中文版本