Advancing Quantum Computing with Formal Methods
- URL: http://arxiv.org/abs/2407.11675v1
- Date: Tue, 16 Jul 2024 12:51:38 GMT
- Title: Advancing Quantum Computing with Formal Methods
- Authors: Arend-Jan Quist, Jingyi Mei, Tim Coopmans, Alfons Laarman,
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This tutorial introduces quantum computing with a focus on the applicability of formal methods in this relatively new domain. We describe quantum circuits and convey an understanding of their inherent combinatorial nature and the exponential blow-up that makes them hard to analyze. Then, we show how weighted model counting (\#SAT) can be used to solve hard analysis tasks for quantum circuits. 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 (particularly matrix multiplication and basis vectors) is a prerequisite. The goal of the tutorial is to inspire the community to advance the development of quantum computing with formal methods.
Related papers
- Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - Learning, Optimizing, and Simulating Fermions with Quantum Computers [2.810160553339817]
We will explore how the tools of quantum information and computation can assist us on both of these fronts.
We primarily do so through the task of partial state learning: tomographic protocols for acquiring a reduced, but sufficient, classical description of a quantum system.
At the same time, in the search for such protocols, we also refine our notion of what it means to learn quantum states.
arXiv Detail & Related papers (2023-12-16T09:57:47Z) - 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 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) - An Introduction to Quantum Computing for Statisticians [2.3757641219977392]
Quantum computing has the potential to revolutionise and change the way we live and understand the world.
This review aims to provide an accessible introduction to quantum computing with a focus on applications in statistics and data analysis.
arXiv Detail & Related papers (2021-12-13T12:08:28Z) - 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) - Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task.
Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate.
The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
arXiv Detail & Related papers (2021-06-06T13:15:25Z) - The Hintons in your Neural Network: a Quantum Field Theory View of Deep
Learning [84.33745072274942]
We show how to represent linear and non-linear layers as unitary quantum gates, and interpret the fundamental excitations of the quantum model as particles.
On top of opening a new perspective and techniques for studying neural networks, the quantum formulation is well suited for optical quantum computing.
arXiv Detail & Related papers (2021-03-08T17:24:29Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - Quantum Technology for Economists [0.2867517731896504]
We discuss basic concepts in quantum computing and quantum communication.
We provide an overview of quantum money, an early invention of quantum communication literature.
We review all existing quantum speedups that have been identified for algorithms used to solve and estimate economic models.
arXiv Detail & Related papers (2020-12-08T15:14: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.