The effects of quantum hardware properties on the performances of variational quantum learning algorithms
Open Access
- 5 February 2024
- journal article
- research article
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 6 (1) , 1-16
Abstract
In-depth theoretical and practical research is nowadays being performed on variational quantum algorithms (VQAs), which have the potential to surpass traditional, classical, algorithms on a variety of problems, in physics, chemistry, biology, and optimization. Because they are hybrid quantum-classical algorithms, it takes a certain set of optimal conditions for their full potential to be exploited. For VQAs, the construction of an appropriate ansatz in particular is crucial, since it lays the ground for efficiently solving the particular problem being addressed. To prevent severe negative effects that hamper quantum computation, the substantial noise, together with the structural limitations, characteristic of currently available devices must be also taken into consideration while building the ansatz. In this work the effect of the quantum hardware structure, namely the topological properties emerging from the couplings between the physical qubits and the basis gates of the device itself, on the performances of VQAs is addressed. Specifically, it is here experimentally shown that a complex connectivity in the ansatz, albeit being beneficial for exploring wider sets of solutions, introduces an overhead of gates during the transpilation on a quantum computer that increases the overall error rate, thus undermining the quality of the training. It is hence necessary, when implementing a variation quantum learning algorithm, to find the right balance between a sufficiently parametrized ansatz and a minimal cost in terms of resources during transpilation. Moreover, the experimental finding allows to construct a heuristic metric function, which aids the decision-making process on the best possible ansatz structure to be deployed on a given quantum hardware, thus fostering a more efficient application of VQAs in realistic situations. The experiments are performed on two widely used variational algorithms, the VQE (variational quantum eigensolver) and the VQC (variational quantum classifier), both tested on two different problems, the first on the Markowitz portfolio optimization using real-world financial data, and the latter on a classification task performed on the Iris dataset.Keywords
Funding Information
- Consiglio Nazionale delle Ricerche
This publication has 46 references indexed in Scilit:
- Hardware-efficient variational quantum eigensolver for small molecules and quantum magnetsNature, 2017
- Quantum machine learningNature, 2017
- A variational eigenvalue solver on a photonic quantum processorNature Communications, 2014
- Ising formulations of many NP problemsFrontiers in Physics, 2014
- Quantum computing with trapped ionsPhysics Reports, 2008
- Superconducting quantum bitsNature, 2008
- A branch-and-bound algorithm for discrete multi-factor portfolio optimization modelJournal of Shanghai University (English Edition), 2008
- AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming ProblemsLecture Notes in Computer Science, 2006
- A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation1994
- PORTFOLIO SELECTION*The Journal of Finance, 1952