Papers › Adaptive Observation Cost Control for Variational Quantum Eigensolvers

Adaptive Observation Cost Control for Variational Quantum Eigensolvers

3 Feb 2025arXiv:2502.01704archive 2025-07-28

Christopher J. Anders, Kim A. Nicoli, Bingting Wu, Naima Elosegui, Samuele Pedrielli, Lena Funcke, Karl Jansen, Stefan Kühn, Shinichi Nakajima

The objective to be minimized in the variational quantum eigensolver (VQE) has a restricted form, which allows a specialized sequential minimal optimization (SMO) that requires only a few observations in each iteration. However, the SMO iteration is still costly due to the observation noise -- one observation at a point typically requires averaging over hundreds to thousands of repeated quantum measurement shots for achieving a reasonable noise level. In this paper, we propose an adaptive cost control method, named subspace in confident region (SubsCoRe), for SMO. SubsCoRe uses the Gaussian process (GP) surrogate, and requires it to have low uncertainty over the subspace being updated, so that optimization in each iteration is performed with guaranteed accuracy. The adaptive cost control is performed by first setting the required accuracy according to the progress of the optimization, and then choosing the minimum number of measurement shots and their distribution such that the required accuracy is satisfied. We demonstrate that SubsCoRe significantly improves the efficiency of SMO, and outperforms the state-of-the-art methods.

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 15 code samples harvested from 2 repositories linked to this paper: 9 ran (of which 4 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; 1 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: official repository: 10 samples from 1 repository, 6 ran (4 with no instrument failure; 2 where Syntology's instrument failed); found in paper text by Syntology: 5 samples from 1 repository, 3 ran (3 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 1 of the 9 samples that ran has no recorded date.

angler-vqe/subscore officialmentioned in paperpytorchSyntology: 10 samples, 6 ran (2 instrument-failed) · 4 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

15 samples harvested: 9 ran (of which 4 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · our draft was wrong
1ran; the contract check could not run
7ran
6unverified

Licence: 15 of the 15 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. For 1 sample that ran, the graph records a signature this page does not show: for a class the fixture built without calling, the harness called the object with inputs it made up itself, so the recorded signature is the harness's probe, not the fixture's arguments. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

angler-vqe/subscore official repository 10 samples, 6 ran (2 instrument-failed) · 4 unverified
LeastSquaresWave src/subscore/bayesopt/bo.py ran no licence file found · pointer only · e209b77b82f2ef6e · report fixture: returned LeastSquaresWave · level recorded 2026-09-22
LineSearchOptimizer src/subscore/bayesopt/bo.py ran no licence file found · pointer only · dce2e55cb50f444d · report fixture: returned LineSearchOptimizer · level recorded 2026-09-22
MeasureMeta src/subscore/bayesopt/bo.py ran no licence file found · pointer only · ad942ce204e150e8 · report fixture: returned MeasureMeta · level recorded 2026-09-22
Optimizer in 18 papers src/subscore/bayesopt/bo.py ran fingerprinted no licence file found · pointer only · 67357eab38c03c79 · report fixture: returned Optimizer · level recorded 2026-09-22
make_shift src/subscore/bayesopt/bo.py ran; the contract check could not run (RAISES) no licence file found · pointer only · 135cf99e934b1aa2 · report fixture: signature pivot:Tensor/2/float, shifts:Tensor/2/float, axis:list/1/int · returned Tensor · level recorded 2026-09-22
wrap_logger scripts/bayesian_optimization.py ran · our draft was wrong no licence file found · pointer only · bdf67df126406259 · report fixture: signature log_fn:callable/0/? · returned function · level recorded, date not recorded
AcquisitionFunction src/subscore/bayesopt/bo.py unverified no licence file found · pointer only · d721fb01222b4f49 · report
MeasureGoal src/subscore/bayesopt/bo.py unverified no licence file found · pointer only · a6cd7b0005b7d568 · report
SMOOptimizer src/subscore/bayesopt/bo.py unverified no licence file found · pointer only · bcdb4cb48cc44ed2 · report
shape_step src/subscore/bayesopt/bo.py unverified no licence file found · pointer only · 6d321cc18019be3f · report
emicore/emicore found in paper text by Syntology 5 samples, 3 ran (0 instrument-failed) · 2 unverified
LeastSquaresWave src/emicore/bo.py ran · metamorphic tier: invariant fingerprinted no licence file found · pointer only · 49324c72ed893379 · report fixture: signature y_pivot:float/0/float, y_shifts:list/1/float, x_cand:Tensor/1/float · returned Tensor · level recorded 2026-09-22
Optimizer in 18 papers src/emicore/bo.py ran no licence file found · pointer only · 2b7d6039ba3f5223 · report fixture: signature model:MockModel/0/?, state:dict/0/? · returned NoneType · level recorded 2026-09-24
make_shift src/emicore/bo.py ran no licence file found · pointer only · 4fb158842f8538ca · report fixture: signature pivot:Tensor/2/float, shifts:Tensor/2/float, axis:list/1/int · returned Tensor · level recorded 2026-09-22
LineSearchOptimizer src/emicore/bo.py unverified no licence file found · pointer only · aaacac6a24ac7459 · report
SMOOptimizer src/emicore/bo.py unverified no licence file found · pointer only · 5ae69bca11f02a15 · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another.

2 assemblies on this paper: 2 harvested, 0 generated, listed in 1 groups (siblings lifted in one batch form one group).

2 sibling assemblies for SubsCoRe (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.

harvested Assembly for SubsCoRe (graph method: SubsCoRe). 9 bricks; individually on a fixture: 5 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified. The assembly has not been run end-to-end.

one of 2 siblings

  1. SMOOptimizer entry · level 0 · unverified · bcdb4cb48cc44ed2
  2. LeastSquaresWave helper · level 1 · ran · e209b77b82f2ef6e
  3. LineSearchOptimizer helper · level 1 · ran · dce2e55cb50f444d
  4. MeasureGoal helper · level 0 · unverified · a6cd7b0005b7d568
  5. make_shift helper · level 1 · ran; the contract check could not run (RAISES) · 135cf99e934b1aa2
  6. shape_step helper · level 0 · unverified · 6d321cc18019be3f
  7. MeasureMeta helper · level 1 · ran · ad942ce204e150e8
  8. Optimizer update_rule · level 1 · ran · 67357eab38c03c79
  9. AcquisitionFunction helper · level 0 · unverified · d721fb01222b4f49

harvested Assembly for SubsCoRe (graph method: SubsCoRe). 5 bricks; individually on a fixture: 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified. The assembly has not been run end-to-end.

one of 2 siblings

  1. SMOOptimizer entry · level 0 · unverified · 5ae69bca11f02a15
  2. LeastSquaresWave helper · level 1 · ran · 49324c72ed893379
  3. LineSearchOptimizer helper · level 0 · unverified · aaacac6a24ac7459
  4. make_shift helper · level 1 · ran · 4fb158842f8538ca
  5. Optimizer helper · level 1 · ran · 2b7d6039ba3f5223

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2502.01704") returns these assemblies with each brick's role and wiring (how to connect).

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Gaussian Process

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections