Pith. sign in

REVIEW 5 cited by

Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms

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

arxiv 2309.13110 v2 pith:TE6BFR3B submitted 2023-09-22 quant-ph

Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms

classification quant-ph
keywords algorithmsquantumalgorithmclassicaloptimizationhybridindependentiterative
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Quantum algorithms have been widely studied in the context of combinatorial optimization problems. While this endeavor can often analytically and practically achieve quadratic speedups, theoretical and numeric studies remain limited, especially compared to the study of classical algorithms. We propose and study a new class of hybrid approaches to quantum optimization, termed Iterative Quantum Algorithms, which in particular generalizes the Recursive Quantum Approximate Optimization Algorithm. This paradigm can incorporate hard problem constraints, which we demonstrate by considering the Maximum Independent Set (MIS) problem. We show that, for QAOA with depth $p=1$, this algorithm performs exactly the same operations and selections as the classical greedy algorithm for MIS. We then turn to deeper $p>1$ circuits and other ways to modify the quantum algorithm that can no longer be easily mimicked by classical algorithms, and empirically confirm improved performance. Our work demonstrates the practical importance of incorporating proven classical techniques into more effective hybrid quantum-classical algorithms.

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. 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

    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.

  2. 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

    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.

  3. How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits

    quant-ph 2024-11 accept novelty 4.0

    A comprehensive review of scaling paths for superconducting quantum computers, with resource and sensitivity analyses for utility-scale applications under realistic error distributions.

  4. Partitioned Iterative Quantum Scheduling of Satellites for Urgent Disaster Response: Case study of Wildfire

    quant-ph 2026-06 unverdicted novelty 3.0

    Applies partitioned iterative quantum scheduling and distributed quantum methods to satellite tasking for wildfire response on real datasets, validating the framework but finding no significant advantage due to small ...

  5. The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute

    quant-ph 2025-08 unverdicted novelty 2.0

    A synthesis of expert insights from the ADAC Quantum Computing Working Group and member survey on the complementary roles of quantum and classical high-performance computing in future hybrid infrastructures.