Reducing number of gates in quantum random walk search algorithm via modification of coin operators

• URL: http://arxiv.org/abs/2204.12858v1
• Date: Wed, 27 Apr 2022 11:41:08 GMT
• Title: Reducing number of gates in quantum random walk search algorithm via modification of coin operators
• Authors: Hristo Tonchev and Petar Danev
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper examines a way to simplify the circuit of quantum random walk search algorithm, when the traversing coin is constructed by both generalized Householder reflection and an additional phase multiplier. If an appropriate relation between corresponding parameters is realized, our algorithm becomes more robust to deviations in the phases. In this modification marking coin is not needed, and all advantages from above mentioned optimization to the stability, are preserved. It is shown explicitly how to construct such walk coin in order to obtain more robust quantum algorithm.

Related papers

• Robustness of Quantum Random Walk Search with multi-phase matching [0.0]
  We show that usage of a particular sequence of phases can make the algorithm more robust even if there is no preserved connection between the phases in the traversing coin.
  arXiv  Detail & Related papers  (2024-04-07T21:52:35Z)
• 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)
• Robustness of Quantum Random Walk Search Algorithm in Hypercube when only first or both first and second neighbors are measured [0.0]
  We study the robustness of two modifications of quantum random walk search algorithm on hypercube. The most important one, in view of our study of the robustness, is an increase in the stability of the algorithm, especially for large coin dimensions.
  arXiv  Detail & Related papers  (2023-05-24T11:55:52Z)
• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• Double-bracket quantum algorithms for diagonalization [0.0]
  This work proposes double-bracket iterations as a framework for obtaining diagonalizing quantum circuits. Their implementation on a quantum computer consists of interlacing evolutions generated by the input Hamiltonian with diagonal evolutions which can be chosen variationally.
  arXiv  Detail & Related papers  (2022-06-23T15:13:46Z)
• High robustness quantum walk search algorithm with qudit Householder traversing coin, machine learning study [0.0]
  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.
  arXiv  Detail & Related papers  (2021-11-21T23:58:17Z)
• 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)
• Quantum Compiling by Deep Reinforcement Learning [30.189226681406392]
  The architecture of circuital quantum computers requires layers devoted to compiling high-level quantum algorithms into lower-level circuits of quantum gates. The general problem of quantum compiling is to approximate any unitary transformation that describes the quantum computation, as a sequence of elements selected from a finite base of universal quantum gates. We exploit the deep reinforcement learning method as an alternative strategy, which has a significantly different trade-off between search time and exploitation time.
  arXiv  Detail & Related papers  (2021-05-31T15:32:15Z)
• 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)
• Efficient Algorithms for Causal Order Discovery in Quantum Networks [44.356294905844834]
  Given black-box access to the input and output systems, we develop the first efficient quantum causal order discovery algorithm. We model the causal order with quantum combs, and our algorithms output the order of inputs and outputs that the given process is compatible with. Our algorithms will provide efficient ways to detect and optimize available transmission paths in quantum communication networks.
  arXiv  Detail & Related papers  (2020-12-03T07:12:08Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.