REVIEW 7 cited by
Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
The Quantum Approximate Optimization Algorithm (QAOA) is a promising algorithm for solving combinatorial optimization problems (COPs), with performance governed by variational parameters $\{\gamma_i, \beta_i\}_{i=0}^{p-1}$. While most prior work has focused on classically optimizing these parameters, we demonstrate that fixed linear ramp schedules, linear ramp QAOA (LR-QAOA), can efficiently approximate optimal solutions across diverse COPs. Simulations with up to $N_q=42$ qubits and $p=400$ layers suggest that the success probability scales as $P(x^*) \approx 2^{-\eta(p) N_q + C}$, where $\eta(p)$ decreases with increasing $p$. For example, in Weighted Maxcut instances, $\eta(10) = 0.22$ improves to $\eta(100) = 0.05$. Comparisons with classical algorithms, including simulated annealing, Tabu Search, and branch-and-bound, show a scaling advantage for LR-QAOA. We show results of LR-QAOA on multiple QPUs (IonQ, Quantinuum, IBM) with up to $N_q = 109$ qubits, $p=100$, and circuits requiring 21,200 CNOT gates. Finally, we present a noise model based on two-qubit gate counts that accurately reproduces the experimental behavior of LR-QAOA.
Forward citations
Cited by 7 Pith papers
-
Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement
Standard QAOA faces an intrinsic feasibility bottleneck on permutation problems that CE QAOA overcomes with an exponential gain in feasible probability for sublinear-to-linear depths under mild hypergraph growth.
-
A Reality Check on Quantum Optimisation: Evidence from an Industrial Case Study
On industrial job-shop scheduling instances, IBM and D-Wave quantum hardware solve only toy problems; the Fujitsu Digital Annealer with tailored QUBO formulations handles industry-scale instances and beats the paper's...
-
Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data
qReduMIS, using QAOA frozen-node signals plus classical reductions, solves real market MIS portfolio instances up to 225 assets on Helios with far better success and TTS scaling than standalone QAOA.
-
Quantum Portfolio Optimization: An Extensive Benchmark
On a new 260-instance real-world benchmark, classical MIP and heuristics clearly outperform quantum annealing and QAOA for a volatility-minimizing portfolio optimization variant.
-
Optimizing QAOA circuit transpilation with parity twine and SWAP network encodings
A simulated-annealing qubit-ordering step makes parity twine and SWAP network encodings beat Qiskit's transpiler for QAOA circuits above a connectivity threshold, and parity twine runs up to 20 qubits on IBM hardware.
-
A Hybrid Classical-Quantum Approach for Multi-Constrained Location Optimization Problem
Combining Unbalanced Penalization, a linear parameter ramp, and warm-started QAOA improves solution quality and feasibility for small Maximal Covering Location Problem instances.
-
An Exclusive-Sum-of-Products Pipeline for QAOA
QAOA constraint encoding via ESOP Boolean expressions is claimed to improve approximation ratios on MIS, but the derivation is flawed.
Discussion (0). Sign in to comment.