High robustness quantum walk search algorithm with qudit Householder traversing coin, machine learning study

• URL: http://arxiv.org/abs/2111.10926v2
• Date: Thu, 2 Dec 2021 21:42:11 GMT
• Title: High robustness quantum walk search algorithm with qudit Householder traversing coin, machine learning study
• Authors: Hristo Tonchev and Petar Danev
• Abstract summary: In this work the quantum random walk search algorithm with walk coin constructed by generalized Householder reflection and phase multiplier has been studied. The coin register is one qudit with arbitrary dimension. Monte Carlo simulations, in combination with supervised machine learning, are used to find walk coins making the quantum algorithm more robust to deviations in the coin's parameters.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work the quantum random walk search algorithm with walk coin constructed by generalized Householder reflection and phase multiplier has been studied. The coin register is one qudit with arbitrary dimension. Monte Carlo simulations, in combination with supervised machine learning, are used to find walk coins making the quantum algorithm more robust to deviations in the coin's parameters. By applying deep neural network we make prediction for the parameters of an optimal coin with arbitrary size and estimate the stability for such coin.

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)
• Influence of generic quantum coins on the spreading and entanglement in binary aperiodic quantum walks [0.0]
  We investigate the influence of generic quantum coins on the hybrid entanglement and spreading behavior of different binary quantum walks. We show that each considered walk is differently but significantly influenced by the choice of quantum coins.
  arXiv  Detail & Related papers  (2023-07-12T17:53:20Z)
• 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)
• Maximal entanglement between a quantum walker and her quantum coin for the third step and beyond regardless of the initial state [0.0]
  We study maximal entanglement generation between a walker and her coin via a discrete-time quantum walk. We solve maximal-entanglement generation as an optimization problem with quantum process fidelity as the cost function. We demonstrate a ten-step quantum walk with such coin sequences and thereby show the desired high-dimensional bipartite entanglement.
  arXiv  Detail & Related papers  (2022-09-05T02:24:29Z)
• Reducing number of gates in quantum random walk search algorithm via modification of coin operators [0.0]
  This paper examines a way to simplify the circuit of quantum random walk search algorithm. It is shown explicitly how to construct such walk coin in order to obtain more robust quantum algorithm.
  arXiv  Detail & Related papers  (2022-04-27T11:41:08Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• 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)
• Optimizing the walk coin in the quantum random walk search algorithm through machine learning [0.0]
  This paper examines the stability of the quantum random walk search algorithm, when the walk coin is constructed by generalized Householder reflection and additional phase shift. The optimization of the algorithm is done by numerical methods - Monte Carlo, neural networks, and supervised machine learning.
  arXiv  Detail & Related papers  (2021-05-17T17:13:49Z)
• One-dimensional discrete-time quantum walks with general coin [0.0]
  We provide an algorithm for the one-dimensional quantum walk driven by the general coin operator. The study conducted on general coin operator also includes the popular coins -- Hadamard, Grover, and Fourier coins.
  arXiv  Detail & Related papers  (2021-02-14T17:42:43Z)
• Random Walks: A Review of Algorithms and Applications [37.226218097358284]
  In computer science, classical random walks and quantum walks can be used to calculate the proximity between nodes and extract the topology in the network. Various random walk related models can be applied in different fields, which is of great significance to downstream tasks such as link prediction, recommendation, computer vision, semi-supervised learning, and network embedding.
  arXiv  Detail & Related papers  (2020-08-09T03:41:56Z)
• Variational Monte Carlo calculations of $\mathbf{A\leq 4}$ nuclei with an artificial neural-network correlator ansatz [62.997667081978825]
  We introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei. We compute the binding energies and point-nucleon densities of $Aleq 4$ nuclei as emerging from a leading-order pionless effective field theory Hamiltonian.
  arXiv  Detail & Related papers  (2020-07-28T14:52:28Z)

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.