Fundamentals In Quantum Algorithms: A Tutorial Series Using Qiskit
Continued
- URL: http://arxiv.org/abs/2008.10647v1
- Date: Mon, 24 Aug 2020 18:37:24 GMT
- Title: Fundamentals In Quantum Algorithms: A Tutorial Series Using Qiskit
Continued
- Authors: Daniel Koch, Saahil Patel, Laura Wessing, Paul M. Alsing
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: With the increasing rise of publicly available high level quantum computing
languages, the field of Quantum Computing has reached an important milestone of
separation of software from hardware. Consequently, the study of Quantum
Algorithms is beginning to emerge as university courses and disciplines around
the world, spanning physics, math, and computer science departments alike. As a
continuation to its predecessor: "Introduction to Coding Quantum Algorithms: A
Tutorial Series Using Qiskit", 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.
Related papers
- 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) - Lecture notes on quantum computing [0.0]
The aim of this course is to provide a theoretical overview of quantum computing.
Lectures on these topics are compiled into 12 chapters, most of which contain a few suggested exercises at the end.
At Chalmers, the course is taught in seven weeks, with three two-hour lectures or tutorials per week.
arXiv Detail & Related papers (2023-11-14T18:42:55Z) - Quantum computing through the lens of control: A tutorial introduction [0.7179506962081081]
This paper provides a tutorial introduction to quantum computing from the perspective of control theory.
The tutorial only requires basic knowledge of linear algebra and, in particular, no prior exposure to quantum physics.
arXiv Detail & Related papers (2023-10-19T08:25:50Z) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - 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) - Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
We design, implement, and evaluate three hybrid quantum k-Means algorithms.
We exploit quantum phenomena to speed up the computation of distances.
We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
arXiv Detail & Related papers (2022-12-13T16:04:16Z) - 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) - 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) - Step-by-Step HHL Algorithm Walkthrough to Enhance the Understanding of
Critical Quantum Computing Concepts [0.0]
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.
arXiv Detail & Related papers (2021-08-20T05:24:07Z) - Topological Quantum Compiling with Reinforcement Learning [7.741584909637626]
We introduce an efficient algorithm that compiles an arbitrary single-qubit gate into a sequence of elementary gates from a finite universal set.
Our algorithm may carry over to other challenging quantum discrete problems, thus opening up a new avenue for intriguing applications of deep learning in quantum physics.
arXiv Detail & Related papers (2020-04-09T18:00:01Z)
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.