Theory and Implementation of the Quantum Approximate Optimization Algorithm: A Comprehensible Introduction and Case Study Using Qiskit and IBM Quantum Computers

• URL: http://arxiv.org/abs/2301.09535v1
• Date: Mon, 23 Jan 2023 16:38:06 GMT
• Title: Theory and Implementation of the Quantum Approximate Optimization Algorithm: A Comprehensible Introduction and Case Study Using Qiskit and IBM Quantum Computers
• Authors: Andreas Sturm
• Abstract summary: We lay our focus on practical aspects and step-by-step guide through the realization of a proof of concept quantum application. In every step we first explain the underlying theory and subsequently provide the implementation using IBM's Qiskit. As another central aspect of this tutorial we provide extensive experiments on the 27 qubits state-of-the-art quantum computer ibmq_ehningen.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The present tutorial aims to provide a comprehensible and easily accessible introduction into the theory and implementation of the famous Quantum Approximate Optimization Algorithm (QAOA). We lay our focus on practical aspects and step-by-step guide through the realization of a proof of concept quantum application based on a real-world use case. In every step we first explain the underlying theory and subsequently provide the implementation using IBM's Qiskit. In this way we provide a thorough understanding of the mathematical modelling and the (quantum) algorithms as well as the equally important knowledge how to properly write the code implementing those theoretical concepts. As another central aspect of this tutorial we provide extensive experiments on the 27 qubits state-of-the-art quantum computer ibmq_ehningen. From the discussion of these experiments we gain an overview on the current status of quantum computers and deduce which problem sizes can meaningfully be executed on today's hardware.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers [1.4163889780169499]
  Quantum characterization, verification, and validation (QCVV) QCVV methods and protocols enable scientists and engineers to scrutinize, understand, and enhance the performance of quantum information-processing devices. This Tutorial serves as a guidebook for researchers unfamiliar with the benchmarking and characterization of quantum computers.
  arXiv  Detail & Related papers  (2024-08-22T02:00:49Z)
• Efficient Quantum Modular Arithmetics for the ISQ Era [0.0]
  This study presents an array of quantum circuits, each precision-engineered for modular arithmetic functions. We provide a theoretical framework and practical implementations in the PennyLane quantum software.
  arXiv  Detail & Related papers  (2023-11-14T21:34:39Z)
• 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 Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• A Herculean task: Classical simulation of quantum computers [4.12322586444862]
  This work reviews the state-of-the-art numerical simulation methods that emulate quantum computer evolution under specific operations. We focus on the mainstream state-vector and tensor-network paradigms while briefly mentioning alternative methods.
  arXiv  Detail & Related papers  (2023-02-17T13:59:53Z)
• 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)
• 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)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Quantum Computing: an undergraduate approach using Qiskit [0.0]
  We present the Quantum Information Software Developer Kit - Qiskit, for teaching quantum computing to undergraduate students. We focus on presenting the construction of the programs on any common laptop or desktop computer and their execution on real quantum processors. The codes are made available throughout the text so that readers, even with little experience in scientific computing, can reproduce them.
  arXiv  Detail & Related papers  (2021-01-26T18:19:23Z)

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.