Quantum Finite Automata and Quiver Algebras

• URL: http://arxiv.org/abs/2203.07597v1
• Date: Tue, 15 Mar 2022 02:12:13 GMT
• Title: Quantum Finite Automata and Quiver Algebras
• Authors: George Jeffreys and Siu-Cheong Lau
• Abstract summary: We reformulate quantum finite automata with multiple-time measurements using the notion of near-ring. This gives a unified understanding towards quantum computing and deep learning.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We find an application in quantum finite automata for the ideas and results of [JL21] and [JL22]. We reformulate quantum finite automata with multiple-time measurements using the algebraic notion of near-ring. This gives a unified understanding towards quantum computing and deep learning. When the near-ring comes from a quiver, we have a nice moduli space of computing machines with metric that can be optimized by gradient descent.

Related papers

• Generalized quantum Arimoto-Blahut algorithm and its application to quantum information bottleneck [55.22418739014892]
  We generalize the quantum Arimoto-Blahut algorithm by Ramakrishnan et al. We apply our algorithm to the quantum information bottleneck with three quantum systems. Our numerical analysis shows that our algorithm is better than their algorithm.
  arXiv  Detail & Related papers  (2023-11-19T00:06:11Z)
• Monte Carlo Graph Search for Quantum Circuit Optimization [26.114550071165628]
  This work proposes a quantum architecture search algorithm based on a Monte Carlo graph search and measures of importance sampling. It is applicable to the optimization of gate order, both for discrete gates, as well as gates containing continuous variables.
  arXiv  Detail & Related papers  (2023-07-14T14:01:25Z)
• 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)
• Quantum Machine Learning using the ZXW-Calculus [0.0]
  We use the ZXW-calculus to diagrammatically analyse two key problems that quantum machine learning applications face. First, we discuss algorithms to compute gradients on quantum hardware that are needed to perform gradient-based optimisation for QML. Secondly, we analyse the gradient landscape of quantum ans"atze for barren plateaus using both empirical and analytical techniques.
  arXiv  Detail & Related papers  (2022-10-18T22:33:41Z)
• Quantum Depth in the Random Oracle Model [57.663890114335736]
  We give a comprehensive characterization of the computational power of shallow quantum circuits combined with classical computation. For some problems, the ability to perform adaptive measurements in a single shallow quantum circuit is more useful than the ability to perform many shallow quantum circuits without adaptive measurements.
  arXiv  Detail & Related papers  (2022-10-12T17:54:02Z)
• Variance minimisation on a quantum computer for nuclear structure [0.0]
  We present a variance based method of finding the excited state spectrum of a small nuclear system using a quantum computer. Our aim is to develop quantum computing algorithms which can reproduce and predict nuclear structure.
  arXiv  Detail & Related papers  (2022-09-16T09:38:07Z)
• Automated Generation of Shuttling Sequences for a Linear Segmented Ion Trap Quantum Computer [26.47874938214435]
  A promising approach for scaling-up trapped-ion quantum computer platforms is by storing multiple trapped-ion qubit sets ('ion crystals') in segmented microchip traps. Here, we describe an algorithm for fully automated generation of shuttling schedules. We find that for quantum circuits which contain a fixed structure, advanced assignment algorithms can serve to reduce the shuttling overhead.
  arXiv  Detail & Related papers  (2022-08-09T16:16:43Z)
• An Introduction to Quantum Machine Learning for Engineers [36.18344598412261]
  Quantum machine learning is emerging as a dominant paradigm to program gate-based quantum computers. This book provides a self-contained introduction to quantum machine learning for an audience of engineers with a background in probability and linear algebra.
  arXiv  Detail & Related papers  (2022-05-11T12:10:52Z)
• Cost-efficient QFA Algorithm for Quantum Computers [0.0]
  We present a modified Moore-Crutchfield quantum finite automaton (MCQFA) algorithm for the language $mathttMOD_p$. We obtain shorter quantum programs using fewer basis gates compared to the implementation of the original algorithm given in the literature.
  arXiv  Detail & Related papers  (2021-07-05T20:41:18Z)
• Parallel Quantum Simulation of Large Systems on Small Quantum Computers [0.2348805691644085]
  NISQ networks permit computational and entanglement resources to be concentrated in interesting regions of Hilbert space. We provide Cirq and Qiskit code that translate infinite, translationally invariant matrix product state (iMPS) algorithms to finite-depth quantum circuit machines. Illustrative simulated output of these codes for achievable circuit sizes is given.
  arXiv  Detail & Related papers  (2020-03-26T18:05:45Z)
• Quantum circuit-like learning: A fast and scalable classical machine-learning algorithm with similar performance to quantum circuit learning [0.0]
  We propose a classical machine learning algorithm that uses the same Hilbert space as quantum circuit learning (QCL) In numerical simulations, our proposed algorithm demonstrates similar performance to QCL for several ML tasks.
  arXiv  Detail & Related papers  (2020-03-24T05:19:38Z)

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.