Pith. sign in

REVIEW 8 cited by

Adaptive shot allocation for fast convergence in variational 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 2108.10434 v1 pith:DLWVE5NZ submitted 2021-08-23 quant-ph cs.LG

Adaptive shot allocation for fast convergence in variational quantum algorithms

classification quant-ph cs.LG
keywords gcansnumberquantumadaptivemethodrequiredshotsvqas
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Variational Quantum Algorithms (VQAs) are a promising approach for practical applications like chemistry and materials science on near-term quantum computers as they typically reduce quantum resource requirements. However, in order to implement VQAs, an efficient classical optimization strategy is required. Here we present a new stochastic gradient descent method using an adaptive number of shots at each step, called the global Coupled Adaptive Number of Shots (gCANS) method, which improves on prior art in both the number of iterations as well as the number of shots required. These improvements reduce both the time and money required to run VQAs on current cloud platforms. We analytically prove that in a convex setting gCANS achieves geometric convergence to the optimum. Further, we numerically investigate the performance of gCANS on some chemical configuration problems. We also consider finding the ground state for an Ising model with different numbers of spins to examine the scaling of the method. We find that for these problems, gCANS compares favorably to all of the other optimizers we consider.

discussion (0)

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

Forward citations

Cited by 8 Pith papers

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

  1. Adaptive directional gradients for parameterised quantum circuits

    quant-ph 2026-06 unverdicted novelty 8.0

    Forward gradient framework for PQCs unifies SPSA and parameter-shift as limits, introduces QUIVER adaptive optimizer with closed-form measurement allocation, and demonstrates efficient training of 60-qubit circuits on...

  2. $\sigma$-VQE: Excited-state preparation of quantum many-body scars with shallow circuits

    quant-ph 2026-02 unverdicted novelty 7.0

    σ-VQE uses low-depth circuits and an energy-selective cost function to preferentially prepare quantum many-body scar states on NISQ devices.

  3. StableShots: Online Shot Stopping for Quantum Circuit Execution

    quant-ph 2026-06 unverdicted novelty 6.0

    StableShots is a black-box online stopping rule that monitors TVD stability across batches to reach TVD <= 0.05 on held-out tests with a median of 7650 shots across 180 circuit traces, outperforming fixed-shot baselines.

  4. Local-Observable-Guided Generative Quantum Circuits for Degenerate Ground Spaces

    quant-ph 2026-05 unverdicted novelty 6.0

    Hybrid generative quantum circuits guided by local observable correlators sample diverse ensembles whose span reproduces degenerate ground spaces in Majumdar-Ghosh, AKLT, and XXZ models.

  5. Molecular Excited States using Quantum Subspace Methods: Accuracy, Resource Reduction, and Error-Mitigated Hardware Implementation of q-sc-EOM

    quant-ph 2026-04 conditional novelty 6.0

    Optimized q-sc-EOM on quantum hardware yields accurate excited-state energies for challenging molecular bond-breaking cases after reducing measurement scaling to O(N^5) and applying readout and symmetry error mitigation.

  6. Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation

    quant-ph 2026-03 unverdicted novelty 6.0

    QAOA with max-probability bitstring cut value objective, Bayesian optimization, and dual-criteria adaptive shots matches conventional MaxCut quality while using fewer total measurements.

  7. From barren plateaus through fertile valleys: Conic extensions of parameterised quantum circuits

    quant-ph 2023-10 unverdicted novelty 6.0

    Conic extensions of parameterized quantum circuits enable jumps from barren plateaus to fertile valleys via non-unitary operations and ancilla, reducing optimal jump selection to a generalized eigenvalue problem and i...

  8. Native topological readout on qubit hardware: a Fibonacci-chain benchmark of measurement-compilation trade-offs

    quant-ph 2026-05 unverdicted novelty 4.0

    Benchmark comparing fusion readout and grouped-Pauli methods for Fibonacci anyon Hamiltonians on Floquet and VQE circuits shows no uniform winner and provides scaling laws for measurement budgets.