Step-by-Step HHL Algorithm Walkthrough to Enhance the Understanding of
Critical Quantum Computing Concepts
- URL: http://arxiv.org/abs/2108.09004v4
- Date: Sat, 25 Mar 2023 02:40:15 GMT
- Title: Step-by-Step HHL Algorithm Walkthrough to Enhance the Understanding of
Critical Quantum Computing Concepts
- Authors: Hector Jose Morrell Jr, Anika Zaman, and Hiu Yung Wong
- Abstract summary: Harrow-Hassidim-Lloyd (HHL) quantum algorithm is explained analytically followed by a 4-qubit numerical example in bra-ket notation.
A quantum circuit programmed using qiskit can be used for real hardware execution in IBM quantum computers.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: After learning basic quantum computing concepts, it is desirable to reinforce
the learning using an important and relatively complex algorithm through which
the students can observe and appreciate how the qubits evolve and interact with
each other. Harrow-Hassidim-Lloyd (HHL) quantum algorithm, which can solve
Linear System Problems with exponential speed-up over the classical method and
is the basic of many important quantum computing algorithms, is used to serve
this purpose. The HHL algorithm is explained analytically followed by a 4-qubit
numerical example in bra-ket notation. Matlab code corresponding to the
numerical example is available for students to gain a deeper understanding of
the HHL algorithm from a pure matrix point of view. A quantum circuit
programmed using qiskit is also provided which can be used for real hardware
execution in IBM quantum computers. After going through the material, students
are expected to have a better appreciation of the concepts such as basis
transformation, bra-ket and matrix representations, superposition,
entanglement, controlled operations, measurement, Quantum Fourier
Transformation, Quantum Phase Estimation, and quantum programming. To help
readers review these basic concepts, brief explanations augmented by the HHL
numerical examples in the main text are provided in the Appendix.
Related papers
- Advancing Quantum Computing with Formal Methods [0.0]
This tutorial is aimed at everyone in the formal methods community with an interest in quantum computing.
Familiarity with quantum computing is not required, but basic linear algebra knowledge is a prerequisite.
arXiv Detail & Related papers (2024-07-16T12:51:38Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Quantivine: A Visualization Approach for Large-scale Quantum Circuit
Representation and Analysis [31.203764035373677]
We develop Quantivine, an interactive system for exploring and understanding quantum circuits.
A series of novel circuit visualizations are designed to uncover contextual details such as qubit provenance, parallelism, and entanglement.
The effectiveness of Quantivine is demonstrated through two usage scenarios of quantum circuits with up to 100 qubits.
arXiv Detail & Related papers (2023-07-18T04:51:28Z) - Quantum Machine Learning: from physics to software engineering [58.720142291102135]
We show how classical machine learning approach can help improve the facilities of quantum computers.
We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
arXiv Detail & Related papers (2023-01-04T23:37:45Z) - An introduction to variational quantum algorithms on gate-based quantum
computing for combinatorial optimization problems [0.0]
This tutorial provides a mathematical description of the class of Variational Quantum Algorithms.
We introduce precisely the key aspects of these hybrid algorithms on the quantum side and the classical side.
We devote a particular attention to QAOA, detailing the quantum circuits involved in that algorithm, as well as the properties satisfied by its possible guiding functions.
arXiv Detail & Related papers (2022-12-22T14:27:52Z) - From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions.
For its practicability and wide-applicability, we give a brief review of typical graph learning techniques.
We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
arXiv Detail & Related papers (2022-02-19T02:56:47Z) - Parametrized Complexity of Quantum Inspired Algorithms [0.0]
Two promising areas of quantum algorithms are quantum machine learning and quantum optimization.
Motivated by recent progress in quantum technologies and in particular quantum software, research and industrial communities have been trying to discover new applications of quantum algorithms.
arXiv Detail & Related papers (2021-12-22T06:19:36Z) - Benchmarking Small-Scale Quantum Devices on Computing Graph Edit
Distance [52.77024349608834]
Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical.
In this paper we present a comparative study of two quantum approaches to computing GED.
arXiv Detail & Related papers (2021-11-19T12:35:26Z) - Facial Expression Recognition on a Quantum Computer [68.8204255655161]
We show a possible solution to facial expression recognition using a quantum machine learning approach.
We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
arXiv Detail & Related papers (2021-02-09T13:48:00Z) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z) - Fundamentals In Quantum Algorithms: A Tutorial Series Using Qiskit
Continued [0.0]
This tutorial series aims to help understand several of the most promising quantum algorithms to date, including Phase Estimation, Shor's, QAOA, VQE, and several others.
Accompanying each algorithm's theoretical foundations are coding examples utilizing IBM's Qiskit, demonstrating the strengths and challenges of implementing each algorithm in gate-based quantum computing.
arXiv Detail & Related papers (2020-08-24T18:37:24Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.