Related papers: How to Teach a Quantum Computer a Probability Distribution

How to Teach a Quantum Computer a Probability Distribution

URL: http://arxiv.org/abs/2104.07207v1
Date: Thu, 15 Apr 2021 02:41:27 GMT
Title: How to Teach a Quantum Computer a Probability Distribution
Authors: Clark Alexander
Abstract summary: We explore teaching a coined discrete time quantum walk on a regular graph a probability distribution. We also discuss some hardware and software concerns as well as immediate applications and the several connections to machine learning.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Currently there are three major paradigms of quantum computation, the gate model, annealing, and walks on graphs. The gate model and quantum walks on graphs are universal computation models, while annealing plays within a specific subset of scientific and numerical computations. Quantum walks on graphs have, however, not received such widespread attention and thus the door is wide open for new applications and algorithms to emerge. In this paper we explore teaching a coined discrete time quantum walk on a regular graph a probability distribution. We go through this exercise in two ways. First we adjust the angles in the maximal torus $\mathbb{T}^d$ where $d$ is the regularity of the graph. Second, we adjust the parameters of the basis of the Lie algebra $\mathfrak{su}(d)$. We also discuss some hardware and software concerns as well as immediate applications and the several connections to machine learning.

Related papers

Implementation of Continuous-Time Quantum Walks on Quantum Computers [0.0]
Quantum walks are interesting candidates to be implemented on quantum computers. We describe efficient circuits that implement the evolution operator of continuous-time quantum-walk-based search algorithms on three graph classes.
arXiv Detail & Related papers (2022-12-17T14:59:21Z)
A Quantum Algorithm for Computing All Diagnoses of a Switching Circuit [73.70667578066775]
Faults are by nature while most man-made systems, and especially computers, work deterministically. This paper provides such a connecting via quantum information theory which is an intuitive approach as quantum physics obeys probability laws.
arXiv Detail & Related papers (2022-09-08T17:55:30Z)
Discrete Quantum Walks on the Symmetric Group [0.0]
In quantum walks, the propagation is governed by quantum mechanical rules; generalizing random walks to the quantum setting. In this paper we investigate the discrete time coined quantum walk (DTCQW) model using tools from non-commutative Fourier analysis. Specifically, we are interested in characterizing the DTCQW on Cayley graphs generated by the symmetric group ($sym$) with appropriate generating sets.
arXiv Detail & Related papers (2022-03-28T23:48:08Z)
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)
Application of graph theory in quantum computer science [0.0]
We demonstrate that the continuous-time quantum walk models remain powerful for nontrivial graph structures. The quantum spatial search defined through CTQW has been proven to work well on various undirected graphs. In the scope of this aspect we analyze, whether quantum speed-up is observed for complicated graph structures as well.
arXiv Detail & Related papers (2021-09-27T12:07:25Z)
On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids [63.75363908696257]
The lackadaisical quantum walk is an algorithm developed to search graph structures whose vertices have a self-loop of weight $l$. This paper addresses several issues related to applying the lackadaisical quantum walk to search for multiple solutions on grids successfully.
arXiv Detail & Related papers (2021-06-11T09:43:09Z)
Quantum Walks, Feynman Propagators and Graph Topology on an IBM Quantum Computer [1.6339353215079129]
We use quantum walk algorithms to discover features of a data graph on which the walk takes place. This can be done faster on quantum computers where all paths can be explored using superposition. Our results from quantum computation using IBM's Qiskit quantum computing software were in good agreement with those obtained using classical computing methods.
arXiv Detail & Related papers (2021-04-13T19:02:42Z)
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)
PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations [77.34726150561087]
We introduce the PBS-calculus to represent and reason on quantum computations involving coherent control of quantum operations. We equip the language with an equational theory, which is proved to be sound and complete. We consider applications like the implementation of controlled permutations and the unrolling of loops.
arXiv Detail & Related papers (2020-02-21T16:15:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.