Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice
BOUSSAHI ACHRAF

BOUSSAHI ACHRAF

Joined February 26, 2026

Karma 0

Overview
Last submissions
Datasets
Workspaces
Papers
Last comments
Last topics
Organizations

Shot- and Noise-Aware Pauli Correlation Encoding for Max-Cut Experiments on IBM Heron Quantum Processor

Achraf Boussahi

Pauli correlation encoding (PCE) encodes $m$ binary variables in the signs of $k$-body Pauli correlators of $n=O(m^{1/k})$ 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 $S$ shots, $\mathrm{erf}(c\sqrt{S/2})$, agrees with $\tanh(0.851\sqrt{S}\,c)$ to within $0.019$, the edge term of the relaxed loss at $α=0.851\sqrt{S}$ approximately equals, up to a constant, minus twice the cut expected from decoding $S$ 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 $800$ variables on $13$ qubits, this schedule outperforms every published schedule at its target budget in all $150$ paired comparisons of the decoded circuit output, owing to the sharpness at $1.6\times10^4$ shots and mostly to switching off the regularization at $10^3$; after a classical bit-swap search, it remains the best on average at $1.6\times10^4$ shots. Device noise damps the correlators by a factor $s$, which amounts to a smaller shot budget $s^2S$. 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 $835$ CZ gates and decodes to a random cut, while our $96$-CZ hardware-native circuit, trained in simulation and sharpened to $α\simeq0.65\,s\sqrt{S}$, retains up to $0.919$ 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 $10^3$ shots to within $0.002$.

quant-pharXiv:2610.19544•Oct 15, 2026•0 citations
Pauli correlation encoding (PCE) encodes mmm binary variables in the signs of kkk-body Pauli correlators of n=O(m1/k)n=O(m^{1/k})n=O(m1/k) 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 SSS shots, erf(cS/2)\mathrm{erf}(c\sqrt{S/2})erf(cS/2​), agrees with tanh⁡(0.851S c)\tanh(0.851\sqrt{S}\,c)tanh(0.851S​c) to within 0.0190.0190.019, the edge term of the relaxed loss at α=0.851Sα=0.851\sqrt{S}α=0.851S​ approximately equals, up to a constant, minus twice the cut expected from decoding SSS 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 800800800 variables on 131313 qubits, this schedule outperforms every published schedule at its target budget in all 150150150 paired comparisons of the decoded circuit output, owing to the sharpness at 1.6×1041.6\times10^41.6×104 shots and mostly to switching off the regularization at 10310^3103; after a classical bit-swap search, it remains the best on average at 1.6×1041.6\times10^41.6×104 shots. Device noise damps the correlators by a factor sss, which amounts to a smaller shot budget s2Ss^2Ss2S. 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 835835835 CZ gates and decodes to a random cut, while our 969696-CZ hardware-native circuit, trained in simulation and sharpened to α≃0.65 sSα\simeq0.65\,s\sqrt{S}α≃0.65sS​, retains up to 0.9190.9190.919 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 10310^3103 shots to within 0.0020.0020.002.