Survey on the Improvement and Application of HHL Algorithm

Quantum computing is a new computing mode that follows the laws of quantum mechanics to control quantum information units for computation. In terms of computational efficiency, due to the existence of quantum mechanical superposition, some known quantum algorithms can process problems faster than tr...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series Vol. 2333; no. 1; pp. 12023 - 12034
Main Authors: Liu, Xiaonan, Xie, Haoshan, Liu, Zhengyu, Zhao, Chenyan
Format: Journal Article
Language:English
Published: Bristol IOP Publishing 01.08.2022
Subjects:
ISSN:1742-6588, 1742-6596
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Quantum computing is a new computing mode that follows the laws of quantum mechanics to control quantum information units for computation. In terms of computational efficiency, due to the existence of quantum mechanical superposition, some known quantum algorithms can process problems faster than traditional general-purpose computers. HHL algorithm is an algorithm for solving linear system problems. Compared with classical algorithms in solving linear equations, it has an exponential acceleration effect in certain cases and as a sub-module, it is widely used in some machine learning algorithms to form quantum machines learning algorithms. However, there are some limiting factors in the use of this algorithm, which affect the overall effect of the algorithm. How to improve it to make the algorithm perform better has become an important issue in the field of quantum computing. This paper summarizes the optimization and improvement of HHL algorithm since it was proposed, and the application of HHL algorithm in machine learning, and discusses some possible future improvements of some subroutines in HHL algorithm.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/2333/1/012023