Skip to content
Preprint

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

Oct 2026 · 0 citations · 55 references
Physics

TL;DR

It is shown that the sharpness is a hidden shot budget, which 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.

Abstract

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 $\alpha$. 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 $\alpha=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 $\alpha\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$.

View source

Similar papers

Preprint Nov 2026

Success Probability of Block-Encoding Methods

Block-encoding methods apply nonunitary functions $f(\widetilde H)$ of a normalized Hermitian operator on a quantum computer, but only upon a successful postselection, which introduces a shot overhead rarely included in resource estimates. We analyze the success probability $p^{(f)}_{\mathrm{success}}=\sum_n w_n|f(\til...

Oumaya Ladhari, M. Saubanère, J. Messud · 0 citations
Preprint Oct 2026

Hardware-Friendly Estimation of LCU-Based Expectation Values via Quantum-to-Classical Workload Shifting

Estimating the expectation value of an observable $O$ for a quantum state evolved under a general, possibly non-unitary, operator $A$ is a fundamental task in quantum simulation, chemistry, and variational algorithms. Existing linear-combination-of-unitaries (LCU) approaches implement $A$ on hardware, requiring ancilla...

Hari Hara Suthan Chittoor, Thirumalai Manimaran · 0 citations
Preprint Oct 2026

Nearly Optimal T-Count for Symmetry-Based Quantum State Purification

The nearly optimal scaling of non-Clifford cost with the number of copies is established and the fundamental resource requirements for coherent symmetry projection in quantum state purification are uncovered.

Jia-Liang Tang, Jun-Hong Nie, Ke-Ming He et al. · 0 citations
Preprint Oct 2026

The exact LCU sampling overhead of collective diagonal unitaries: resonances and a continued-fraction dichotomy

The minimal sampling overhead of the quadratic collective phase $e^{-i\gamma K^2}$ over one layer of single-qubit rotations is decided by the continued fraction of $\gamma/\pi$. Here $K$ is a collective observable with spectrum $\{0,\dots,n\}$, such as the permutation-symmetric Hamming weight. This gate is the cardinal...

Zhi-Hui Wang, Sujit Roy, M. Maskey et al. · 0 citations
Preprint Oct 2026

Single-Shot Error Correction at Optimal Spacetime Cost

Recent work established that, for independent erasures, storing $K$ logical qubits for $S$ time steps with error at most $\varepsilon$ requires a spacetime cost of $\Omega(S(K+\log(S/\varepsilon)))$. A matching construction was also given, but assumes ideal error correction. Here we show that the same scaling can be ac...

Kishor Bharti, T. Haug, Derek Khu et al. · 0 citations
Preprint Nov 2026

Recovery gates as a resource in repetition-code process tomography: exhaustive gate-optimal designs for three, five and seven qubits

Repetition-code process tomography compares the logical channel of a code with a reference channel through a decoder almost always the standard minimum-weight one. We ask how many physical single-qubit Pauli gates that decoder needs when the measurement basis is fixed---the constraint that makes the count a resource. E...

Long Huang · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.