Pith. sign in

REVIEW 2 cited by

On the natural gradient for variational quantum eigensolver

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 1909.05074 v1 pith:HG6QO3ZG submitted 2019-09-11 quant-ph

classification quant-ph
keywords gradientmethodnaturalquantumeigensolveroptimizationvariationalgeometric
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The variational quantum eigensolver is a hybrid algorithm composed of quantum state driving and classical parameter optimization, for finding the ground state of a given Hamiltonian. The natural gradient method is an optimization method taking into account the geometric structure of the parameter space. Very recently, Stokes et al. developed the general method for employing the natural gradient for the variational quantum eigensolver. This paper gives some simple case-studies of this optimization method, to see in detail how the natural gradient optimizer makes use of the geometric property to change and improve the ordinary gradient method.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Benchmarking a wide range of optimisers for solving the Fermi-Hubbard model using the variational quantum eigensolver

    quant-ph 2024-11 conditional novelty 5.0 of 10

    A 372-instance numerical benchmark of VQE for Fermi-Hubbard finds Momentum and Adam with finite differences achieve the best accuracy, while SPSA and CMAES minimize function calls.

  2. Data-Dependent Generalization Bounds for Parameterized Quantum Models Under Noise

    cs.LG 2024-12 reject novelty 4.0 of 10

    A generalization bound for noisy parameterized quantum classifiers is derived from quantum Fisher information, parameter-space volume, and sample size, with local refinements claimed to tighten it.

Pith tools