Optimizing the walk coin in the quantum random walk search algorithm through machine learning

• URL: http://arxiv.org/abs/2105.08020v2
• Date: Sat, 3 Jul 2021 10:06:16 GMT
• Title: Optimizing the walk coin in the quantum random walk search algorithm through machine learning
• Authors: Hristo Tonchev and Petar Danev
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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, against inaccuracies in the phases used to construct the coin. The optimization of the algorithm is done by numerical methods - Monte Carlo, neural networks, and supervised machine learning. The results of numerical simulations show that, with such a construction of the Householder reflection, the algorithm is more stable to inaccuracies in the specific values of these phases, as long as it is possible to control the phase difference between the phase shift and the phase involved in the Householder reflection. This paper explicitly shows as an example, how achieving a properly designed phase difference would make quantum random walk search on a hypercube more stable for coin register consisting of one, two, and three qubits.

Related papers

• Complex-Phase Extensions of Szegedy Quantum Walk on Graphs [0.0]
  This work introduces a graph-phased Szegedy's quantum walk, which incorporates link phases and local arbitrary phase rotations (APR) We demonstrate how to adapt quantum circuits to these advancements, allowing phase patterns that ensure computational practicality. Our findings illuminate the path towards more versatile and powerful quantum computing paradigms.
  arXiv  Detail & Related papers  (2024-10-29T12:57:31Z)
• 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)
• 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)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• 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)
• 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)
• 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)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• 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)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.