Sapova and Fedorov introduce the variant by name — "we introduce batched ADAPT-VQE that adds multiple operators with the largest gradients simultaneously. This approach allows reducing the number of gradient computations while building a compact ansatz" — and state the selection rule as a ratio rather than a fixed count: "At each ADAPT-VQE iteration, we pick all the gradients that differ from the largest by a ratio less than r". What it buys is stated without a number: "Since batched ADAPT-VQE adds multiple operators at each step, it requires sizably fewer iterations to build an ansatz, which considerably reduces the cost of computing gradients". The saving is in iterations, not in the per-iteration measurement — the whole operator pool is still scanned each round, which is why this method carries the same `observable-estimation` step its parent does.

The Hamiltonian whose ground state is wanted, together with whatever structure is to be respected — particle number, spin, point-group symmetry, a reference determinant — and the connectivity and native gate set of the device the family has to run on.

1. Hamiltonian whose eigenvalues are wanted → Parameterised circuit familybatch-append operators near the top gradient

   At iteration $k$ every pool operator $A_i$ is screened by the same gradient used in plain ADAPT-VQE, $\partial E/\partial\theta_i = \langle\psi^k|[H,A_i]|\psi^k\rangle$, the Hamiltonian-operator commutator evaluated on the current ansatz state. approximation: rather than adding only the single largest-gradient operator and re-measuring before the next pick, batched ADAPT-VQE orders the pool by gradient magnitude and appends, in one step, every operator whose gradient falls within a ratio $r$ of the largest — so operators later in that ordering are chosen from a gradient snapshot taken before any operator ahead of them in the same batch has actually been added or its coefficient optimized. assumption: $r$ is a fixed hyperparameter set once per problem rather than derived from the gradient distribution (the paper uses $r=2$ throughout). The resulting batch is appended to the ansatz in that gradient order, then the full parameter set is re-optimized.

   approximationassumption

A circuit family with a fixed structure and free real parameters, together with the number of those parameters — which is the size of the classical search problem handed to the next layer.

• Estimate an observable

  Given the ability to prepare $|ψ⟩$ and a description of an observable $O$, return a classical scalar within $\varepsilon$ of $⟨O⟩$ at confidence $1−δ$. The state is never returned; only the number is.

  This method asks the estimator for two kinds of gradient, never an energy: the screen that ranks the pool operators, and the parameter gradients the gradient-based SLSQP optimiser consumes when the appended batch is re-optimised — "gradients in the VQE procedure and gradients with respect to the operators in the same way". Batching changes how many operators one screen yields, not what the screen asks for. The route depends on the pool: qubit operators take the parameter-shift rule directly, while "fermionic operators do not allow direct application" of it and go through fermionic-shift gradients, 4 circuit evaluations per gradient approximation: the cheaper fermionic-shift variant, 2 evaluations rather than 4, is bought by "introducing approximations" the paper does not spell out. assumption: the reported fermionic runs use neither, reading the gradient out numerically in one sweep over all $k$ circuit parameters — exact against analytic gradients only because these are noiseless statevector simulations, numerical ones being "less robust in the presence of noise".

  approximationassumption

given  Hamiltonian H (Jordan-Wigner mapped, qubit-tapered),  reference state |psi_ref>
       (e.g. the UHF state for an open-shell molecule such as O2, Sec. II C 2),
       fixed operator pool  {A_1, ..., A_M}  -- either fermionic UCCSD excitations
       or individual qubit Pauli strings, per which ADAPT-VQE variant is run

requires  r > 0,  a fixed ratio hyperparameter, not re-derived from the gradient
          distribution or re-tuned across rounds (the paper sets r = 2 for every
          molecule it simulates, Sec. II A)

k = 0,   psi_0 = psi_ref,   ansatz = identity,   theta = []

