pith. sign in

arxiv: 2406.01743 · v5 · pith:XTX3Q5F5new · submitted 2024-06-03 · 🪐 quant-ph

Integrated error-suppressed pipeline for quantum optimization of nontrivial binary combinatorial optimization problems on gate-model hardware at the 156-qubit scale

classification 🪐 quant-ph
keywords optimizationmethodproblemsbinarygraphsquantumregularclassical
0
0 comments X
read the original abstract

We introduce a novel hybrid quantum-classical variational optimization method for unconstrained binary combinatorial optimization problems on gate-model quantum computers, integrating a custom variational ansatz, staged feedback-based dual variational parameter update strategies, efficient parametric compilation, automated error suppression during hardware execution, and scalable O($n$) classical post-processing to correct for bitflip errors. Without this integrated approach, we show that standard circuit execution at scale produces output indistinguishable from random sampling, establishing the necessity of each pipeline component. We benchmark the method on IBM superconducting quantum computers for classically nontrivial optimization problems, where the optimization is conducted on hardware with no use of classical simulation or prior knowledge of the solution. For Max-Cut on random regular graphs with topologies not matched to device connectivity, the method achieves approximation ratios of 100% for unweighted 3-regular graphs up to 156 nodes, weighted regular graphs up to 80 nodes, and weighted 7-regular graphs up 50 nodes. Applied to higher-order binary optimization, the method finds the ground state energy of 127- and 156-qubit spin-glass models matched to device topology with linear, quadratic, and cubic interaction terms, achieving approximation ratios of at least 99.5% across all instances tested. The method consistently outperforms a classical local solver across all problems. Where published results on identical problem instances are available, our method demonstrates competitive or superior performance. These results demonstrate that an appropriately engineered approach enables gate-model quantum computers to produce high-quality solutions for nontrivial binary optimization problems at the 156 qubit scale, where naive implementations are insufficient for good performance.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Efficient mapping of multi-constraint satisfaction problems to Rydberg platforms

    quant-ph 2026-04 unverdicted novelty 6.0

    A compact xor_1 gadget enforces exactly-one constraints on Rydberg arrays via fixed-detuning blockade, cutting detuning range by up to 99% and atom/connectivity overhead by up to 54% versus QUBO for gate assignment an...

  2. Tensor network surrogate models for variational quantum computation

    quant-ph 2026-04 unverdicted novelty 6.0

    Tensor network simulations act as effective surrogate models for training QAOA on large 2D lattices, overcoming limits of parameter transfer from small instances and remaining classically feasible with moderate bond d...

  3. Direct entanglement ansatz learning (DEAL) with ZNE on error-prone superconducting qubits

    quant-ph 2025-04 unverdicted novelty 5.0

    DEAL boosts success rates in quantum combinatorial optimization by up to 14% over QAOA on superconducting qubits via direct parameter-to-angle mapping, entanglement ansatz, and ZNE.

  4. The QuaST Decision Tree: Achieving Automation With Data-Based Recommendations

    quant-ph 2026-05 unverdicted novelty 4.0

    The QuaST Decision Tree is a configurable modular system that automates recommendations for hybrid quantum algorithms, featuring a module for assessing variational algorithm feasibility through scalability analysis.

  5. Classical Combinatorial Optimization Scaling for Random Ising Models on 2D Heavy-Hex Graphs

    math.OC 2024-12 unverdicted novelty 3.0

    Classical solvers solve random Ising models on heavy-hex graphs efficiently, with Gurobi showing linear or weakly quadratic scaling up to 100k variables and simulated annealing showing exponential time-to-solution wit...