Pith. sign in

REVIEW 9 cited by

Strategies for running the QAOA at hundreds of qubits

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 2410.03015 v1 pith:KOFWSPOH submitted 2024-10-03 quant-ph

Brandon Augustino , Madelyn Cain , Edward Farhi , Swati Gupta , Sam Gutmann , Daniel Ranard , Eugene Tang , Katherine Van Kirk This is my paper
classification quant-ph
keywords qaoaparameterstreeoptimizationquantumalgorithmperformancewarm-start
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We explore strategies aimed at reducing the amount of computation, both quantum and classical, required to run the Quantum Approximate Optimization Algorithm (QAOA). First, following Wurtz et al. [Phys.Rev A 104:052419], we consider the standard QAOA with instance-independent "tree" parameters chosen in advance. These tree parameters are chosen to optimize the MaxCut expectation for large girth graphs. We provide extensive numerical evidence supporting the performance guarantee for tree parameters conjectured in [Phys.Rev A 103:042612] and see that the approximation ratios obtained with tree parameters are typically well beyond the conjectured lower bounds, often comparable to performing a full optimization. This suggests that in practice, the QAOA can achieve near-optimal performance without the need for parameter optimization. Next, we modify the warm-start QAOA of Tate et al. [Quantum 7:1121]. The starting state for the QAOA is now an optimized product state associated with a solution of the Goemans-Williamson (GW) algorithm. Surprisingly, the tree parameters continue to perform well for the warm-start QAOA. We find that for random 3-regular graphs with hundreds of vertices, the expected cut obtained by the warm-start QAOA at depth $p \gtrsim 3$ is comparable to that of the standard GW algorithm. Our numerics on random instances do not provide general performance guarantees but do provide substantial evidence that there exists a regime of instance sizes in which the QAOA finds good solutions at low depth without the need for parameter optimization. For each instance studied, we classically compute the expected size of the QAOA distribution of cuts; producing the actual cuts requires running on a quantum computer.

Discussion (0). Sign in to comment.

Forward citations

Cited by 9 Pith papers

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

  1. CutBackdoor: A Circuit Cut Triggered Backdoor Attack on Variational Quantum Algorithms

    quant-ph 2026-07 reject novelty 6.0 of 10

    A parameter-supply-chain backdoor triggers when a VQA circuit is cut because the deployment hardware is too small, inflating cut-path energy estimates by 1.3x-2.9x.

  2. Quantum Approximate Optimization via Noise-Directed Adaptive Warm-Starting

    quant-ph 2026-07 conditional novelty 6.0 of 10

    Bitflip-gauge warm-start QAOA that aligns the ansatz with amplitude-damping noise improves 100-qubit Ising approximation ratios over non-gauge iterative warm-start at no extra circuit cost.

  3. Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data

    quant-ph 2026-07 conditional novelty 6.0 of 10

    qReduMIS hybrid pipeline improves QAOA performance on real financial MIS instances up to 225 assets, achieving higher success probabilities and better scaling on Quantinuum trapped-ion hardware.

  4. Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data

    quant-ph 2026-07 conditional novelty 5.5 of 10

    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.

  5. Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits

    quant-ph 2025-10 conditional novelty 5.0 of 10

    A tensor-network-accelerated Markov sampler exactly samples ideal and noisy shallow QAOA circuits up to 476 qubits.

  6. IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX

    quant-ph 2025-01 unverdicted novelty 5.0 of 10

    IQPopt is a JAX-based software tool enabling classical optimization of IQP circuits with thousands of qubits via efficient simulation of Pauli-Z expectation values, plus a module for quantum generative model training.

  7. Mind the gaps: The fraught road to quantum advantage

    quant-ph 2025-10 unverdicted novelty 4.0 of 10

    The authors identify four transitions needed to reach fault-tolerant application-scale quantum computing from current NISQ devices.

  8. Time-frequency-correlated Native CCZ Gate in Superconducting Circuits

    quant-ph 2025-09 conditional novelty 4.0 of 10

    A tunable-coupler superconducting circuit can implement a native CCZ gate through a resonant |101> to |020> two-photon transition, reaching simulated fidelity above 99% in about 194 ns.

  9. Mind the gaps: The fraught road to quantum advantage

    quant-ph 2025-10 unverdicted novelty 3.0 of 10

    The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.

Pith tools