Back to News
quantum-computing

A framework to evaluate the performance of Variational Quantum Algorithms

Ernesto Mamedaliev, Vladyslav Libov, Albert Nieto-Morales, Oskar S{\l}owik, Arit Kumar Bishwas
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers introduced a standardized framework to benchmark Variational Quantum Algorithms (VQAs) for combinatorial optimization, addressing the lack of unified evaluation criteria in noisy quantum computing. The framework evaluates VQAs using three metrics—feasibility, solution quality, and reproducibility—while visualizing trade-offs between success rates and computational costs via a "quality diagram." Reproducibility is quantified using Shannon entropy, providing a statistical measure of algorithm consistency across repeated runs on NISQ devices. A decision rule helps select optimal algorithms under resource constraints, demonstrated on a 16-qubit QUBO problem with CVaR cost functions and varying shot counts. The approach enables adaptive algorithm selection in hybrid quantum-classical workflows, advancing systematic benchmarking for practical quantum advantage.
AI Audio Summary
0:00 / 0:00
Click to play
Untitled design (15).png
Quantum News · Media Library

Quantum Physics arXiv:2601.18812 (quant-ph) [Submitted on 21 Jan 2026] Title:A framework to evaluate the performance of Variational Quantum Algorithms Authors:Ernesto Mamedaliev, Vladyslav Libov, Albert Nieto-Morales, Oskar Słowik, Arit Kumar Bishwas View a PDF of the paper titled A framework to evaluate the performance of Variational Quantum Algorithms, by Ernesto Mamedaliev and 4 other authors View PDF HTML (experimental) Abstract:Variational Quantum Algorithms (VQAs) are promising methods for solving combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) devices. However, benchmarking VQAs is difficult due to their stochastic behavior and the lack of standardized performance criteria. This work introduces a general framework for evaluating VQAs applied to Quadratic Unconstrained Binary Optimization (QUBO) problems. The framework uses three complementary metrics: feasibility, quality, and reproducibility. It also introduces a quality diagram that visualizes trade-offs between success probability and computational resources. Reproducibility is formalized using Shannon entropy, and a decision rule is defined for selecting algorithms under resource constraints. As a demonstration, the framework is applied to several VQAs using Conditional Value at Risk (CVaR) cost functions and different shot counts on a 16-qubit QUBO instance. The results show how the framework supports systematic benchmarking and provides a foundation for adaptive algorithm selection in hybrid quantum-classical workflows. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2601.18812 [quant-ph] (or arXiv:2601.18812v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2601.18812 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Ernesto Mamedaliev [view email] [v1] Wed, 21 Jan 2026 13:15:57 UTC (454 KB) Full-text links: Access Paper: View a PDF of the paper titled A framework to evaluate the performance of Variational Quantum Algorithms, by Ernesto Mamedaliev and 4 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-01 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators 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. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-algorithms
quantum-hardware
quantum-machine-learning
quantum-optimization

Source Information

Source: arXiv Quantum Physics

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.