Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This paper advances variational quantum eigensolvers by introducing a Bayesian framework using von Mises-Fisher distributions to handle multiple success outcomes efficiently. The authors provide theoretical proofs for convergence properties and demonstrate the algorithm's effectiveness on small-scale molecular Hamiltonians like HeH⁺ and H₂.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

An iterative Bayesian variational quantum eigensolver with the von Mises-Fisher distribution

arXiv2 min read

arXiv:2610.11466v1 Announce Type: new Abstract: We develop an iterative Bayesian variational quantum eigensolver in which the unknown ground state, parametrised as a real unit vector, is inferred through a von Mises--Fisher distribution sequentially updated from Hadamard-test measurements on a single ancilla qubit. Building on a companion paper that treated a single success outcome via exact moment matching, we generalise the scheme to condition on $m$ success outcomes for the likelihood function per iteration. Since exact moment matching becomes impractical for $m>1$, we exploit the large-concentration regime, in which a first-order expansion of the log-likelihood yields a closed-form von Mises--Fisher posterior with $m$ entering only through a multiplicative weight. We prove that the two convergence properties of the single-outcome scheme---non-decreasing overlap and non-decreasing concentration---are preserved provided $m$ lies within an explicitly characterised range. Based on the theory, we propose a measurement-based algorithm and illustrate the convergence on randomly generated three- and four-qubit Hamiltonian matrices, on $\mathrm{HeH}^+$, and on $\mathrm{H}_2$.

Abstract:We develop an iterative Bayesian variational quantum eigensolver in which the unknown ground state, parametrised as a real unit vector, is inferred through a von Mises--Fisher distribution sequentially updated from Hadamard-test measurements on a single ancilla qubit. Building on a companion paper that treated a single success outcome via exact moment matching, we generalise the scheme to condition on $m$ success outcomes for the likelihood function per iteration. Since exact moment matching becomes impractical for $m>1$, we exploit the large-concentration regime, in which a first-order expansion of the log-likelihood yields a closed-form von Mises--Fisher posterior with $m$ entering only through a multiplicative weight. We prove that the two convergence properties of the single-outcome scheme---non-decreasing overlap and non-decreasing concentration---are preserved provided $m$ lies within an explicitly characterised range. Based on the theory, we propose a measurement-based algorithm and illustrate the convergence on randomly generated three- and four-qubit Hamiltonian matrices, on $\mathrm{HeH}^+$, and on $\mathrm{H}_2$.

arXiv:2610.11466 [quant-ph]

(or arXiv:2610.11466v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2610.11466 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 244 words

Related coverage