loop
    # --- pool screening, via observable-estimation ---------------------------
    for every A_i in the pool:
        g_i = <psi_k| [H, A_i] |psi_k>
            # the same commutator-gradient screen as plain ADAPT-VQE (Fig. 1,
            # Sec. II A); costed through observable-estimation -- parameter-shift
            # for qubit-pool operators; the paper's own statevector runs cost
            # fermionic-pool operators with numerical gradients (k+1 evaluations),
            # not the fermionic-shift analytic alternative it describes and sets
            # aside as too slow for the large fermionic gate counts (Sec. IV D)
    g_max = max_i |g_i|

    # --- batch selection & append ----------------------------------------------
    batch_k = { i : g_max / |g_i| < r }
        # "we pick all the gradients that differ from the largest by a ratio less
        #  than r" -- prose rule only, the paper gives no closed-form equation
        #  for it (Sec. II A, Fig. 1 caption)
    # every g_i above was read off the SAME state psi_k: an operator ranked later
    # within batch_k is screened before any operator ranked ahead of it in the
    # same batch has actually been appended to the ansatz or had its coefficient
    # optimized
    ansatz <- ansatz composed with  exp(theta_i A_i),  i in batch_k,
                  appended in gradient order
        # "we add the operators to the ansatz following the order of computed
        #  gradients" (Sec. II A) -- direction unstated; largest-first is the
        #  natural reading, since batch_k is already ranked by |g_i| and
        #  original ADAPT-VQE always adds the single largest-gradient operator,
        #  but the paper never writes "decreasing" or "descending"
    theta <- [ theta unchanged;  new entries for batch_k ]
        # "we set initial parameters to optimal values obtained at the previous
        #  iteration, as was done in the original work" (Sec. IV D) -- only the
        #  carry-over of the EXISTING entries is stated; the paper does not say
        #  what the newly appended entries are initialized to

    # --- re-optimize the whole ansatz, via observable-estimation ----------------
    theta = argmin_theta  <psi(theta)| H |psi(theta)>   via SLSQP
        # gradients for this optimization are the same observable-estimation
        # call used for screening, not a separate estimator: "we calculate
        # gradients in the VQE procedure and gradients with respect to the
        # operators in the same way" (Sec. IV D)
    psi_{k+1} = psi(theta)
    k = k + 1

    if  E_k has converged:   break
        # this paper's own reported runs stop "until the energy convergence"
        # (Sec. IV E) -- no numeric criterion is given for it. Sec. IV E goes on
        # to describe eps_m = 10^-m (Eq. 8) as what the original ADAPT-VQE work
        # [27] applies to the gradient-vector norm, and recommends applying it to
        # the max gradient component instead as "preferable ... in practical
        # simulation" -- a 10^-2 max-component threshold gave energies close to
        # VQE-UCCSD with fewer gates. Neither eps_m form is stated to be what
        # produced the results reported here.

return  U(theta) |psi_ref>,  built from  batch_0 (union) batch_1 (union) ... (union) batch_{k-1}
# k rounds in place of one operator per round -- each round still screens the
# full pool (see cost)

Sapova and Fedorov: batching cuts rounds, not the per-round measurement. "The number of computed energy derivatives at each step equals the operator pool size", and the rule picking every gradient within ratio $r = 2$ of the largest (selected from $2, 5, 10$) needs all of them. Pool size is $O(N^2 n^2)$ for $N$ spin-orbitals and $n$ electrons (fermionic UCCSD), or $O(n^4)$ in system size — a different $n$ — for Pauli-string pools, carrying an $O(n^8)$ measurement overhead they attribute to Shkolnikov et al. and Liu et al. rather than derive. Parameter-shift costs 2 circuit evaluations per derivative (their qubit runs); their fermionic runs used numerical gradients, $k+1$ evaluations for a whole $k$-parameter gradient. Each round's inner VQE is capped at 200 SLSQP iterations; nothing bounds the rounds, which stop on a tuned gradient threshold. Savings are measured on STO-3G statevector simulations: "up to an order reduction" in total 1-parameter derivatives, for fermionic and qubit polynomial pools — CO about 3,500 against 30,100, and 75,000 against 555,000 past UCCSD energy — while with a linear pool on H2O at $R = 2.0$ Å batching computed about 10% more.

• Batched ADAPT-VQE · Qiskit

  From the repository — run, not written up from a paper · unsupported

  About

  Several high-gradient operators are appended per adaptive iteration to reduce optimization and measurement rounds.

  Methods

  None found yet.

  Data

  None found yet.

  Code

  Qiskit

  Results

  Literature-backed method record; algorithmic scope and evidence boundary reviewed, with no benchmark run claimed.

• Batched ADAPT-VQE

  Several high-gradient operators are appended per adaptive iteration to reduce optimization and measurement rounds.